./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.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/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:48,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:48,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:48,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:48,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:48,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:48,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:48,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:48,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:48,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:48,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:48,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:48,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:48,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:48,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:48,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:48,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:48,643 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-03-04 06:55:48,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:48,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:48,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:48,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:48,884 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:48,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 06:55:50,022 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2342e0a4b/9bddc70a77b04c40943aa034df26618c/FLAG8749d44a3 [2025-03-04 06:55:50,244 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:55:50,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-03-04 06:55:50,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2342e0a4b/9bddc70a77b04c40943aa034df26618c/FLAG8749d44a3 [2025-03-04 06:55:50,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2342e0a4b/9bddc70a77b04c40943aa034df26618c [2025-03-04 06:55:50,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:55:50,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:55:50,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:50,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:55:50,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:55:50,591 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50, skipping insertion in model container [2025-03-04 06:55:50,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:55:50,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:50,767 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:55:50,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:55:50,812 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:55:50,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50 WrapperNode [2025-03-04 06:55:50,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:55:50,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:50,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:55:50,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:55:50,818 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:55:50" (1/1) ... [2025-03-04 06:55:50,829 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:55:50" (1/1) ... [2025-03-04 06:55:50,851 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2025-03-04 06:55:50,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:55:50,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:55:50,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:55:50,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:55:50,858 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,873 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,883 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,885 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:55:50,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:55:50,886 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:55:50,886 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:55:50,887 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (1/1) ... [2025-03-04 06:55:50,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:50,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:50,910 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:55:50,912 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:55:50,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:55:50,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:55:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:55:50,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:55:50,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:55:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:55:50,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:55:50,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:55:50,933 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:55:51,021 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:55:51,023 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:55:51,403 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:55:51,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:55:51,415 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:55:51,415 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:55:51,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:51 BoogieIcfgContainer [2025-03-04 06:55:51,416 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:55:51,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:55:51,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:55:51,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:55:51,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:55:50" (1/3) ... [2025-03-04 06:55:51,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d9b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:51, skipping insertion in model container [2025-03-04 06:55:51,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:55:50" (2/3) ... [2025-03-04 06:55:51,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d9b4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:55:51, skipping insertion in model container [2025-03-04 06:55:51,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:51" (3/3) ... [2025-03-04 06:55:51,423 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-03-04 06:55:51,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:55:51,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 323 locations, 1 initial locations, 4 loop locations, and 36 error locations. [2025-03-04 06:55:51,434 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:55:51,530 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 06:55:51,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 338 transitions, 697 flow [2025-03-04 06:55:51,668 INFO L124 PetriNetUnfolderBase]: 16/335 cut-off events. [2025-03-04 06:55:51,670 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:55:51,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 335 events. 16/335 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 727 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 250. Up to 2 conditions per place. [2025-03-04 06:55:51,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 338 transitions, 697 flow [2025-03-04 06:55:51,689 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 315 transitions, 648 flow [2025-03-04 06:55:51,699 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:55:51,710 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;@446b1252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:55:51,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 06:55:51,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:55:51,718 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-04 06:55:51,719 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:55:51,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:51,719 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] [2025-03-04 06:55:51,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 440160046, now seen corresponding path program 1 times [2025-03-04 06:55:51,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-04 06:55:51,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:51,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:51,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 06:55:51,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 06:55:51,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:51,851 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:55:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103104972] [2025-03-04 06:55:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103104972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:51,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4296161] [2025-03-04 06:55:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:51,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:51,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:51,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:51,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-04 06:55:51,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 315 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:55:51,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:51,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-04 06:55:51,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,056 INFO L124 PetriNetUnfolderBase]: 28/613 cut-off events. [2025-03-04 06:55:52,059 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 06:55:52,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 613 events. 28/613 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2734 event pairs, 7 based on Foata normal form. 15/523 useless extension candidates. Maximal degree in co-relation 439. Up to 31 conditions per place. [2025-03-04 06:55:52,069 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 13 selfloop transitions, 2 changer transitions 3/308 dead transitions. [2025-03-04 06:55:52,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 664 flow [2025-03-04 06:55:52,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 961 transitions. [2025-03-04 06:55:52,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477317554240631 [2025-03-04 06:55:52,085 INFO L175 Difference]: Start difference. First operand has 311 places, 315 transitions, 648 flow. Second operand 3 states and 961 transitions. [2025-03-04 06:55:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 664 flow [2025-03-04 06:55:52,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 06:55:52,095 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2025-03-04 06:55:52,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2025-03-04 06:55:52,103 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -5 predicate places. [2025-03-04 06:55:52,104 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2025-03-04 06:55:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:55:52,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,105 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] [2025-03-04 06:55:52,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:55:52,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:52,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,106 INFO L85 PathProgramCache]: Analyzing trace with hash -455694319, now seen corresponding path program 1 times [2025-03-04 06:55:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 06:55:52,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 06:55:52,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 06:55:52,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,148 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:55:52,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252174528] [2025-03-04 06:55:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252174528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598663151] [2025-03-04 06:55:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,189 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 338 [2025-03-04 06:55:52,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:55:52,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 338 [2025-03-04 06:55:52,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,273 INFO L124 PetriNetUnfolderBase]: 19/455 cut-off events. [2025-03-04 06:55:52,273 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:55:52,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 455 events. 19/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1763 event pairs, 5 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 462. Up to 27 conditions per place. [2025-03-04 06:55:52,278 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-04 06:55:52,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 648 flow [2025-03-04 06:55:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2025-03-04 06:55:52,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9418145956607495 [2025-03-04 06:55:52,282 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2025-03-04 06:55:52,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 648 flow [2025-03-04 06:55:52,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,289 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 618 flow [2025-03-04 06:55:52,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2025-03-04 06:55:52,291 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2025-03-04 06:55:52,291 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 618 flow [2025-03-04 06:55:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 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:55:52,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,292 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] [2025-03-04 06:55:52,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:55:52,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:52,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -888676075, now seen corresponding path program 1 times [2025-03-04 06:55:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 06:55:52,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:55:52,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:55:52,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:52,343 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:55:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:52,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463957828] [2025-03-04 06:55:52,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463957828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:52,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110321968] [2025-03-04 06:55:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:52,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:52,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:52,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-04 06:55:52,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:55:52,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:52,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-04 06:55:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:52,493 INFO L124 PetriNetUnfolderBase]: 34/596 cut-off events. [2025-03-04 06:55:52,493 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:55:52,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 596 events. 34/596 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2832 event pairs, 12 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 616. Up to 46 conditions per place. [2025-03-04 06:55:52,498 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/300 dead transitions. [2025-03-04 06:55:52,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 640 flow [2025-03-04 06:55:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-04 06:55:52,502 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-04 06:55:52,502 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 618 flow. Second operand 3 states and 952 transitions. [2025-03-04 06:55:52,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 640 flow [2025-03-04 06:55:52,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 300 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:52,507 INFO L231 Difference]: Finished difference. Result has 298 places, 300 transitions, 608 flow [2025-03-04 06:55:52,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=300} [2025-03-04 06:55:52,507 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -13 predicate places. [2025-03-04 06:55:52,508 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 300 transitions, 608 flow [2025-03-04 06:55:52,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:55:52,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:52,508 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] [2025-03-04 06:55:52,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:55:52,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:52,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:52,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2139561386, now seen corresponding path program 1 times [2025-03-04 06:55:52,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:52,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612834889] [2025-03-04 06:55:52,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:52,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:55:52,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:55:52,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:52,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:53,032 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:55:53,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:53,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612834889] [2025-03-04 06:55:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612834889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:53,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105886697] [2025-03-04 06:55:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:53,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:53,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:53,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:53,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 338 [2025-03-04 06:55:53,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 300 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 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:55:53,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:53,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 338 [2025-03-04 06:55:53,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,319 INFO L124 PetriNetUnfolderBase]: 2073/9422 cut-off events. [2025-03-04 06:55:54,319 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2025-03-04 06:55:54,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12325 conditions, 9422 events. 2073/9422 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 101554 event pairs, 1520 based on Foata normal form. 0/7729 useless extension candidates. Maximal degree in co-relation 12287. Up to 2804 conditions per place. [2025-03-04 06:55:54,379 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2025-03-04 06:55:54,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 299 transitions, 692 flow [2025-03-04 06:55:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:54,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2025-03-04 06:55:54,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8678500986193294 [2025-03-04 06:55:54,382 INFO L175 Difference]: Start difference. First operand has 298 places, 300 transitions, 608 flow. Second operand 6 states and 1760 transitions. [2025-03-04 06:55:54,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 299 transitions, 692 flow [2025-03-04 06:55:54,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:54,386 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2025-03-04 06:55:54,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2025-03-04 06:55:54,387 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2025-03-04 06:55:54,387 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2025-03-04 06:55:54,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 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:55:54,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,388 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] [2025-03-04 06:55:54,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:55:54,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:54,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,389 INFO L85 PathProgramCache]: Analyzing trace with hash -430454037, now seen corresponding path program 1 times [2025-03-04 06:55:54,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404766204] [2025-03-04 06:55:54,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:55:54,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:55:54,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,412 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:55:54,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404766204] [2025-03-04 06:55:54,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404766204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403700891] [2025-03-04 06:55:54,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-04 06:55:54,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:55:54,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-04 06:55:54,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,515 INFO L124 PetriNetUnfolderBase]: 84/906 cut-off events. [2025-03-04 06:55:54,516 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 06:55:54,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 906 events. 84/906 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5327 event pairs, 56 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1023. Up to 112 conditions per place. [2025-03-04 06:55:54,522 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 15 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2025-03-04 06:55:54,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 647 flow [2025-03-04 06:55:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2025-03-04 06:55:54,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9378698224852071 [2025-03-04 06:55:54,525 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 951 transitions. [2025-03-04 06:55:54,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 647 flow [2025-03-04 06:55:54,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:55:54,531 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2025-03-04 06:55:54,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=297, PETRI_TRANSITIONS=298} [2025-03-04 06:55:54,532 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -14 predicate places. [2025-03-04 06:55:54,533 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2025-03-04 06:55:54,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 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:55:54,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,534 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] [2025-03-04 06:55:54,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:55:54,534 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:54,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,536 INFO L85 PathProgramCache]: Analyzing trace with hash 93779736, now seen corresponding path program 1 times [2025-03-04 06:55:54,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647439215] [2025-03-04 06:55:54,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 06:55:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 06:55:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,570 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:55:54,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647439215] [2025-03-04 06:55:54,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647439215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564993150] [2025-03-04 06:55:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-04 06:55:54,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 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:55:54,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-04 06:55:54,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,632 INFO L124 PetriNetUnfolderBase]: 17/396 cut-off events. [2025-03-04 06:55:54,632 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:55:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 396 events. 17/396 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1394 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 395. Up to 24 conditions per place. [2025-03-04 06:55:54,635 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2025-03-04 06:55:54,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2025-03-04 06:55:54,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-04 06:55:54,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-04 06:55:54,637 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 957 transitions. [2025-03-04 06:55:54,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2025-03-04 06:55:54,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,640 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2025-03-04 06:55:54,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=296, PETRI_TRANSITIONS=297} [2025-03-04 06:55:54,641 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -15 predicate places. [2025-03-04 06:55:54,641 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2025-03-04 06:55:54,641 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:55:54,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,642 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] [2025-03-04 06:55:54,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:55:54,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:54,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,642 INFO L85 PathProgramCache]: Analyzing trace with hash -970218003, now seen corresponding path program 1 times [2025-03-04 06:55:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-03-04 06:55:54,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:55:54,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:55:54,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,670 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:55:54,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435623504] [2025-03-04 06:55:54,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435623504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288398124] [2025-03-04 06:55:54,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,690 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-04 06:55:54,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 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:55:54,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-04 06:55:54,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,752 INFO L124 PetriNetUnfolderBase]: 17/397 cut-off events. [2025-03-04 06:55:54,753 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:55:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 397 events. 17/397 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1295 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-03-04 06:55:54,756 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2025-03-04 06:55:54,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2025-03-04 06:55:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-04 06:55:54,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-04 06:55:54,759 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 957 transitions. [2025-03-04 06:55:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2025-03-04 06:55:54,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,764 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2025-03-04 06:55:54,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2025-03-04 06:55:54,765 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -16 predicate places. [2025-03-04 06:55:54,766 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2025-03-04 06:55:54,767 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:55:54,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,767 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] [2025-03-04 06:55:54,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:55:54,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:54,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1726167347, now seen corresponding path program 1 times [2025-03-04 06:55:54,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56150919] [2025-03-04 06:55:54,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 06:55:54,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 06:55:54,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,813 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:55:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56150919] [2025-03-04 06:55:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56150919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561370982] [2025-03-04 06:55:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 338 [2025-03-04 06:55:54,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 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:55:54,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 338 [2025-03-04 06:55:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,865 INFO L124 PetriNetUnfolderBase]: 12/303 cut-off events. [2025-03-04 06:55:54,865 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:55:54,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 303 events. 12/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 735 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 295. Up to 21 conditions per place. [2025-03-04 06:55:54,867 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 12 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2025-03-04 06:55:54,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 629 flow [2025-03-04 06:55:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2025-03-04 06:55:54,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437869822485208 [2025-03-04 06:55:54,870 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 957 transitions. [2025-03-04 06:55:54,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 629 flow [2025-03-04 06:55:54,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,875 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 601 flow [2025-03-04 06:55:54,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2025-03-04 06:55:54,875 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-04 06:55:54,876 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 601 flow [2025-03-04 06:55:54,876 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:55:54,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,876 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] [2025-03-04 06:55:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:55:54,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash -607405341, now seen corresponding path program 1 times [2025-03-04 06:55:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814883044] [2025-03-04 06:55:54,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:54,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 06:55:54,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 06:55:54,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:54,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:54,909 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:55:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814883044] [2025-03-04 06:55:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814883044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64727775] [2025-03-04 06:55:54,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:54,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:54,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:54,924 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-04 06:55:54,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:55:54,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:54,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-04 06:55:54,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:54,986 INFO L124 PetriNetUnfolderBase]: 49/747 cut-off events. [2025-03-04 06:55:54,986 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 06:55:54,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 747 events. 49/747 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4086 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2025-03-04 06:55:54,991 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 14 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2025-03-04 06:55:54,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 291 transitions, 623 flow [2025-03-04 06:55:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2025-03-04 06:55:54,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388560157790927 [2025-03-04 06:55:54,993 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 601 flow. Second operand 3 states and 952 transitions. [2025-03-04 06:55:54,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 291 transitions, 623 flow [2025-03-04 06:55:54,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 291 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:54,997 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 591 flow [2025-03-04 06:55:54,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2025-03-04 06:55:54,998 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-04 06:55:54,998 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 591 flow [2025-03-04 06:55:54,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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:55:54,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:54,999 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] [2025-03-04 06:55:54,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:55:54,999 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 132914855, now seen corresponding path program 1 times [2025-03-04 06:55:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-03-04 06:55:55,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:55:55,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:55:55,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,052 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:55:55,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237127682] [2025-03-04 06:55:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237127682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446553499] [2025-03-04 06:55:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:55,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 591 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:55:55,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:55,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,110 INFO L124 PetriNetUnfolderBase]: 19/388 cut-off events. [2025-03-04 06:55:55,111 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:55:55,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 388 events. 19/388 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1342 event pairs, 2 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 391. Up to 14 conditions per place. [2025-03-04 06:55:55,113 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-04 06:55:55,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 621 flow [2025-03-04 06:55:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-04 06:55:55,116 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-04 06:55:55,116 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 591 flow. Second operand 3 states and 964 transitions. [2025-03-04 06:55:55,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 621 flow [2025-03-04 06:55:55,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:55,119 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 592 flow [2025-03-04 06:55:55,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2025-03-04 06:55:55,121 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -22 predicate places. [2025-03-04 06:55:55,121 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 592 flow [2025-03-04 06:55:55,122 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:55:55,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,122 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:55:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:55:55,122 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:55,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -485319862, now seen corresponding path program 1 times [2025-03-04 06:55:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-03-04 06:55:55,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:55:55,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:55:55,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,156 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:55:55,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838812899] [2025-03-04 06:55:55,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838812899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685446831] [2025-03-04 06:55:55,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-04 06:55:55,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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:55:55,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-04 06:55:55,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,506 INFO L124 PetriNetUnfolderBase]: 472/3523 cut-off events. [2025-03-04 06:55:55,506 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-03-04 06:55:55,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4173 conditions, 3523 events. 472/3523 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 32455 event pairs, 172 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 4135. Up to 577 conditions per place. [2025-03-04 06:55:55,525 INFO L140 encePairwiseOnDemand]: 329/338 looper letters, 24 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2025-03-04 06:55:55,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 655 flow [2025-03-04 06:55:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2025-03-04 06:55:55,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9349112426035503 [2025-03-04 06:55:55,527 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 592 flow. Second operand 3 states and 948 transitions. [2025-03-04 06:55:55,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 655 flow [2025-03-04 06:55:55,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 291 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:55,534 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 595 flow [2025-03-04 06:55:55,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2025-03-04 06:55:55,535 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2025-03-04 06:55:55,535 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 595 flow [2025-03-04 06:55:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 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:55:55,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:55,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:55:55,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:55,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash 560746688, now seen corresponding path program 1 times [2025-03-04 06:55:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212433031] [2025-03-04 06:55:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:55:55,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:55:55,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,569 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:55:55,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212433031] [2025-03-04 06:55:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212433031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140322089] [2025-03-04 06:55:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:55,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 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:55:55,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:55,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][266], [253#L91-12true, Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0)]) [2025-03-04 06:55:55,702 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-04 06:55:55,702 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:55:55,702 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:55:55,702 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:55:55,702 INFO L124 PetriNetUnfolderBase]: 74/827 cut-off events. [2025-03-04 06:55:55,702 INFO L125 PetriNetUnfolderBase]: For 21/42 co-relation queries the response was YES. [2025-03-04 06:55:55,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 827 events. 74/827 cut-off events. For 21/42 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4195 event pairs, 6 based on Foata normal form. 2/741 useless extension candidates. Maximal degree in co-relation 925. Up to 43 conditions per place. [2025-03-04 06:55:55,713 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2025-03-04 06:55:55,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 286 transitions, 625 flow [2025-03-04 06:55:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-04 06:55:55,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-04 06:55:55,715 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 595 flow. Second operand 3 states and 964 transitions. [2025-03-04 06:55:55,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 286 transitions, 625 flow [2025-03-04 06:55:55,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:55:55,719 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 597 flow [2025-03-04 06:55:55,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2025-03-04 06:55:55,720 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2025-03-04 06:55:55,721 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 597 flow [2025-03-04 06:55:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 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:55:55,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:55,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:55:55,722 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:55,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1760024398, now seen corresponding path program 1 times [2025-03-04 06:55:55,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-04 06:55:55,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 06:55:55,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 06:55:55,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:55,758 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:55:55,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:55,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110449555] [2025-03-04 06:55:55,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110449555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:55,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:55,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:55,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270782716] [2025-03-04 06:55:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:55,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:55,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:55,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:55,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:55,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:55,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:55:55,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:55,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:55,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:55,892 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([831] thread3EXIT-->L91-12: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [253#L91-12true, Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0), 375#true]) [2025-03-04 06:55:55,893 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2025-03-04 06:55:55,893 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:55:55,893 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2025-03-04 06:55:55,893 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2025-03-04 06:55:55,893 INFO L124 PetriNetUnfolderBase]: 65/761 cut-off events. [2025-03-04 06:55:55,893 INFO L125 PetriNetUnfolderBase]: For 8/46 co-relation queries the response was YES. [2025-03-04 06:55:55,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 761 events. 65/761 cut-off events. For 8/46 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3656 event pairs, 13 based on Foata normal form. 5/694 useless extension candidates. Maximal degree in co-relation 871. Up to 52 conditions per place. [2025-03-04 06:55:55,901 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2025-03-04 06:55:55,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 631 flow [2025-03-04 06:55:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-04 06:55:55,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-04 06:55:55,904 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 597 flow. Second operand 3 states and 964 transitions. [2025-03-04 06:55:55,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 631 flow [2025-03-04 06:55:55,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:55,909 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 593 flow [2025-03-04 06:55:55,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2025-03-04 06:55:55,910 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -28 predicate places. [2025-03-04 06:55:55,911 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 593 flow [2025-03-04 06:55:55,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:55:55,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:55,911 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] [2025-03-04 06:55:55,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:55:55,912 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:55,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:55,912 INFO L85 PathProgramCache]: Analyzing trace with hash 284476688, now seen corresponding path program 1 times [2025-03-04 06:55:55,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:55,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10728029] [2025-03-04 06:55:55,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:55,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:55,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 06:55:55,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 06:55:55,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:55,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,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:55:56,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10728029] [2025-03-04 06:55:56,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10728029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 06:55:56,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917822864] [2025-03-04 06:55:56,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 06:55:56,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 06:55:56,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 06:55:56,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:55:56,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 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:55:56,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:55:56,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,504 INFO L124 PetriNetUnfolderBase]: 95/1384 cut-off events. [2025-03-04 06:55:56,504 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2025-03-04 06:55:56,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 1384 events. 95/1384 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8703 event pairs, 18 based on Foata normal form. 4/1261 useless extension candidates. Maximal degree in co-relation 1565. Up to 71 conditions per place. [2025-03-04 06:55:56,517 INFO L140 encePairwiseOnDemand]: 325/338 looper letters, 22 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2025-03-04 06:55:56,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 298 transitions, 703 flow [2025-03-04 06:55:56,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 06:55:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 06:55:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3127 transitions. [2025-03-04 06:55:56,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251479289940828 [2025-03-04 06:55:56,523 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 593 flow. Second operand 10 states and 3127 transitions. [2025-03-04 06:55:56,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 298 transitions, 703 flow [2025-03-04 06:55:56,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:56,527 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 655 flow [2025-03-04 06:55:56,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2025-03-04 06:55:56,528 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-04 06:55:56,528 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 655 flow [2025-03-04 06:55:56,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 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:55:56,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:56,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:55:56,530 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:56,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash -593447577, now seen corresponding path program 1 times [2025-03-04 06:55:56,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210598440] [2025-03-04 06:55:56,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 06:55:56,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 06:55:56,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,566 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:55:56,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210598440] [2025-03-04 06:55:56,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210598440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:56,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432369253] [2025-03-04 06:55:56,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:56,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:56,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:56,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:56,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 655 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:55:56,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:56,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,728 INFO L124 PetriNetUnfolderBase]: 136/1346 cut-off events. [2025-03-04 06:55:56,728 INFO L125 PetriNetUnfolderBase]: For 58/95 co-relation queries the response was YES. [2025-03-04 06:55:56,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1346 events. 136/1346 cut-off events. For 58/95 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8273 event pairs, 28 based on Foata normal form. 3/1224 useless extension candidates. Maximal degree in co-relation 1600. Up to 117 conditions per place. [2025-03-04 06:55:56,738 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2025-03-04 06:55:56,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 689 flow [2025-03-04 06:55:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-04 06:55:56,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9506903353057199 [2025-03-04 06:55:56,740 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 655 flow. Second operand 3 states and 964 transitions. [2025-03-04 06:55:56,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 689 flow [2025-03-04 06:55:56,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:55:56,743 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2025-03-04 06:55:56,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-03-04 06:55:56,744 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2025-03-04 06:55:56,745 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2025-03-04 06:55:56,746 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:55:56,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:55:56,747 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1939721856, now seen corresponding path program 1 times [2025-03-04 06:55:56,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-03-04 06:55:56,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 06:55:56,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 06:55:56,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:56,780 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:55:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900194178] [2025-03-04 06:55:56,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900194178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:56,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:56,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523217052] [2025-03-04 06:55:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:56,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:56,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:56,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:56,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:56,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:56,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:55:56,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:56,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:56,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:56,896 INFO L124 PetriNetUnfolderBase]: 120/1101 cut-off events. [2025-03-04 06:55:56,896 INFO L125 PetriNetUnfolderBase]: For 59/90 co-relation queries the response was YES. [2025-03-04 06:55:56,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1101 events. 120/1101 cut-off events. For 59/90 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6240 event pairs, 11 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 1306. Up to 78 conditions per place. [2025-03-04 06:55:56,904 INFO L140 encePairwiseOnDemand]: 333/338 looper letters, 9 selfloop transitions, 2 changer transitions 8/289 dead transitions. [2025-03-04 06:55:56,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 681 flow [2025-03-04 06:55:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2025-03-04 06:55:56,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9497041420118343 [2025-03-04 06:55:56,906 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 963 transitions. [2025-03-04 06:55:56,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 681 flow [2025-03-04 06:55:56,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:56,910 INFO L231 Difference]: Finished difference. Result has 292 places, 279 transitions, 632 flow [2025-03-04 06:55:56,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, 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=632, PETRI_PLACES=292, PETRI_TRANSITIONS=279} [2025-03-04 06:55:56,911 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2025-03-04 06:55:56,911 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 279 transitions, 632 flow [2025-03-04 06:55:56,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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:55:56,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:56,911 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:55:56,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:55:56,911 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:56,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash 579234601, now seen corresponding path program 1 times [2025-03-04 06:55:56,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:56,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480292711] [2025-03-04 06:55:56,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:56,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:56,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 06:55:56,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 06:55:56,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:56,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,000 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:55:57,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480292711] [2025-03-04 06:55:57,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480292711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:57,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274432791] [2025-03-04 06:55:57,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 06:55:57,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 06:55:57,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 06:55:57,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 338 [2025-03-04 06:55:57,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 279 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 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:55:57,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:57,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 338 [2025-03-04 06:55:57,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,204 INFO L124 PetriNetUnfolderBase]: 133/1669 cut-off events. [2025-03-04 06:55:57,205 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2025-03-04 06:55:57,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1669 events. 133/1669 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11210 event pairs, 40 based on Foata normal form. 8/1545 useless extension candidates. Maximal degree in co-relation 1968. Up to 114 conditions per place. [2025-03-04 06:55:57,219 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 22 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-03-04 06:55:57,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 713 flow [2025-03-04 06:55:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:55:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:55:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2025-03-04 06:55:57,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9366863905325444 [2025-03-04 06:55:57,222 INFO L175 Difference]: Start difference. First operand has 292 places, 279 transitions, 632 flow. Second operand 5 states and 1583 transitions. [2025-03-04 06:55:57,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 713 flow [2025-03-04 06:55:57,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,226 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 653 flow [2025-03-04 06:55:57,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2025-03-04 06:55:57,227 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2025-03-04 06:55:57,227 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 653 flow [2025-03-04 06:55:57,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 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:55:57,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,228 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] [2025-03-04 06:55:57,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:55:57,228 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:57,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -103833081, now seen corresponding path program 1 times [2025-03-04 06:55:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260868454] [2025-03-04 06:55:57,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:57,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 06:55:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 06:55:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,261 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:55:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260868454] [2025-03-04 06:55:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260868454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:55:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029659226] [2025-03-04 06:55:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:55:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:55:57,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:55:57,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 338 [2025-03-04 06:55:57,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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:55:57,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:57,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 338 [2025-03-04 06:55:57,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:57,461 INFO L124 PetriNetUnfolderBase]: 233/1746 cut-off events. [2025-03-04 06:55:57,461 INFO L125 PetriNetUnfolderBase]: For 147/218 co-relation queries the response was YES. [2025-03-04 06:55:57,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1746 events. 233/1746 cut-off events. For 147/218 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12325 event pairs, 56 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 2196. Up to 235 conditions per place. [2025-03-04 06:55:57,471 INFO L140 encePairwiseOnDemand]: 335/338 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2025-03-04 06:55:57,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 683 flow [2025-03-04 06:55:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:55:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:55:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2025-03-04 06:55:57,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-03-04 06:55:57,473 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 653 flow. Second operand 3 states and 962 transitions. [2025-03-04 06:55:57,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 683 flow [2025-03-04 06:55:57,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 282 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:57,476 INFO L231 Difference]: Finished difference. Result has 287 places, 280 transitions, 650 flow [2025-03-04 06:55:57,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=287, PETRI_TRANSITIONS=280} [2025-03-04 06:55:57,477 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2025-03-04 06:55:57,477 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 280 transitions, 650 flow [2025-03-04 06:55:57,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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:55:57,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:57,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:55:57,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:55:57,478 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:57,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:57,478 INFO L85 PathProgramCache]: Analyzing trace with hash -838608705, now seen corresponding path program 1 times [2025-03-04 06:55:57,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:57,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465637524] [2025-03-04 06:55:57,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:57,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:57,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 06:55:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 06:55:57,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:57,743 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:55:57,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465637524] [2025-03-04 06:55:57,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465637524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:57,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:57,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:57,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888205672] [2025-03-04 06:55:57,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:57,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:57,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:57,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:57,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:58,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:55:58,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 280 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 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:55:58,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:55:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:58,202 INFO L124 PetriNetUnfolderBase]: 151/1753 cut-off events. [2025-03-04 06:55:58,202 INFO L125 PetriNetUnfolderBase]: For 141/150 co-relation queries the response was YES. [2025-03-04 06:55:58,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1753 events. 151/1753 cut-off events. For 141/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11841 event pairs, 37 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 2170. Up to 142 conditions per place. [2025-03-04 06:55:58,219 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-04 06:55:58,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 288 transitions, 734 flow [2025-03-04 06:55:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:55:58,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:55:58,226 INFO L175 Difference]: Start difference. First operand has 287 places, 280 transitions, 650 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:55:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 288 transitions, 734 flow [2025-03-04 06:55:58,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:55:58,234 INFO L231 Difference]: Finished difference. Result has 290 places, 280 transitions, 660 flow [2025-03-04 06:55:58,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=280} [2025-03-04 06:55:58,234 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-04 06:55:58,234 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 280 transitions, 660 flow [2025-03-04 06:55:58,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 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:55:58,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:58,239 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] [2025-03-04 06:55:58,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:55:58,239 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:58,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:58,240 INFO L85 PathProgramCache]: Analyzing trace with hash -12129015, now seen corresponding path program 1 times [2025-03-04 06:55:58,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:58,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-04 06:55:58,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:58,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:58,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:55:58,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:55:58,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:58,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:58,561 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:55:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-04 06:55:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314506553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:55:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:55:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:55:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160225033] [2025-03-04 06:55:58,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:55:58,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:55:58,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:58,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:55:58,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:55:58,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:55:58,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 280 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 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:55:58,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:55:58,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:55:58,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:55:59,018 INFO L124 PetriNetUnfolderBase]: 232/1738 cut-off events. [2025-03-04 06:55:59,018 INFO L125 PetriNetUnfolderBase]: For 147/268 co-relation queries the response was YES. [2025-03-04 06:55:59,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1738 events. 232/1738 cut-off events. For 147/268 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12161 event pairs, 52 based on Foata normal form. 4/1628 useless extension candidates. Maximal degree in co-relation 2227. Up to 219 conditions per place. [2025-03-04 06:55:59,032 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-04 06:55:59,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 740 flow [2025-03-04 06:55:59,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:55:59,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:55:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:55:59,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:55:59,036 INFO L175 Difference]: Start difference. First operand has 290 places, 280 transitions, 660 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:55:59,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 740 flow [2025-03-04 06:55:59,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 288 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:55:59,039 INFO L231 Difference]: Finished difference. Result has 291 places, 280 transitions, 666 flow [2025-03-04 06:55:59,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=291, PETRI_TRANSITIONS=280} [2025-03-04 06:55:59,040 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -20 predicate places. [2025-03-04 06:55:59,040 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 280 transitions, 666 flow [2025-03-04 06:55:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 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:55:59,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:55:59,041 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] [2025-03-04 06:55:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 06:55:59,041 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:55:59,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:55:59,041 INFO L85 PathProgramCache]: Analyzing trace with hash -362580254, now seen corresponding path program 1 times [2025-03-04 06:55:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:55:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-04 06:55:59,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:55:59,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:55:59,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:55:59,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:59,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:55:59,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:55:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833253570] [2025-03-04 06:55:59,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833253570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:55:59,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331901183] [2025-03-04 06:55:59,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:55:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:55:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:55:59,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:55:59,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:55:59,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 06:55:59,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 06:55:59,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:55:59,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:55:59,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:55:59,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:55:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:55:59,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:55:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:55:59,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331901183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:55:59,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:55:59,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 06:55:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509665093] [2025-03-04 06:55:59,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:55:59,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:55:59,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:55:59,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:55:59,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:56:00,119 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 338 [2025-03-04 06:56:00,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 280 transitions, 666 flow. Second operand has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 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:00,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:00,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 338 [2025-03-04 06:56:00,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:00,751 INFO L124 PetriNetUnfolderBase]: 208/3310 cut-off events. [2025-03-04 06:56:00,751 INFO L125 PetriNetUnfolderBase]: For 94/118 co-relation queries the response was YES. [2025-03-04 06:56:00,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 3310 events. 208/3310 cut-off events. For 94/118 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 28115 event pairs, 35 based on Foata normal form. 9/3136 useless extension candidates. Maximal degree in co-relation 4077. Up to 108 conditions per place. [2025-03-04 06:56:00,781 INFO L140 encePairwiseOnDemand]: 321/338 looper letters, 26 selfloop transitions, 27 changer transitions 0/302 dead transitions. [2025-03-04 06:56:00,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 838 flow [2025-03-04 06:56:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 06:56:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 06:56:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4930 transitions. [2025-03-04 06:56:00,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911612426035503 [2025-03-04 06:56:00,789 INFO L175 Difference]: Start difference. First operand has 291 places, 280 transitions, 666 flow. Second operand 16 states and 4930 transitions. [2025-03-04 06:56:00,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 838 flow [2025-03-04 06:56:00,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 830 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:56:00,795 INFO L231 Difference]: Finished difference. Result has 310 places, 291 transitions, 797 flow [2025-03-04 06:56:00,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=310, PETRI_TRANSITIONS=291} [2025-03-04 06:56:00,796 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -1 predicate places. [2025-03-04 06:56:00,796 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 291 transitions, 797 flow [2025-03-04 06:56:00,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 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:00,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:00,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:56:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 06:56:01,003 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:56:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -986271259, now seen corresponding path program 1 times [2025-03-04 06:56:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001726638] [2025-03-04 06:56:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:01,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 06:56:01,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 06:56:01,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:01,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:01,261 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:01,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:01,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001726638] [2025-03-04 06:56:01,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001726638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:01,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:01,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731044689] [2025-03-04 06:56:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:01,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:01,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:01,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:56:01,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 291 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 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:01,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:01,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:56:01,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:01,793 INFO L124 PetriNetUnfolderBase]: 198/2471 cut-off events. [2025-03-04 06:56:01,793 INFO L125 PetriNetUnfolderBase]: For 285/294 co-relation queries the response was YES. [2025-03-04 06:56:01,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 2471 events. 198/2471 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18827 event pairs, 51 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 3195. Up to 196 conditions per place. [2025-03-04 06:56:01,813 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 25 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2025-03-04 06:56:01,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 298 transitions, 879 flow [2025-03-04 06:56:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:01,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:56:01,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:56:01,816 INFO L175 Difference]: Start difference. First operand has 310 places, 291 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:56:01,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 298 transitions, 879 flow [2025-03-04 06:56:01,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 862 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:01,822 INFO L231 Difference]: Finished difference. Result has 312 places, 290 transitions, 788 flow [2025-03-04 06:56:01,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=312, PETRI_TRANSITIONS=290} [2025-03-04 06:56:01,822 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 1 predicate places. [2025-03-04 06:56:01,823 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 290 transitions, 788 flow [2025-03-04 06:56:01,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 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:01,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:01,824 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] [2025-03-04 06:56:01,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 06:56:01,824 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:56:01,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash 178980527, now seen corresponding path program 1 times [2025-03-04 06:56:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628975189] [2025-03-04 06:56:01,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:01,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 06:56:01,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 06:56:01,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:01,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:56:02,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628975189] [2025-03-04 06:56:02,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628975189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384890835] [2025-03-04 06:56:02,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:02,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:02,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:02,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:56:02,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 290 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 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:02,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:56:02,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,526 INFO L124 PetriNetUnfolderBase]: 310/2227 cut-off events. [2025-03-04 06:56:02,526 INFO L125 PetriNetUnfolderBase]: For 335/504 co-relation queries the response was YES. [2025-03-04 06:56:02,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 2227 events. 310/2227 cut-off events. For 335/504 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 16443 event pairs, 75 based on Foata normal form. 20/2123 useless extension candidates. Maximal degree in co-relation 3081. Up to 307 conditions per place. [2025-03-04 06:56:02,543 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 13/297 dead transitions. [2025-03-04 06:56:02,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 297 transitions, 866 flow [2025-03-04 06:56:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:56:02,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:56:02,545 INFO L175 Difference]: Start difference. First operand has 312 places, 290 transitions, 788 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:56:02,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 297 transitions, 866 flow [2025-03-04 06:56:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 854 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 06:56:02,549 INFO L231 Difference]: Finished difference. Result has 311 places, 276 transitions, 694 flow [2025-03-04 06:56:02,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=311, PETRI_TRANSITIONS=276} [2025-03-04 06:56:02,550 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, 0 predicate places. [2025-03-04 06:56:02,550 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 276 transitions, 694 flow [2025-03-04 06:56:02,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 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:02,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,550 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 06:56:02,550 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:56:02,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,551 INFO L85 PathProgramCache]: Analyzing trace with hash 725919440, now seen corresponding path program 2 times [2025-03-04 06:56:02,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608036508] [2025-03-04 06:56:02,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:56:02,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-04 06:56:02,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 144 statements. [2025-03-04 06:56:02,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:56:02,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 06:56:02,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608036508] [2025-03-04 06:56:02,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608036508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:02,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761418105] [2025-03-04 06:56:02,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:02,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:02,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:02,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:56:02,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 276 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 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:02,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:56:02,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,154 INFO L124 PetriNetUnfolderBase]: 96/1255 cut-off events. [2025-03-04 06:56:03,154 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2025-03-04 06:56:03,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1255 events. 96/1255 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7436 event pairs, 21 based on Foata normal form. 8/1214 useless extension candidates. Maximal degree in co-relation 1656. Up to 88 conditions per place. [2025-03-04 06:56:03,165 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 23 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2025-03-04 06:56:03,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 774 flow [2025-03-04 06:56:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:56:03,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:56:03,167 INFO L175 Difference]: Start difference. First operand has 311 places, 276 transitions, 694 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:56:03,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 774 flow [2025-03-04 06:56:03,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 284 transitions, 722 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-03-04 06:56:03,171 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 656 flow [2025-03-04 06:56:03,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2025-03-04 06:56:03,172 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-04 06:56:03,172 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 656 flow [2025-03-04 06:56:03,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 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:03,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:03,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:56:03,173 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-04 06:56:03,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash -717740554, now seen corresponding path program 1 times [2025-03-04 06:56:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-04 06:56:03,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:03,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-04 06:56:03,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-04 06:56:03,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:03,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 06:56:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-04 06:56:03,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709554628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:56:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875312389] [2025-03-04 06:56:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:56:03,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:56:03,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:56:03,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 338 [2025-03-04 06:56:03,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 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:03,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 338 [2025-03-04 06:56:03,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,838 INFO L124 PetriNetUnfolderBase]: 96/1249 cut-off events. [2025-03-04 06:56:03,838 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2025-03-04 06:56:03,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 1249 events. 96/1249 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7331 event pairs, 21 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 1603. Up to 88 conditions per place. [2025-03-04 06:56:03,848 INFO L140 encePairwiseOnDemand]: 332/338 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2025-03-04 06:56:03,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 734 flow [2025-03-04 06:56:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:56:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:56:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2025-03-04 06:56:03,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9285009861932939 [2025-03-04 06:56:03,850 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 656 flow. Second operand 6 states and 1883 transitions. [2025-03-04 06:56:03,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 283 transitions, 734 flow [2025-03-04 06:56:03,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 283 transitions, 726 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 06:56:03,853 INFO L231 Difference]: Finished difference. Result has 290 places, 0 transitions, 0 flow [2025-03-04 06:56:03,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=338, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=290, PETRI_TRANSITIONS=0} [2025-03-04 06:56:03,853 INFO L279 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2025-03-04 06:56:03,853 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 0 transitions, 0 flow [2025-03-04 06:56:03,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 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:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-03-04 06:56:03,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-03-04 06:56:03,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-03-04 06:56:03,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-03-04 06:56:03,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-03-04 06:56:03,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-03-04 06:56:03,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-03-04 06:56:03,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 06:56:03,861 INFO L422 BasicCegarLoop]: Path program histogram: [2, 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:03,866 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:03,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:03,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:03 BasicIcfg [2025-03-04 06:56:03,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:03,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:03,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:03,873 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:03,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:55:51" (3/4) ... [2025-03-04 06:56:03,875 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:03,877 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:03,877 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:03,877 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:56:03,881 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-04 06:56:03,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:03,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 06:56:03,882 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:03,951 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:03,952 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:03,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:03,952 INFO L158 Benchmark]: Toolchain (without parser) took 13366.32ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 112.3MB in the beginning and 354.1MB in the end (delta: -241.8MB). Peak memory consumption was 583.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:03,953 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:03,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.03ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 99.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:03,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.54ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:03,953 INFO L158 Benchmark]: Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:03,954 INFO L158 Benchmark]: IcfgBuilder took 530.05ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 67.6MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 06:56:03,954 INFO L158 Benchmark]: TraceAbstraction took 12455.28ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 67.1MB in the beginning and 362.5MB in the end (delta: -295.4MB). Peak memory consumption was 541.5MB. Max. memory is 16.1GB. [2025-03-04 06:56:03,954 INFO L158 Benchmark]: Witness Printer took 78.79ms. Allocated memory is still 973.1MB. Free memory was 362.5MB in the beginning and 354.1MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:03,956 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.03ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 99.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.54ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 97.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.40ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 530.05ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 67.6MB in the end (delta: 28.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12455.28ms. Allocated memory was 142.6MB in the beginning and 973.1MB in the end (delta: 830.5MB). Free memory was 67.1MB in the beginning and 362.5MB in the end (delta: -295.4MB). Peak memory consumption was 541.5MB. Max. memory is 16.1GB. * Witness Printer took 78.79ms. Allocated memory is still 973.1MB. Free memory was 362.5MB in the beginning and 354.1MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: 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: 81]: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 473 locations, 61 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: 12.3s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2585 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1575 mSDsluCounter, 1421 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4285 IncrementalHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 210 mSDtfsCounter, 4285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=21, InterpolantAutomatonStates: 118, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2601 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 7 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 48/51 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:03,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE