./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 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-cond-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:56:25,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:56:25,821 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:25,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:56:25,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:56:25,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:56:25,851 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:56:25,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:56:25,852 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:56:25,852 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:56:25,853 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:56:25,853 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:56:25,853 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:56:25,853 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:56:25,854 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:56:25,855 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:25,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:56:25,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:56:25,856 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-04 06:56:26,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:56:26,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:56:26,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:56:26,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:56:26,115 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:56:26,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 06:56:27,337 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730522c6/50752e3c1c79499fad37d290aeaa24ed/FLAGf22ce7ab9 [2025-03-04 06:56:27,567 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:27,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-04 06:56:27,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730522c6/50752e3c1c79499fad37d290aeaa24ed/FLAGf22ce7ab9 [2025-03-04 06:56:27,590 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1730522c6/50752e3c1c79499fad37d290aeaa24ed [2025-03-04 06:56:27,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:27,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:27,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:27,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:27,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:27,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:27" (1/1) ... [2025-03-04 06:56:27,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@634d8c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:27, skipping insertion in model container [2025-03-04 06:56:27,603 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:27" (1/1) ... [2025-03-04 06:56:27,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:27,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:27,789 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:27,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:27,832 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:27,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:27 WrapperNode [2025-03-04 06:56:27,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:27,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:27,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:27,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:27,838 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:27" (1/1) ... [2025-03-04 06:56:27,847 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:27" (1/1) ... [2025-03-04 06:56:27,878 INFO L138 Inliner]: procedures = 23, calls = 24, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 256 [2025-03-04 06:56:27,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:27,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:27,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:27,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:27,890 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:27" (1/1) ... [2025-03-04 06:56:27,891 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:27" (1/1) ... [2025-03-04 06:56:27,894 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:27" (1/1) ... [2025-03-04 06:56:27,895 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:27" (1/1) ... [2025-03-04 06:56:27,901 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:27" (1/1) ... [2025-03-04 06:56:27,902 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:27" (1/1) ... [2025-03-04 06:56:27,905 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:27" (1/1) ... [2025-03-04 06:56:27,908 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:27" (1/1) ... [2025-03-04 06:56:27,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:27,913 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:27,913 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:27,914 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:27,914 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:27" (1/1) ... [2025-03-04 06:56:27,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:27,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:27,940 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:27,942 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:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:27,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:27,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:56:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:27,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:56:27,963 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:28,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:28,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:28,489 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:28,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:28,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:28,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:28,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:28 BoogieIcfgContainer [2025-03-04 06:56:28,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:28,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:28,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:28,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:28,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:27" (1/3) ... [2025-03-04 06:56:28,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7748d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:28, skipping insertion in model container [2025-03-04 06:56:28,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:27" (2/3) ... [2025-03-04 06:56:28,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb7748d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:28, skipping insertion in model container [2025-03-04 06:56:28,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:28" (3/3) ... [2025-03-04 06:56:28,513 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-04 06:56:28,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:28,527 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 325 locations, 1 initial locations, 3 loop locations, and 39 error locations. [2025-03-04 06:56:28,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:28,638 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:56:28,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 342 transitions, 698 flow [2025-03-04 06:56:28,788 INFO L124 PetriNetUnfolderBase]: 18/340 cut-off events. [2025-03-04 06:56:28,791 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 340 events. 18/340 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 754 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 215. Up to 2 conditions per place. [2025-03-04 06:56:28,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 342 transitions, 698 flow [2025-03-04 06:56:28,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 313 places, 323 transitions, 658 flow [2025-03-04 06:56:28,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:28,828 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;@3f977745, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:28,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-03-04 06:56:28,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:28,835 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-03-04 06:56:28,835 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:28,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:28,836 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:28,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1596505495, now seen corresponding path program 1 times [2025-03-04 06:56:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:28,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057337652] [2025-03-04 06:56:28,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:28,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 06:56:28,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 06:56:28,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:28,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:28,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:28,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:28,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057337652] [2025-03-04 06:56:28,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057337652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:28,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:28,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021218343] [2025-03-04 06:56:28,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:28,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:29,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:29,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 342 [2025-03-04 06:56:29,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 323 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 342 [2025-03-04 06:56:29,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,146 INFO L124 PetriNetUnfolderBase]: 19/476 cut-off events. [2025-03-04 06:56:29,146 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 06:56:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 476 events. 19/476 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1782 event pairs, 5 based on Foata normal form. 10/400 useless extension candidates. Maximal degree in co-relation 383. Up to 24 conditions per place. [2025-03-04 06:56:29,151 INFO L140 encePairwiseOnDemand]: 330/342 looper letters, 10 selfloop transitions, 2 changer transitions 3/313 dead transitions. [2025-03-04 06:56:29,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 313 transitions, 662 flow [2025-03-04 06:56:29,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-03-04 06:56:29,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9483430799220273 [2025-03-04 06:56:29,166 INFO L175 Difference]: Start difference. First operand has 313 places, 323 transitions, 658 flow. Second operand 3 states and 973 transitions. [2025-03-04 06:56:29,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 313 transitions, 662 flow [2025-03-04 06:56:29,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 313 transitions, 654 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:56:29,177 INFO L231 Difference]: Finished difference. Result has 310 places, 310 transitions, 628 flow [2025-03-04 06:56:29,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=310, PETRI_TRANSITIONS=310} [2025-03-04 06:56:29,183 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -3 predicate places. [2025-03-04 06:56:29,183 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 310 transitions, 628 flow [2025-03-04 06:56:29,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,184 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:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:29,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:29,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,184 INFO L85 PathProgramCache]: Analyzing trace with hash -561032109, now seen corresponding path program 1 times [2025-03-04 06:56:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752340724] [2025-03-04 06:56:29,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 06:56:29,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 06:56:29,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,239 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:29,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752340724] [2025-03-04 06:56:29,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752340724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:29,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:29,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058649928] [2025-03-04 06:56:29,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:29,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:29,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:29,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-04 06:56:29,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-04 06:56:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,343 INFO L124 PetriNetUnfolderBase]: 20/468 cut-off events. [2025-03-04 06:56:29,343 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:56:29,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 468 events. 20/468 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1601 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 477. Up to 28 conditions per place. [2025-03-04 06:56:29,346 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 13 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-03-04 06:56:29,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 656 flow [2025-03-04 06:56:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:29,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-03-04 06:56:29,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337231968810916 [2025-03-04 06:56:29,349 INFO L175 Difference]: Start difference. First operand has 310 places, 310 transitions, 628 flow. Second operand 3 states and 958 transitions. [2025-03-04 06:56:29,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 656 flow [2025-03-04 06:56:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 652 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:29,356 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2025-03-04 06:56:29,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2025-03-04 06:56:29,357 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -7 predicate places. [2025-03-04 06:56:29,357 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2025-03-04 06:56:29,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,358 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:29,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:29,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:29,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1544256989, now seen corresponding path program 1 times [2025-03-04 06:56:29,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894928223] [2025-03-04 06:56:29,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 06:56:29,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 06:56:29,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,391 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:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894928223] [2025-03-04 06:56:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894928223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664812320] [2025-03-04 06:56:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:29,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:29,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 342 [2025-03-04 06:56:29,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 342 [2025-03-04 06:56:29,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,554 INFO L124 PetriNetUnfolderBase]: 66/965 cut-off events. [2025-03-04 06:56:29,554 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2025-03-04 06:56:29,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 965 events. 66/965 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4919 event pairs, 20 based on Foata normal form. 0/786 useless extension candidates. Maximal degree in co-relation 1016. Up to 77 conditions per place. [2025-03-04 06:56:29,563 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 16 selfloop transitions, 1 changer transitions 0/303 dead transitions. [2025-03-04 06:56:29,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 303 transitions, 648 flow [2025-03-04 06:56:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 947 transitions. [2025-03-04 06:56:29,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9230019493177388 [2025-03-04 06:56:29,566 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 947 transitions. [2025-03-04 06:56:29,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 303 transitions, 648 flow [2025-03-04 06:56:29,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 303 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:29,571 INFO L231 Difference]: Finished difference. Result has 300 places, 303 transitions, 612 flow [2025-03-04 06:56:29,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=300, PETRI_TRANSITIONS=303} [2025-03-04 06:56:29,572 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2025-03-04 06:56:29,572 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 303 transitions, 612 flow [2025-03-04 06:56:29,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,573 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:29,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:29,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:29,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash 814559261, now seen corresponding path program 1 times [2025-03-04 06:56:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943387443] [2025-03-04 06:56:29,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:29,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:29,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:29,653 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:29,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:29,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943387443] [2025-03-04 06:56:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943387443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:29,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567048030] [2025-03-04 06:56:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:29,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:29,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:29,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:29,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 342 [2025-03-04 06:56:29,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 303 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:29,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 342 [2025-03-04 06:56:29,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:29,727 INFO L124 PetriNetUnfolderBase]: 20/458 cut-off events. [2025-03-04 06:56:29,727 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-04 06:56:29,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 458 events. 20/458 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1529 event pairs, 7 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 456. Up to 26 conditions per place. [2025-03-04 06:56:29,730 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 11 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2025-03-04 06:56:29,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 636 flow [2025-03-04 06:56:29,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-04 06:56:29,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9376218323586745 [2025-03-04 06:56:29,733 INFO L175 Difference]: Start difference. First operand has 300 places, 303 transitions, 612 flow. Second operand 3 states and 962 transitions. [2025-03-04 06:56:29,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 636 flow [2025-03-04 06:56:29,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:29,737 INFO L231 Difference]: Finished difference. Result has 300 places, 302 transitions, 613 flow [2025-03-04 06:56:29,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=300, PETRI_TRANSITIONS=302} [2025-03-04 06:56:29,738 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -13 predicate places. [2025-03-04 06:56:29,739 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 302 transitions, 613 flow [2025-03-04 06:56:29,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:29,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:29,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] [2025-03-04 06:56:29,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:29,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:29,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2135581595, now seen corresponding path program 1 times [2025-03-04 06:56:29,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:29,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333354181] [2025-03-04 06:56:29,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:29,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:29,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:29,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:29,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:29,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,245 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:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333354181] [2025-03-04 06:56:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333354181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:30,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341112263] [2025-03-04 06:56:30,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:30,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:30,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 342 [2025-03-04 06:56:30,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 302 transitions, 613 flow. Second operand has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 342 [2025-03-04 06:56:30,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,554 INFO L124 PetriNetUnfolderBase]: 131/1251 cut-off events. [2025-03-04 06:56:30,554 INFO L125 PetriNetUnfolderBase]: For 28/29 co-relation queries the response was YES. [2025-03-04 06:56:30,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 1251 events. 131/1251 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6944 event pairs, 64 based on Foata normal form. 0/1020 useless extension candidates. Maximal degree in co-relation 1424. Up to 192 conditions per place. [2025-03-04 06:56:30,563 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 28 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2025-03-04 06:56:30,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 677 flow [2025-03-04 06:56:30,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1816 transitions. [2025-03-04 06:56:30,567 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.884990253411306 [2025-03-04 06:56:30,567 INFO L175 Difference]: Start difference. First operand has 300 places, 302 transitions, 613 flow. Second operand 6 states and 1816 transitions. [2025-03-04 06:56:30,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 677 flow [2025-03-04 06:56:30,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:30,571 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 617 flow [2025-03-04 06:56:30,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=617, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2025-03-04 06:56:30,574 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -11 predicate places. [2025-03-04 06:56:30,575 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 617 flow [2025-03-04 06:56:30,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 298.5) internal successors, (1791), 6 states have internal predecessors, (1791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:30,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:30,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 503013522, now seen corresponding path program 1 times [2025-03-04 06:56:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646117224] [2025-03-04 06:56:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 06:56:30,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 06:56:30,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,632 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:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646117224] [2025-03-04 06:56:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646117224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972173699] [2025-03-04 06:56:30,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 342 [2025-03-04 06:56:30,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 617 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 342 [2025-03-04 06:56:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,714 INFO L124 PetriNetUnfolderBase]: 44/838 cut-off events. [2025-03-04 06:56:30,714 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 06:56:30,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 838 events. 44/838 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4348 event pairs, 9 based on Foata normal form. 0/699 useless extension candidates. Maximal degree in co-relation 881. Up to 45 conditions per place. [2025-03-04 06:56:30,719 INFO L140 encePairwiseOnDemand]: 337/342 looper letters, 12 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2025-03-04 06:56:30,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 301 transitions, 646 flow [2025-03-04 06:56:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2025-03-04 06:56:30,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9434697855750487 [2025-03-04 06:56:30,721 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 617 flow. Second operand 3 states and 968 transitions. [2025-03-04 06:56:30,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 301 transitions, 646 flow [2025-03-04 06:56:30,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 301 transitions, 636 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:30,725 INFO L231 Difference]: Finished difference. Result has 297 places, 300 transitions, 615 flow [2025-03-04 06:56:30,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=297, PETRI_TRANSITIONS=300} [2025-03-04 06:56:30,727 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -16 predicate places. [2025-03-04 06:56:30,727 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 300 transitions, 615 flow [2025-03-04 06:56:30,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:30,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:30,729 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:30,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,729 INFO L85 PathProgramCache]: Analyzing trace with hash 135592642, now seen corresponding path program 1 times [2025-03-04 06:56:30,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744433422] [2025-03-04 06:56:30,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:56:30,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:56:30,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744433422] [2025-03-04 06:56:30,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744433422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845601954] [2025-03-04 06:56:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-04 06:56:30,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 300 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-04 06:56:30,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:30,837 INFO L124 PetriNetUnfolderBase]: 26/494 cut-off events. [2025-03-04 06:56:30,838 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2025-03-04 06:56:30,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 494 events. 26/494 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1793 event pairs, 1 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 513. Up to 21 conditions per place. [2025-03-04 06:56:30,842 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 11 selfloop transitions, 3 changer transitions 0/297 dead transitions. [2025-03-04 06:56:30,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 297 transitions, 638 flow [2025-03-04 06:56:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-04 06:56:30,845 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2025-03-04 06:56:30,845 INFO L175 Difference]: Start difference. First operand has 297 places, 300 transitions, 615 flow. Second operand 3 states and 960 transitions. [2025-03-04 06:56:30,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 297 transitions, 638 flow [2025-03-04 06:56:30,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 297 transitions, 638 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:30,849 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 613 flow [2025-03-04 06:56:30,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=613, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2025-03-04 06:56:30,850 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2025-03-04 06:56:30,851 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 613 flow [2025-03-04 06:56:30,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:30,852 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:30,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:30,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:30,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1974854362, now seen corresponding path program 1 times [2025-03-04 06:56:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429147001] [2025-03-04 06:56:30,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:30,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:30,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 06:56:30,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 06:56:30,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:30,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:30,900 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:30,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:30,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429147001] [2025-03-04 06:56:30,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429147001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:30,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:30,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:30,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429383051] [2025-03-04 06:56:30,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:30,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:30,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:30,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:30,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:30,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 342 [2025-03-04 06:56:30,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 613 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:30,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:30,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 342 [2025-03-04 06:56:30,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:31,014 INFO L124 PetriNetUnfolderBase]: 39/539 cut-off events. [2025-03-04 06:56:31,015 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-03-04 06:56:31,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 539 events. 39/539 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2200 event pairs, 3 based on Foata normal form. 1/485 useless extension candidates. Maximal degree in co-relation 612. Up to 73 conditions per place. [2025-03-04 06:56:31,018 INFO L140 encePairwiseOnDemand]: 325/342 looper letters, 19 selfloop transitions, 6 changer transitions 4/287 dead transitions. [2025-03-04 06:56:31,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 287 transitions, 650 flow [2025-03-04 06:56:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:31,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2025-03-04 06:56:31,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957115009746589 [2025-03-04 06:56:31,023 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 613 flow. Second operand 3 states and 919 transitions. [2025-03-04 06:56:31,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 287 transitions, 650 flow [2025-03-04 06:56:31,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:31,027 INFO L231 Difference]: Finished difference. Result has 285 places, 282 transitions, 590 flow [2025-03-04 06:56:31,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=285, PETRI_TRANSITIONS=282} [2025-03-04 06:56:31,029 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2025-03-04 06:56:31,030 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 282 transitions, 590 flow [2025-03-04 06:56:31,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:31,031 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:31,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:31,031 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:31,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:31,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1933662976, now seen corresponding path program 1 times [2025-03-04 06:56:31,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:31,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503077828] [2025-03-04 06:56:31,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:31,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:31,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:56:31,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:56:31,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:31,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:31,064 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:31,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:31,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503077828] [2025-03-04 06:56:31,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503077828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:31,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:31,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:31,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370784931] [2025-03-04 06:56:31,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:31,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:31,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:31,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 342 [2025-03-04 06:56:31,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 282 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:31,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 342 [2025-03-04 06:56:31,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:31,162 INFO L124 PetriNetUnfolderBase]: 69/1025 cut-off events. [2025-03-04 06:56:31,162 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:56:31,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1025 events. 69/1025 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5276 event pairs, 7 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 1124. Up to 69 conditions per place. [2025-03-04 06:56:31,167 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 3 changer transitions 0/283 dead transitions. [2025-03-04 06:56:31,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 283 transitions, 628 flow [2025-03-04 06:56:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-04 06:56:31,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2025-03-04 06:56:31,169 INFO L175 Difference]: Start difference. First operand has 285 places, 282 transitions, 590 flow. Second operand 3 states and 963 transitions. [2025-03-04 06:56:31,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 283 transitions, 628 flow [2025-03-04 06:56:31,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 283 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:31,174 INFO L231 Difference]: Finished difference. Result has 278 places, 281 transitions, 591 flow [2025-03-04 06:56:31,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=278, PETRI_TRANSITIONS=281} [2025-03-04 06:56:31,175 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -35 predicate places. [2025-03-04 06:56:31,175 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 281 transitions, 591 flow [2025-03-04 06:56:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:31,176 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:31,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:31,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:31,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:31,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1156666140, now seen corresponding path program 1 times [2025-03-04 06:56:31,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:31,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230018680] [2025-03-04 06:56:31,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:31,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:56:31,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:56:31,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:31,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:31,282 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:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230018680] [2025-03-04 06:56:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230018680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:31,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48524468] [2025-03-04 06:56:31,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:31,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:31,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:31,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:31,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 342 [2025-03-04 06:56:31,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 281 transitions, 591 flow. Second operand has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:31,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 342 [2025-03-04 06:56:31,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:31,430 INFO L124 PetriNetUnfolderBase]: 67/1265 cut-off events. [2025-03-04 06:56:31,431 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:56:31,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 1265 events. 67/1265 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7000 event pairs, 5 based on Foata normal form. 0/1133 useless extension candidates. Maximal degree in co-relation 1344. Up to 31 conditions per place. [2025-03-04 06:56:31,439 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 13 selfloop transitions, 6 changer transitions 0/290 dead transitions. [2025-03-04 06:56:31,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 290 transitions, 651 flow [2025-03-04 06:56:31,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1620 transitions. [2025-03-04 06:56:31,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9473684210526315 [2025-03-04 06:56:31,442 INFO L175 Difference]: Start difference. First operand has 278 places, 281 transitions, 591 flow. Second operand 5 states and 1620 transitions. [2025-03-04 06:56:31,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 290 transitions, 651 flow [2025-03-04 06:56:31,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 290 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:31,446 INFO L231 Difference]: Finished difference. Result has 285 places, 285 transitions, 629 flow [2025-03-04 06:56:31,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=629, PETRI_PLACES=285, PETRI_TRANSITIONS=285} [2025-03-04 06:56:31,447 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -28 predicate places. [2025-03-04 06:56:31,447 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 285 transitions, 629 flow [2025-03-04 06:56:31,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 321.25) internal successors, (1285), 4 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:31,448 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:31,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1512827576, now seen corresponding path program 1 times [2025-03-04 06:56:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697725578] [2025-03-04 06:56:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:31,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 06:56:31,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 06:56:31,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:31,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:31,786 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:31,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:31,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697725578] [2025-03-04 06:56:31,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697725578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:31,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:31,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:31,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527681605] [2025-03-04 06:56:31,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:31,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:31,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:31,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:31,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:31,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 342 [2025-03-04 06:56:31,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 285 transitions, 629 flow. Second operand has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:31,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 342 [2025-03-04 06:56:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:32,099 INFO L124 PetriNetUnfolderBase]: 56/973 cut-off events. [2025-03-04 06:56:32,099 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-04 06:56:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 973 events. 56/973 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4780 event pairs, 4 based on Foata normal form. 0/881 useless extension candidates. Maximal degree in co-relation 1073. Up to 24 conditions per place. [2025-03-04 06:56:32,109 INFO L140 encePairwiseOnDemand]: 336/342 looper letters, 15 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2025-03-04 06:56:32,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 288 transitions, 681 flow [2025-03-04 06:56:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1899 transitions. [2025-03-04 06:56:32,114 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9254385964912281 [2025-03-04 06:56:32,114 INFO L175 Difference]: Start difference. First operand has 285 places, 285 transitions, 629 flow. Second operand 6 states and 1899 transitions. [2025-03-04 06:56:32,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 288 transitions, 681 flow [2025-03-04 06:56:32,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:32,121 INFO L231 Difference]: Finished difference. Result has 289 places, 284 transitions, 639 flow [2025-03-04 06:56:32,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=289, PETRI_TRANSITIONS=284} [2025-03-04 06:56:32,123 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -24 predicate places. [2025-03-04 06:56:32,123 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 284 transitions, 639 flow [2025-03-04 06:56:32,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 314.5) internal successors, (1887), 6 states have internal predecessors, (1887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:32,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:32,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:32,125 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:32,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1849030519, now seen corresponding path program 1 times [2025-03-04 06:56:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:32,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-03-04 06:56:32,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:32,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:56:32,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:56:32,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:32,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:32,208 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:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214322331] [2025-03-04 06:56:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214322331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161644257] [2025-03-04 06:56:32,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:32,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:32,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:32,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:32,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:32,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-04 06:56:32,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 284 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:32,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-04 06:56:32,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:32,430 INFO L124 PetriNetUnfolderBase]: 81/1315 cut-off events. [2025-03-04 06:56:32,430 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2025-03-04 06:56:32,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1315 events. 81/1315 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6692 event pairs, 10 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1500. Up to 67 conditions per place. [2025-03-04 06:56:32,438 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2025-03-04 06:56:32,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 293 transitions, 702 flow [2025-03-04 06:56:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2025-03-04 06:56:32,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426900584795321 [2025-03-04 06:56:32,442 INFO L175 Difference]: Start difference. First operand has 289 places, 284 transitions, 639 flow. Second operand 5 states and 1612 transitions. [2025-03-04 06:56:32,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 293 transitions, 702 flow [2025-03-04 06:56:32,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 690 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:32,448 INFO L231 Difference]: Finished difference. Result has 291 places, 289 transitions, 673 flow [2025-03-04 06:56:32,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=673, PETRI_PLACES=291, PETRI_TRANSITIONS=289} [2025-03-04 06:56:32,450 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -22 predicate places. [2025-03-04 06:56:32,450 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 289 transitions, 673 flow [2025-03-04 06:56:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:32,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:32,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:32,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:32,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:32,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1235416991, now seen corresponding path program 1 times [2025-03-04 06:56:32,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:32,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557043625] [2025-03-04 06:56:32,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:32,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:32,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:56:32,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:56:32,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:32,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:32,537 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:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557043625] [2025-03-04 06:56:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557043625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798711046] [2025-03-04 06:56:32,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:32,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:32,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:32,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:32,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-04 06:56:32,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 289 transitions, 673 flow. Second operand has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:32,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-04 06:56:32,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:32,740 INFO L124 PetriNetUnfolderBase]: 78/1312 cut-off events. [2025-03-04 06:56:32,740 INFO L125 PetriNetUnfolderBase]: For 92/93 co-relation queries the response was YES. [2025-03-04 06:56:32,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1595 conditions, 1312 events. 78/1312 cut-off events. For 92/93 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6717 event pairs, 10 based on Foata normal form. 0/1193 useless extension candidates. Maximal degree in co-relation 1548. Up to 67 conditions per place. [2025-03-04 06:56:32,748 INFO L140 encePairwiseOnDemand]: 335/342 looper letters, 14 selfloop transitions, 7 changer transitions 0/296 dead transitions. [2025-03-04 06:56:32,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 296 transitions, 732 flow [2025-03-04 06:56:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:32,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:32,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2025-03-04 06:56:32,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9426900584795321 [2025-03-04 06:56:32,751 INFO L175 Difference]: Start difference. First operand has 291 places, 289 transitions, 673 flow. Second operand 5 states and 1612 transitions. [2025-03-04 06:56:32,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 296 transitions, 732 flow [2025-03-04 06:56:32,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 732 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:32,755 INFO L231 Difference]: Finished difference. Result has 298 places, 292 transitions, 711 flow [2025-03-04 06:56:32,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=711, PETRI_PLACES=298, PETRI_TRANSITIONS=292} [2025-03-04 06:56:32,756 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -15 predicate places. [2025-03-04 06:56:32,756 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 292 transitions, 711 flow [2025-03-04 06:56:32,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 319.5) internal successors, (1278), 4 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:32,757 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:32,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:32,757 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:32,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:32,758 INFO L85 PathProgramCache]: Analyzing trace with hash -922772598, now seen corresponding path program 1 times [2025-03-04 06:56:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:32,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46553937] [2025-03-04 06:56:32,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:32,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 06:56:32,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 06:56:32,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:32,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:32,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:56:32,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:32,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46553937] [2025-03-04 06:56:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46553937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:32,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:32,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:32,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252333889] [2025-03-04 06:56:32,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:32,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:32,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:32,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:32,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:32,818 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 342 [2025-03-04 06:56:32,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 292 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:32,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 342 [2025-03-04 06:56:32,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:32,919 INFO L124 PetriNetUnfolderBase]: 56/1092 cut-off events. [2025-03-04 06:56:32,919 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 06:56:32,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 1092 events. 56/1092 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4971 event pairs, 14 based on Foata normal form. 0/1011 useless extension candidates. Maximal degree in co-relation 1326. Up to 41 conditions per place. [2025-03-04 06:56:32,925 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 9 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2025-03-04 06:56:32,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 292 transitions, 734 flow [2025-03-04 06:56:32,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:32,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-03-04 06:56:32,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9415204678362573 [2025-03-04 06:56:32,931 INFO L175 Difference]: Start difference. First operand has 298 places, 292 transitions, 711 flow. Second operand 3 states and 966 transitions. [2025-03-04 06:56:32,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 292 transitions, 734 flow [2025-03-04 06:56:32,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:32,934 INFO L231 Difference]: Finished difference. Result has 299 places, 291 transitions, 713 flow [2025-03-04 06:56:32,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=299, PETRI_TRANSITIONS=291} [2025-03-04 06:56:32,935 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -14 predicate places. [2025-03-04 06:56:32,935 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 291 transitions, 713 flow [2025-03-04 06:56:32,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:32,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:32,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:32,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:32,940 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:32,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2139844365, now seen corresponding path program 1 times [2025-03-04 06:56:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:32,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329225242] [2025-03-04 06:56:32,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:32,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 06:56:32,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 06:56:32,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:32,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:33,277 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:33,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:33,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329225242] [2025-03-04 06:56:33,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329225242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:33,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:33,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:33,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474461779] [2025-03-04 06:56:33,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:33,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:33,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:33,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:33,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:33,449 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 342 [2025-03-04 06:56:33,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 291 transitions, 713 flow. Second operand has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:33,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:33,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 342 [2025-03-04 06:56:33,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:33,577 INFO L124 PetriNetUnfolderBase]: 104/1107 cut-off events. [2025-03-04 06:56:33,577 INFO L125 PetriNetUnfolderBase]: For 165/166 co-relation queries the response was YES. [2025-03-04 06:56:33,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1589 conditions, 1107 events. 104/1107 cut-off events. For 165/166 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5305 event pairs, 12 based on Foata normal form. 0/1039 useless extension candidates. Maximal degree in co-relation 1535. Up to 80 conditions per place. [2025-03-04 06:56:33,582 INFO L140 encePairwiseOnDemand]: 324/342 looper letters, 17 selfloop transitions, 17 changer transitions 0/292 dead transitions. [2025-03-04 06:56:33,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 787 flow [2025-03-04 06:56:33,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1829 transitions. [2025-03-04 06:56:33,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8913255360623782 [2025-03-04 06:56:33,587 INFO L175 Difference]: Start difference. First operand has 299 places, 291 transitions, 713 flow. Second operand 6 states and 1829 transitions. [2025-03-04 06:56:33,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 787 flow [2025-03-04 06:56:33,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 292 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:33,590 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 737 flow [2025-03-04 06:56:33,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=737, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2025-03-04 06:56:33,591 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -14 predicate places. [2025-03-04 06:56:33,591 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 737 flow [2025-03-04 06:56:33,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.6666666666667) internal successors, (1804), 6 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:33,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:33,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:33,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:56:33,592 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:33,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:33,593 INFO L85 PathProgramCache]: Analyzing trace with hash -530169358, now seen corresponding path program 1 times [2025-03-04 06:56:33,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:33,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667263896] [2025-03-04 06:56:33,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:33,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:33,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 06:56:33,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 06:56:33,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:33,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:33,622 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:33,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667263896] [2025-03-04 06:56:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667263896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595402690] [2025-03-04 06:56:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:33,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:33,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:33,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:33,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-04 06:56:33,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:33,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:33,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-04 06:56:33,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:33,779 INFO L124 PetriNetUnfolderBase]: 96/1301 cut-off events. [2025-03-04 06:56:33,779 INFO L125 PetriNetUnfolderBase]: For 183/184 co-relation queries the response was YES. [2025-03-04 06:56:33,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1301 events. 96/1301 cut-off events. For 183/184 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6794 event pairs, 44 based on Foata normal form. 0/1224 useless extension candidates. Maximal degree in co-relation 1800. Up to 156 conditions per place. [2025-03-04 06:56:33,788 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 17 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2025-03-04 06:56:33,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 776 flow [2025-03-04 06:56:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-04 06:56:33,791 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-04 06:56:33,792 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 737 flow. Second operand 3 states and 950 transitions. [2025-03-04 06:56:33,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 776 flow [2025-03-04 06:56:33,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 288 transitions, 742 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:33,796 INFO L231 Difference]: Finished difference. Result has 295 places, 287 transitions, 705 flow [2025-03-04 06:56:33,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=705, PETRI_PLACES=295, PETRI_TRANSITIONS=287} [2025-03-04 06:56:33,797 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -18 predicate places. [2025-03-04 06:56:33,797 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 287 transitions, 705 flow [2025-03-04 06:56:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:33,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:33,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:33,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:56:33,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:33,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1101189705, now seen corresponding path program 1 times [2025-03-04 06:56:33,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:33,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089751336] [2025-03-04 06:56:33,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:33,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 06:56:33,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 06:56:33,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:33,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:33,829 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:33,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089751336] [2025-03-04 06:56:33,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089751336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:33,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:33,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:33,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794408455] [2025-03-04 06:56:33,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:33,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:33,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:33,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:33,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:33,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-04 06:56:33,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 287 transitions, 705 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:33,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:33,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-04 06:56:33,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:33,993 INFO L124 PetriNetUnfolderBase]: 92/1206 cut-off events. [2025-03-04 06:56:33,994 INFO L125 PetriNetUnfolderBase]: For 139/140 co-relation queries the response was YES. [2025-03-04 06:56:33,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1616 conditions, 1206 events. 92/1206 cut-off events. For 139/140 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6028 event pairs, 44 based on Foata normal form. 0/1134 useless extension candidates. Maximal degree in co-relation 1564. Up to 154 conditions per place. [2025-03-04 06:56:34,000 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 16 selfloop transitions, 2 changer transitions 1/287 dead transitions. [2025-03-04 06:56:34,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 287 transitions, 744 flow [2025-03-04 06:56:34,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:34,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-04 06:56:34,002 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-04 06:56:34,002 INFO L175 Difference]: Start difference. First operand has 295 places, 287 transitions, 705 flow. Second operand 3 states and 950 transitions. [2025-03-04 06:56:34,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 287 transitions, 744 flow [2025-03-04 06:56:34,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 287 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:34,005 INFO L231 Difference]: Finished difference. Result has 294 places, 286 transitions, 703 flow [2025-03-04 06:56:34,006 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=703, PETRI_PLACES=294, PETRI_TRANSITIONS=286} [2025-03-04 06:56:34,006 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -19 predicate places. [2025-03-04 06:56:34,006 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 286 transitions, 703 flow [2025-03-04 06:56:34,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:34,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:34,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:56:34,007 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-03-04 06:56:34,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:34,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1831402474, now seen corresponding path program 1 times [2025-03-04 06:56:34,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:34,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245434417] [2025-03-04 06:56:34,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:34,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:34,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 06:56:34,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 06:56:34,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:34,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:34,038 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:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245434417] [2025-03-04 06:56:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245434417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:34,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:34,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010460710] [2025-03-04 06:56:34,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:34,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:34,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:34,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:34,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:34,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 342 [2025-03-04 06:56:34,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 286 transitions, 703 flow. Second operand has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:34,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:34,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 342 [2025-03-04 06:56:34,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:34,184 INFO L124 PetriNetUnfolderBase]: 95/1259 cut-off events. [2025-03-04 06:56:34,184 INFO L125 PetriNetUnfolderBase]: For 143/144 co-relation queries the response was YES. [2025-03-04 06:56:34,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687 conditions, 1259 events. 95/1259 cut-off events. For 143/144 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 6460 event pairs, 44 based on Foata normal form. 0/1192 useless extension candidates. Maximal degree in co-relation 1635. Up to 156 conditions per place. [2025-03-04 06:56:34,204 INFO L140 encePairwiseOnDemand]: 339/342 looper letters, 0 selfloop transitions, 0 changer transitions 286/286 dead transitions. [2025-03-04 06:56:34,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 286 transitions, 742 flow [2025-03-04 06:56:34,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 950 transitions. [2025-03-04 06:56:34,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9259259259259259 [2025-03-04 06:56:34,207 INFO L175 Difference]: Start difference. First operand has 294 places, 286 transitions, 703 flow. Second operand 3 states and 950 transitions. [2025-03-04 06:56:34,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 286 transitions, 742 flow [2025-03-04 06:56:34,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 286 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:34,210 INFO L231 Difference]: Finished difference. Result has 293 places, 0 transitions, 0 flow [2025-03-04 06:56:34,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=342, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=293, PETRI_TRANSITIONS=0} [2025-03-04 06:56:34,210 INFO L279 CegarLoopForPetriNet]: 313 programPoint places, -20 predicate places. [2025-03-04 06:56:34,210 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 0 transitions, 0 flow [2025-03-04 06:56:34,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:56:34,212 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2025-03-04 06:56:34,213 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2025-03-04 06:56:34,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 72 remaining) [2025-03-04 06:56:34,215 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2025-03-04 06:56:34,216 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2025-03-04 06:56:34,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:56:34,217 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:34,221 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:34,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:34,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:34 BasicIcfg [2025-03-04 06:56:34,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:34,226 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:34,226 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:34,226 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:34,226 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:28" (3/4) ... [2025-03-04 06:56:34,228 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:34,230 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:34,230 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:34,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-04 06:56:34,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:34,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:56:34,233 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:34,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:34,294 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:34,294 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:34,295 INFO L158 Benchmark]: Toolchain (without parser) took 6701.37ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 123.7MB in the beginning and 193.4MB in the end (delta: -69.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,296 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:34,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.80ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.88ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 108.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,297 INFO L158 Benchmark]: Boogie Preprocessor took 33.53ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:34,298 INFO L158 Benchmark]: IcfgBuilder took 592.14ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 79.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,298 INFO L158 Benchmark]: TraceAbstraction took 5718.22ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 79.0MB in the beginning and 198.9MB in the end (delta: -120.0MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,298 INFO L158 Benchmark]: Witness Printer took 68.68ms. Allocated memory is still 251.7MB. Free memory was 198.9MB in the beginning and 193.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:34,299 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.80ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 110.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.88ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 108.6MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.53ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 592.14ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 79.7MB in the end (delta: 27.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5718.22ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 79.0MB in the beginning and 198.9MB in the end (delta: -120.0MB). Peak memory consumption was 106.2MB. Max. memory is 16.1GB. * Witness Printer took 68.68ms. Allocated memory is still 251.7MB. Free memory was 198.9MB in the beginning and 193.4MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 521 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1166 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 520 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1509 IncrementalHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 300 mSDtfsCounter, 1509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=15, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1602 NumberOfCodeBlocks, 1602 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1584 ConstructedInterpolants, 0 QuantifiedInterpolants, 2435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 39 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:34,322 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