./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/chl-name-comparator-subst.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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:55,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:55,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:55,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:55,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:55,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:55,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:55,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:55,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:55,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:55,634 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:55,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:55,635 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:55,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:55,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:55,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:55,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:55,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:55,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:55,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:55,637 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-03-08 22:04:55,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:55,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:55,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:55,874 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:55,874 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:55,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-08 22:04:56,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8792088/09d4f4a06b9c4bef8782b4b5cbc5ccd8/FLAG7dcb9db61 [2025-03-08 22:04:57,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:57,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-03-08 22:04:57,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8792088/09d4f4a06b9c4bef8782b4b5cbc5ccd8/FLAG7dcb9db61 [2025-03-08 22:04:57,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8792088/09d4f4a06b9c4bef8782b4b5cbc5ccd8 [2025-03-08 22:04:57,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:57,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:57,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:57,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:57,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:57,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@593a7904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57, skipping insertion in model container [2025-03-08 22:04:57,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:57,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:57,729 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:57,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:57,793 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:57,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57 WrapperNode [2025-03-08 22:04:57,793 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:57,794 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:57,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:57,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:57,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,806 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,837 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 842 [2025-03-08 22:04:57,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:57,838 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:57,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:57,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:57,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,867 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:57,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:57,875 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:57,875 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:57,876 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (1/1) ... [2025-03-08 22:04:57,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:57,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:57,898 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-08 22:04:57,902 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-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:57,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:57,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:04:57,916 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:04:57,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:57,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:57,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:04:57,918 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:58,009 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:58,010 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:58,819 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:58,819 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:58,842 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:58,842 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:58,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:58 BoogieIcfgContainer [2025-03-08 22:04:58,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:58,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:58,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:58,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:58,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:57" (1/3) ... [2025-03-08 22:04:58,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ab893a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:58, skipping insertion in model container [2025-03-08 22:04:58,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:57" (2/3) ... [2025-03-08 22:04:58,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ab893a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:58, skipping insertion in model container [2025-03-08 22:04:58,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:58" (3/3) ... [2025-03-08 22:04:58,849 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-03-08 22:04:58,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:58,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 1055 locations, 1 initial locations, 4 loop locations, and 151 error locations. [2025-03-08 22:04:58,861 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:59,020 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:04:59,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-08 22:04:59,484 INFO L124 PetriNetUnfolderBase]: 57/1108 cut-off events. [2025-03-08 22:04:59,486 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:59,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1108 events. 57/1108 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3915 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-03-08 22:04:59,517 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1111 transitions, 2243 flow [2025-03-08 22:04:59,546 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1041 places, 1085 transitions, 2188 flow [2025-03-08 22:04:59,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:59,563 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;@42ab0e07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:59,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2025-03-08 22:04:59,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:59,569 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2025-03-08 22:04:59,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:59,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:59,571 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] [2025-03-08 22:04:59,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:04:59,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1461848929, now seen corresponding path program 1 times [2025-03-08 22:04:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194067881] [2025-03-08 22:04:59,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:59,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:59,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 22:04:59,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 22:04:59,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:59,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:59,709 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-08 22:04:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:59,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194067881] [2025-03-08 22:04:59,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194067881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:59,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:59,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998897849] [2025-03-08 22:04:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:59,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:59,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:59,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:59,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:04:59,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:04:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:04:59,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:02,515 INFO L124 PetriNetUnfolderBase]: 612/12182 cut-off events. [2025-03-08 22:05:02,516 INFO L125 PetriNetUnfolderBase]: For 63/81 co-relation queries the response was YES. [2025-03-08 22:05:02,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 12182 events. 612/12182 cut-off events. For 63/81 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 123012 event pairs, 95 based on Foata normal form. 281/9858 useless extension candidates. Maximal degree in co-relation 12186. Up to 185 conditions per place. [2025-03-08 22:05:02,738 INFO L140 encePairwiseOnDemand]: 1091/1111 looper letters, 19 selfloop transitions, 2 changer transitions 2/1067 dead transitions. [2025-03-08 22:05:02,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1067 transitions, 2194 flow [2025-03-08 22:05:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:02,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3246 transitions. [2025-03-08 22:05:02,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738973897389739 [2025-03-08 22:05:02,763 INFO L175 Difference]: Start difference. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand 3 states and 3246 transitions. [2025-03-08 22:05:02,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1067 transitions, 2194 flow [2025-03-08 22:05:02,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1067 transitions, 2182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:05:02,790 INFO L231 Difference]: Finished difference. Result has 1036 places, 1065 transitions, 2140 flow [2025-03-08 22:05:02,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1036, PETRI_TRANSITIONS=1065} [2025-03-08 22:05:02,796 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -5 predicate places. [2025-03-08 22:05:02,797 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 1065 transitions, 2140 flow [2025-03-08 22:05:02,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:02,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:02,799 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] [2025-03-08 22:05:02,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:05:02,799 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:02,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1085946039, now seen corresponding path program 1 times [2025-03-08 22:05:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:02,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649838923] [2025-03-08 22:05:02,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:02,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:02,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 22:05:02,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 22:05:02,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:02,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:02,861 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-08 22:05:02,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:02,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649838923] [2025-03-08 22:05:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649838923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:02,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623257171] [2025-03-08 22:05:02,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:02,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:02,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:02,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:02,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:02,927 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:02,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:02,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:02,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:02,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:03,968 INFO L124 PetriNetUnfolderBase]: 226/4392 cut-off events. [2025-03-08 22:05:03,968 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-03-08 22:05:04,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 4392 events. 226/4392 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 32959 event pairs, 45 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4480. Up to 110 conditions per place. [2025-03-08 22:05:04,056 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1064 dead transitions. [2025-03-08 22:05:04,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 1064 transitions, 2180 flow [2025-03-08 22:05:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-08 22:05:04,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-08 22:05:04,062 INFO L175 Difference]: Start difference. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand 3 states and 3229 transitions. [2025-03-08 22:05:04,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 1064 transitions, 2180 flow [2025-03-08 22:05:04,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1064 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:04,073 INFO L231 Difference]: Finished difference. Result has 1033 places, 1064 transitions, 2138 flow [2025-03-08 22:05:04,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1033, PETRI_TRANSITIONS=1064} [2025-03-08 22:05:04,075 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -8 predicate places. [2025-03-08 22:05:04,075 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1064 transitions, 2138 flow [2025-03-08 22:05:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:04,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:04,077 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] [2025-03-08 22:05:04,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:05:04,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:04,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash -280812172, now seen corresponding path program 1 times [2025-03-08 22:05:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:04,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016973912] [2025-03-08 22:05:04,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-08 22:05:04,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 22:05:04,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:04,145 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-08 22:05:04,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:04,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016973912] [2025-03-08 22:05:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016973912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:04,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062086215] [2025-03-08 22:05:04,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:04,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:04,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:04,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:04,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:04,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:04,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:04,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:04,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:05,020 INFO L124 PetriNetUnfolderBase]: 240/3577 cut-off events. [2025-03-08 22:05:05,020 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-03-08 22:05:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 3577 events. 240/3577 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27386 event pairs, 95 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 3727. Up to 185 conditions per place. [2025-03-08 22:05:05,115 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1063 dead transitions. [2025-03-08 22:05:05,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1063 transitions, 2178 flow [2025-03-08 22:05:05,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-08 22:05:05,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-08 22:05:05,121 INFO L175 Difference]: Start difference. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand 3 states and 3229 transitions. [2025-03-08 22:05:05,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1063 transitions, 2178 flow [2025-03-08 22:05:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:05,134 INFO L231 Difference]: Finished difference. Result has 1032 places, 1063 transitions, 2136 flow [2025-03-08 22:05:05,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1032, PETRI_TRANSITIONS=1063} [2025-03-08 22:05:05,137 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -9 predicate places. [2025-03-08 22:05:05,137 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1063 transitions, 2136 flow [2025-03-08 22:05:05,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:05,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:05,139 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] [2025-03-08 22:05:05,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:05:05,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:05,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:05,141 INFO L85 PathProgramCache]: Analyzing trace with hash 283019064, now seen corresponding path program 1 times [2025-03-08 22:05:05,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:05,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021483092] [2025-03-08 22:05:05,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:05,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:05,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 22:05:05,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 22:05:05,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:05,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:05,198 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-08 22:05:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:05,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021483092] [2025-03-08 22:05:05,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021483092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:05,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94056619] [2025-03-08 22:05:05,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:05,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:05,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:05,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1111 [2025-03-08 22:05:05,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:05,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:05,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1111 [2025-03-08 22:05:05,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:06,783 INFO L124 PetriNetUnfolderBase]: 245/5502 cut-off events. [2025-03-08 22:05:06,784 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:05:06,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 5502 events. 245/5502 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 43779 event pairs, 16 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 5521. Up to 51 conditions per place. [2025-03-08 22:05:06,956 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 18 selfloop transitions, 2 changer transitions 0/1062 dead transitions. [2025-03-08 22:05:06,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1062 transitions, 2174 flow [2025-03-08 22:05:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-08 22:05:06,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-08 22:05:06,963 INFO L175 Difference]: Start difference. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand 3 states and 3231 transitions. [2025-03-08 22:05:06,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1062 transitions, 2174 flow [2025-03-08 22:05:06,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1062 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:06,977 INFO L231 Difference]: Finished difference. Result has 1031 places, 1062 transitions, 2134 flow [2025-03-08 22:05:06,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1031, PETRI_TRANSITIONS=1062} [2025-03-08 22:05:06,980 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -10 predicate places. [2025-03-08 22:05:06,980 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1062 transitions, 2134 flow [2025-03-08 22:05:06,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:06,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:06,982 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-08 22:05:06,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:05:06,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:06,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1183440073, now seen corresponding path program 1 times [2025-03-08 22:05:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:06,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87056908] [2025-03-08 22:05:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:06,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 22:05:07,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 22:05:07,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,049 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-08 22:05:07,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87056908] [2025-03-08 22:05:07,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87056908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981362510] [2025-03-08 22:05:07,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-08 22:05:07,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:07,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-08 22:05:07,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:07,538 INFO L124 PetriNetUnfolderBase]: 73/1611 cut-off events. [2025-03-08 22:05:07,538 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:05:07,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1611 events. 73/1611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8250 event pairs, 12 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1607. Up to 40 conditions per place. [2025-03-08 22:05:07,590 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2025-03-08 22:05:07,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1061 transitions, 2166 flow [2025-03-08 22:05:07,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-08 22:05:07,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-08 22:05:07,596 INFO L175 Difference]: Start difference. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand 3 states and 3237 transitions. [2025-03-08 22:05:07,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1061 transitions, 2166 flow [2025-03-08 22:05:07,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 1061 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:07,612 INFO L231 Difference]: Finished difference. Result has 1030 places, 1061 transitions, 2132 flow [2025-03-08 22:05:07,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1030, PETRI_TRANSITIONS=1061} [2025-03-08 22:05:07,614 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -11 predicate places. [2025-03-08 22:05:07,614 INFO L471 AbstractCegarLoop]: Abstraction has has 1030 places, 1061 transitions, 2132 flow [2025-03-08 22:05:07,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:07,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:07,616 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] [2025-03-08 22:05:07,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:05:07,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:07,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:07,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1347377122, now seen corresponding path program 1 times [2025-03-08 22:05:07,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:07,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802547258] [2025-03-08 22:05:07,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:07,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:07,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 22:05:07,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 22:05:07,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:07,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:07,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-08 22:05:07,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:07,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802547258] [2025-03-08 22:05:07,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802547258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:07,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:07,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333267762] [2025-03-08 22:05:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:07,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:07,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:07,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:07,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:07,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-08 22:05:07,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:07,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:07,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-08 22:05:07,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:08,443 INFO L124 PetriNetUnfolderBase]: 167/3835 cut-off events. [2025-03-08 22:05:08,443 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-03-08 22:05:08,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3835 events. 167/3835 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26097 event pairs, 10 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 3816. Up to 35 conditions per place. [2025-03-08 22:05:08,545 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-03-08 22:05:08,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1060 transitions, 2162 flow [2025-03-08 22:05:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:08,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-08 22:05:08,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-08 22:05:08,549 INFO L175 Difference]: Start difference. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand 3 states and 3239 transitions. [2025-03-08 22:05:08,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1060 transitions, 2162 flow [2025-03-08 22:05:08,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1060 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:08,559 INFO L231 Difference]: Finished difference. Result has 1029 places, 1060 transitions, 2130 flow [2025-03-08 22:05:08,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1029, PETRI_TRANSITIONS=1060} [2025-03-08 22:05:08,560 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -12 predicate places. [2025-03-08 22:05:08,561 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1060 transitions, 2130 flow [2025-03-08 22:05:08,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:08,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:08,562 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-08 22:05:08,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:05:08,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:08,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -340197636, now seen corresponding path program 1 times [2025-03-08 22:05:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393202238] [2025-03-08 22:05:08,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:08,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:08,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-08 22:05:08,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-08 22:05:08,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:08,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:08,598 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-08 22:05:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:08,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393202238] [2025-03-08 22:05:08,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393202238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:08,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:08,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032616648] [2025-03-08 22:05:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:08,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:08,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:08,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:08,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:08,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-08 22:05:08,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:08,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:08,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-08 22:05:08,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:10,291 INFO L124 PetriNetUnfolderBase]: 349/7719 cut-off events. [2025-03-08 22:05:10,292 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-03-08 22:05:10,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 7719 events. 349/7719 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 68364 event pairs, 24 based on Foata normal form. 0/6095 useless extension candidates. Maximal degree in co-relation 7741. Up to 70 conditions per place. [2025-03-08 22:05:10,432 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-03-08 22:05:10,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1059 transitions, 2174 flow [2025-03-08 22:05:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-08 22:05:10,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-08 22:05:10,436 INFO L175 Difference]: Start difference. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand 3 states and 3225 transitions. [2025-03-08 22:05:10,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1059 transitions, 2174 flow [2025-03-08 22:05:10,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1059 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:10,446 INFO L231 Difference]: Finished difference. Result has 1028 places, 1059 transitions, 2128 flow [2025-03-08 22:05:10,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1028, PETRI_TRANSITIONS=1059} [2025-03-08 22:05:10,447 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -13 predicate places. [2025-03-08 22:05:10,447 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1059 transitions, 2128 flow [2025-03-08 22:05:10,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:10,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:10,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:10,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:05:10,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:10,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1927814138, now seen corresponding path program 1 times [2025-03-08 22:05:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:10,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607771060] [2025-03-08 22:05:10,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:10,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 22:05:10,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 22:05:10,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:10,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:10,480 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-08 22:05:10,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:10,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607771060] [2025-03-08 22:05:10,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607771060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:10,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:10,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:10,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276626280] [2025-03-08 22:05:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:10,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:10,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:10,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:10,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:10,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:10,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:10,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:10,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:10,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,208 INFO L124 PetriNetUnfolderBase]: 149/3282 cut-off events. [2025-03-08 22:05:11,208 INFO L125 PetriNetUnfolderBase]: For 9/33 co-relation queries the response was YES. [2025-03-08 22:05:11,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 3282 events. 149/3282 cut-off events. For 9/33 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 21580 event pairs, 16 based on Foata normal form. 0/2610 useless extension candidates. Maximal degree in co-relation 3262. Up to 52 conditions per place. [2025-03-08 22:05:11,341 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-03-08 22:05:11,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1058 transitions, 2168 flow [2025-03-08 22:05:11,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-08 22:05:11,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-08 22:05:11,345 INFO L175 Difference]: Start difference. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand 3 states and 3229 transitions. [2025-03-08 22:05:11,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1058 transitions, 2168 flow [2025-03-08 22:05:11,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1058 transitions, 2164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,356 INFO L231 Difference]: Finished difference. Result has 1027 places, 1058 transitions, 2126 flow [2025-03-08 22:05:11,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1027, PETRI_TRANSITIONS=1058} [2025-03-08 22:05:11,357 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -14 predicate places. [2025-03-08 22:05:11,358 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1058 transitions, 2126 flow [2025-03-08 22:05:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:11,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:11,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:05:11,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:11,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash 663153792, now seen corresponding path program 1 times [2025-03-08 22:05:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301417563] [2025-03-08 22:05:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 22:05:11,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 22:05:11,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,396 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-08 22:05:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301417563] [2025-03-08 22:05:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301417563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:11,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609672191] [2025-03-08 22:05:11,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:11,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:11,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:11,424 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-08 22:05:11,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:11,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-08 22:05:11,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:11,747 INFO L124 PetriNetUnfolderBase]: 73/1607 cut-off events. [2025-03-08 22:05:11,747 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-03-08 22:05:11,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1607 events. 73/1607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7799 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1565. Up to 40 conditions per place. [2025-03-08 22:05:11,798 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-03-08 22:05:11,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1057 transitions, 2158 flow [2025-03-08 22:05:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-08 22:05:11,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-08 22:05:11,802 INFO L175 Difference]: Start difference. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand 3 states and 3237 transitions. [2025-03-08 22:05:11,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1057 transitions, 2158 flow [2025-03-08 22:05:11,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:11,812 INFO L231 Difference]: Finished difference. Result has 1026 places, 1057 transitions, 2124 flow [2025-03-08 22:05:11,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1026, PETRI_TRANSITIONS=1057} [2025-03-08 22:05:11,813 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -15 predicate places. [2025-03-08 22:05:11,813 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1057 transitions, 2124 flow [2025-03-08 22:05:11,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:11,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:11,815 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] [2025-03-08 22:05:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:05:11,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:11,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:11,816 INFO L85 PathProgramCache]: Analyzing trace with hash 350800420, now seen corresponding path program 1 times [2025-03-08 22:05:11,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:11,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376682431] [2025-03-08 22:05:11,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:11,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:11,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 22:05:11,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 22:05:11,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:11,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:11,844 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-08 22:05:11,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:11,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376682431] [2025-03-08 22:05:11,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376682431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:11,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:11,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639960346] [2025-03-08 22:05:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:11,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:11,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:11,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:11,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:11,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-08 22:05:11,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:11,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:11,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-08 22:05:11,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:12,374 INFO L124 PetriNetUnfolderBase]: 107/2446 cut-off events. [2025-03-08 22:05:12,375 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-08 22:05:12,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 2446 events. 107/2446 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13612 event pairs, 10 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2390. Up to 35 conditions per place. [2025-03-08 22:05:12,469 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-03-08 22:05:12,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1056 transitions, 2154 flow [2025-03-08 22:05:12,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-08 22:05:12,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-08 22:05:12,473 INFO L175 Difference]: Start difference. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand 3 states and 3239 transitions. [2025-03-08 22:05:12,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1056 transitions, 2154 flow [2025-03-08 22:05:12,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:12,483 INFO L231 Difference]: Finished difference. Result has 1025 places, 1056 transitions, 2122 flow [2025-03-08 22:05:12,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1025, PETRI_TRANSITIONS=1056} [2025-03-08 22:05:12,485 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -16 predicate places. [2025-03-08 22:05:12,485 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1056 transitions, 2122 flow [2025-03-08 22:05:12,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:12,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:12,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:12,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:05:12,487 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:12,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:12,487 INFO L85 PathProgramCache]: Analyzing trace with hash 941585482, now seen corresponding path program 1 times [2025-03-08 22:05:12,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:12,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016817297] [2025-03-08 22:05:12,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:12,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:12,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 22:05:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 22:05:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:12,525 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-08 22:05:12,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:12,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016817297] [2025-03-08 22:05:12,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016817297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372339652] [2025-03-08 22:05:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:12,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:12,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:12,578 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-08 22:05:12,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:12,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:12,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-08 22:05:12,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:13,542 INFO L124 PetriNetUnfolderBase]: 205/4391 cut-off events. [2025-03-08 22:05:13,542 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2025-03-08 22:05:13,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4391 events. 205/4391 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 32378 event pairs, 24 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 4369. Up to 70 conditions per place. [2025-03-08 22:05:13,674 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-03-08 22:05:13,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1055 transitions, 2166 flow [2025-03-08 22:05:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-08 22:05:13,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-08 22:05:13,677 INFO L175 Difference]: Start difference. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand 3 states and 3225 transitions. [2025-03-08 22:05:13,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1055 transitions, 2166 flow [2025-03-08 22:05:13,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:13,686 INFO L231 Difference]: Finished difference. Result has 1024 places, 1055 transitions, 2120 flow [2025-03-08 22:05:13,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1024, PETRI_TRANSITIONS=1055} [2025-03-08 22:05:13,688 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -17 predicate places. [2025-03-08 22:05:13,688 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1055 transitions, 2120 flow [2025-03-08 22:05:13,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:13,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:13,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:13,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:05:13,689 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:13,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1304688186, now seen corresponding path program 1 times [2025-03-08 22:05:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:13,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114846489] [2025-03-08 22:05:13,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:13,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 22:05:13,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 22:05:13,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:13,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:13,729 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-08 22:05:13,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:13,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114846489] [2025-03-08 22:05:13,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114846489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:13,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:13,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:13,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974332889] [2025-03-08 22:05:13,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:13,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:13,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:13,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:13,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:13,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:13,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:13,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:13,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:14,030 INFO L124 PetriNetUnfolderBase]: 77/1572 cut-off events. [2025-03-08 22:05:14,030 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-03-08 22:05:14,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1572 events. 77/1572 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7444 event pairs, 16 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1514. Up to 54 conditions per place. [2025-03-08 22:05:14,074 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-03-08 22:05:14,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1054 transitions, 2160 flow [2025-03-08 22:05:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-03-08 22:05:14,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-03-08 22:05:14,078 INFO L175 Difference]: Start difference. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand 3 states and 3229 transitions. [2025-03-08 22:05:14,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1054 transitions, 2160 flow [2025-03-08 22:05:14,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1054 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:14,088 INFO L231 Difference]: Finished difference. Result has 1023 places, 1054 transitions, 2118 flow [2025-03-08 22:05:14,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1023, PETRI_TRANSITIONS=1054} [2025-03-08 22:05:14,090 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -18 predicate places. [2025-03-08 22:05:14,090 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1054 transitions, 2118 flow [2025-03-08 22:05:14,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 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-08 22:05:14,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:14,091 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-08 22:05:14,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:05:14,091 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 212472221, now seen corresponding path program 1 times [2025-03-08 22:05:14,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:14,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503050338] [2025-03-08 22:05:14,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:14,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:14,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 22:05:14,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 22:05:14,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:14,131 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-08 22:05:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:14,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503050338] [2025-03-08 22:05:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503050338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:14,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:14,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729720258] [2025-03-08 22:05:14,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:14,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:14,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:14,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:14,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:14,153 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-03-08 22:05:14,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:14,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:14,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-03-08 22:05:14,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:14,425 INFO L124 PetriNetUnfolderBase]: 73/1603 cut-off events. [2025-03-08 22:05:14,425 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-08 22:05:14,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1603 events. 73/1603 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7304 event pairs, 12 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1523. Up to 40 conditions per place. [2025-03-08 22:05:14,467 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-03-08 22:05:14,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1053 transitions, 2150 flow [2025-03-08 22:05:14,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:14,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:14,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-03-08 22:05:14,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-03-08 22:05:14,471 INFO L175 Difference]: Start difference. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand 3 states and 3237 transitions. [2025-03-08 22:05:14,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1053 transitions, 2150 flow [2025-03-08 22:05:14,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:14,481 INFO L231 Difference]: Finished difference. Result has 1022 places, 1053 transitions, 2116 flow [2025-03-08 22:05:14,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1053} [2025-03-08 22:05:14,484 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2025-03-08 22:05:14,484 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1053 transitions, 2116 flow [2025-03-08 22:05:14,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 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-08 22:05:14,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:14,485 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:14,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:05:14,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:14,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:14,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1280709980, now seen corresponding path program 1 times [2025-03-08 22:05:14,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:14,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879505338] [2025-03-08 22:05:14,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:14,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:14,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 22:05:14,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 22:05:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:14,528 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-08 22:05:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879505338] [2025-03-08 22:05:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879505338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602578195] [2025-03-08 22:05:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:14,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:14,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:14,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:14,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-03-08 22:05:14,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:14,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:14,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-03-08 22:05:14,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:14,783 INFO L124 PetriNetUnfolderBase]: 47/1072 cut-off events. [2025-03-08 22:05:14,783 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-03-08 22:05:14,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1072 events. 47/1072 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4390 event pairs, 10 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 979. Up to 35 conditions per place. [2025-03-08 22:05:14,804 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-03-08 22:05:14,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1052 transitions, 2146 flow [2025-03-08 22:05:14,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:14,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-03-08 22:05:14,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-03-08 22:05:14,808 INFO L175 Difference]: Start difference. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand 3 states and 3239 transitions. [2025-03-08 22:05:14,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1052 transitions, 2146 flow [2025-03-08 22:05:14,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:14,818 INFO L231 Difference]: Finished difference. Result has 1021 places, 1052 transitions, 2114 flow [2025-03-08 22:05:14,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1052} [2025-03-08 22:05:14,820 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-08 22:05:14,820 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1052 transitions, 2114 flow [2025-03-08 22:05:14,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 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-08 22:05:14,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:14,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:14,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:05:14,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:14,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:14,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1228748222, now seen corresponding path program 1 times [2025-03-08 22:05:14,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:14,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606790049] [2025-03-08 22:05:14,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:14,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:14,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 22:05:14,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 22:05:14,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:14,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:14,867 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-08 22:05:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606790049] [2025-03-08 22:05:14,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606790049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717804263] [2025-03-08 22:05:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:14,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:14,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:14,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:14,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:14,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-03-08 22:05:14,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:14,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:14,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-03-08 22:05:14,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:15,197 INFO L124 PetriNetUnfolderBase]: 85/1601 cut-off events. [2025-03-08 22:05:15,198 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-03-08 22:05:15,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1601 events. 85/1601 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8320 event pairs, 24 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1535. Up to 70 conditions per place. [2025-03-08 22:05:15,242 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-03-08 22:05:15,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2158 flow [2025-03-08 22:05:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-03-08 22:05:15,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-03-08 22:05:15,246 INFO L175 Difference]: Start difference. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand 3 states and 3225 transitions. [2025-03-08 22:05:15,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2158 flow [2025-03-08 22:05:15,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:15,260 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2112 flow [2025-03-08 22:05:15,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2025-03-08 22:05:15,261 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -21 predicate places. [2025-03-08 22:05:15,261 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2112 flow [2025-03-08 22:05:15,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 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-08 22:05:15,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:15,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:15,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:05:15,263 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:15,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2012202686, now seen corresponding path program 1 times [2025-03-08 22:05:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663397937] [2025-03-08 22:05:15,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:15,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:15,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 22:05:15,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 22:05:15,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:15,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:15,312 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-08 22:05:15,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:15,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663397937] [2025-03-08 22:05:15,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663397937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:15,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:15,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:15,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841743955] [2025-03-08 22:05:15,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:15,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:15,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:15,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:15,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-08 22:05:15,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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-08 22:05:15,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:15,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-08 22:05:15,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:15,780 INFO L124 PetriNetUnfolderBase]: 121/2611 cut-off events. [2025-03-08 22:05:15,781 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-03-08 22:05:15,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2667 conditions, 2611 events. 121/2611 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 14369 event pairs, 15 based on Foata normal form. 0/2092 useless extension candidates. Maximal degree in co-relation 2514. Up to 43 conditions per place. [2025-03-08 22:05:15,858 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 12 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-08 22:05:15,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1050 transitions, 2138 flow [2025-03-08 22:05:15,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3243 transitions. [2025-03-08 22:05:15,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972997299729973 [2025-03-08 22:05:15,862 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand 3 states and 3243 transitions. [2025-03-08 22:05:15,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1050 transitions, 2138 flow [2025-03-08 22:05:15,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1050 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:15,873 INFO L231 Difference]: Finished difference. Result has 1019 places, 1050 transitions, 2110 flow [2025-03-08 22:05:15,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1019, PETRI_TRANSITIONS=1050} [2025-03-08 22:05:15,874 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -22 predicate places. [2025-03-08 22:05:15,874 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1050 transitions, 2110 flow [2025-03-08 22:05:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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-08 22:05:15,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:15,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:05:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:05:15,875 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:15,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1623007537, now seen corresponding path program 1 times [2025-03-08 22:05:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312349244] [2025-03-08 22:05:15,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:15,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 22:05:15,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 22:05:15,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:15,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:16,372 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-08 22:05:16,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312349244] [2025-03-08 22:05:16,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312349244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:16,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:16,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:05:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112948537] [2025-03-08 22:05:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:05:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:16,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:05:16,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:05:16,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1111 [2025-03-08 22:05:16,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 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-08 22:05:16,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:16,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1111 [2025-03-08 22:05:16,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:19,197 INFO L124 PetriNetUnfolderBase]: 893/12790 cut-off events. [2025-03-08 22:05:19,197 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2025-03-08 22:05:19,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13410 conditions, 12790 events. 893/12790 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 131974 event pairs, 264 based on Foata normal form. 0/10061 useless extension candidates. Maximal degree in co-relation 13198. Up to 580 conditions per place. [2025-03-08 22:05:19,522 INFO L140 encePairwiseOnDemand]: 1105/1111 looper letters, 26 selfloop transitions, 5 changer transitions 0/1049 dead transitions. [2025-03-08 22:05:19,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2170 flow [2025-03-08 22:05:19,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:05:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:05:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6392 transitions. [2025-03-08 22:05:19,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588958895889589 [2025-03-08 22:05:19,528 INFO L175 Difference]: Start difference. First operand has 1019 places, 1050 transitions, 2110 flow. Second operand 6 states and 6392 transitions. [2025-03-08 22:05:19,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2170 flow [2025-03-08 22:05:19,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1049 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:19,537 INFO L231 Difference]: Finished difference. Result has 1021 places, 1049 transitions, 2114 flow [2025-03-08 22:05:19,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1049} [2025-03-08 22:05:19,538 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-03-08 22:05:19,538 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1049 transitions, 2114 flow [2025-03-08 22:05:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 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-08 22:05:19,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:19,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:19,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:05:19,539 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1997322370, now seen corresponding path program 1 times [2025-03-08 22:05:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:19,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976512204] [2025-03-08 22:05:19,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:19,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:19,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-08 22:05:19,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-08 22:05:19,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:19,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:19,580 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-08 22:05:19,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:19,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976512204] [2025-03-08 22:05:19,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976512204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129444944] [2025-03-08 22:05:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:19,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:19,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:19,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:19,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:19,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-08 22:05:19,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 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-08 22:05:19,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:19,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-08 22:05:19,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:20,361 INFO L124 PetriNetUnfolderBase]: 163/3539 cut-off events. [2025-03-08 22:05:20,362 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-08 22:05:20,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 3539 events. 163/3539 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22864 event pairs, 9 based on Foata normal form. 0/2821 useless extension candidates. Maximal degree in co-relation 3602. Up to 43 conditions per place. [2025-03-08 22:05:20,501 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-03-08 22:05:20,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1050 transitions, 2154 flow [2025-03-08 22:05:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-08 22:05:20,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-08 22:05:20,507 INFO L175 Difference]: Start difference. First operand has 1021 places, 1049 transitions, 2114 flow. Second operand 3 states and 3244 transitions. [2025-03-08 22:05:20,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1050 transitions, 2154 flow [2025-03-08 22:05:20,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1050 transitions, 2144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:05:20,518 INFO L231 Difference]: Finished difference. Result has 1017 places, 1048 transitions, 2106 flow [2025-03-08 22:05:20,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1017, PETRI_TRANSITIONS=1048} [2025-03-08 22:05:20,519 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -24 predicate places. [2025-03-08 22:05:20,519 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1048 transitions, 2106 flow [2025-03-08 22:05:20,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 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-08 22:05:20,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:20,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:20,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:05:20,521 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:20,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:20,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1828985127, now seen corresponding path program 1 times [2025-03-08 22:05:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916010230] [2025-03-08 22:05:20,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:20,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:20,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 22:05:20,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 22:05:20,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:20,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:20,558 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-08 22:05:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916010230] [2025-03-08 22:05:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916010230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398401768] [2025-03-08 22:05:20,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:20,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:20,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:20,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:20,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:20,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 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-08 22:05:20,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:20,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:20,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:21,004 INFO L124 PetriNetUnfolderBase]: 115/2154 cut-off events. [2025-03-08 22:05:21,004 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:05:21,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 2154 events. 115/2154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 13223 event pairs, 26 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 2062. Up to 73 conditions per place. [2025-03-08 22:05:21,067 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-03-08 22:05:21,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1049 transitions, 2158 flow [2025-03-08 22:05:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-08 22:05:21,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-08 22:05:21,069 INFO L175 Difference]: Start difference. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand 3 states and 3232 transitions. [2025-03-08 22:05:21,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1049 transitions, 2158 flow [2025-03-08 22:05:21,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1049 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:21,079 INFO L231 Difference]: Finished difference. Result has 1016 places, 1047 transitions, 2104 flow [2025-03-08 22:05:21,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1016, PETRI_TRANSITIONS=1047} [2025-03-08 22:05:21,080 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -25 predicate places. [2025-03-08 22:05:21,080 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1047 transitions, 2104 flow [2025-03-08 22:05:21,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 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-08 22:05:21,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:21,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:21,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:05:21,082 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:21,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1115919417, now seen corresponding path program 1 times [2025-03-08 22:05:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608938500] [2025-03-08 22:05:21,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:21,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 22:05:21,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 22:05:21,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:21,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:21,113 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-08 22:05:21,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:21,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608938500] [2025-03-08 22:05:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608938500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:21,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:21,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414423826] [2025-03-08 22:05:21,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:21,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:21,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:21,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:21,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-08 22:05:21,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 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-08 22:05:21,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:21,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-08 22:05:21,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:21,448 INFO L124 PetriNetUnfolderBase]: 79/1602 cut-off events. [2025-03-08 22:05:21,448 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2025-03-08 22:05:21,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1602 events. 79/1602 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7898 event pairs, 14 based on Foata normal form. 0/1300 useless extension candidates. Maximal degree in co-relation 1454. Up to 43 conditions per place. [2025-03-08 22:05:21,502 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-03-08 22:05:21,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1048 transitions, 2144 flow [2025-03-08 22:05:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-08 22:05:21,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-08 22:05:21,505 INFO L175 Difference]: Start difference. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand 3 states and 3244 transitions. [2025-03-08 22:05:21,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1048 transitions, 2144 flow [2025-03-08 22:05:21,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1048 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:21,513 INFO L231 Difference]: Finished difference. Result has 1015 places, 1046 transitions, 2102 flow [2025-03-08 22:05:21,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1015, PETRI_TRANSITIONS=1046} [2025-03-08 22:05:21,514 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -26 predicate places. [2025-03-08 22:05:21,514 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1046 transitions, 2102 flow [2025-03-08 22:05:21,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 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-08 22:05:21,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:21,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:21,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:05:21,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err40ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:21,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1338613789, now seen corresponding path program 1 times [2025-03-08 22:05:21,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:21,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843995394] [2025-03-08 22:05:21,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:21,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:21,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-08 22:05:21,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-08 22:05:21,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:21,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:21,544 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-08 22:05:21,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:21,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843995394] [2025-03-08 22:05:21,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843995394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:21,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:21,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805428945] [2025-03-08 22:05:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:21,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:21,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:21,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:21,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:21,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-08 22:05:21,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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-08 22:05:21,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:21,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-08 22:05:21,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:23,403 INFO L124 PetriNetUnfolderBase]: 847/10614 cut-off events. [2025-03-08 22:05:23,403 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 22:05:23,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 10614 events. 847/10614 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 103437 event pairs, 190 based on Foata normal form. 0/8479 useless extension candidates. Maximal degree in co-relation 10900. Up to 658 conditions per place. [2025-03-08 22:05:23,728 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-03-08 22:05:23,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1040 transitions, 2154 flow [2025-03-08 22:05:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-08 22:05:23,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-08 22:05:23,731 INFO L175 Difference]: Start difference. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand 3 states and 3206 transitions. [2025-03-08 22:05:23,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1040 transitions, 2154 flow [2025-03-08 22:05:23,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1040 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:23,742 INFO L231 Difference]: Finished difference. Result has 1006 places, 1038 transitions, 2092 flow [2025-03-08 22:05:23,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1006, PETRI_TRANSITIONS=1038} [2025-03-08 22:05:23,744 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -35 predicate places. [2025-03-08 22:05:23,744 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1038 transitions, 2092 flow [2025-03-08 22:05:23,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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-08 22:05:23,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:23,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:05:23,746 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:23,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:23,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2082408196, now seen corresponding path program 1 times [2025-03-08 22:05:23,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:23,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502765926] [2025-03-08 22:05:23,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:23,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:23,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-08 22:05:23,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-08 22:05:23,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:23,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:23,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:23,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502765926] [2025-03-08 22:05:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502765926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:23,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:23,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873228046] [2025-03-08 22:05:23,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:23,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:23,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:23,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:23,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:23,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-08 22:05:23,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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-08 22:05:23,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:23,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-08 22:05:23,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:25,202 INFO L124 PetriNetUnfolderBase]: 451/6342 cut-off events. [2025-03-08 22:05:25,203 INFO L125 PetriNetUnfolderBase]: For 31/77 co-relation queries the response was YES. [2025-03-08 22:05:25,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 6342 events. 451/6342 cut-off events. For 31/77 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 51722 event pairs, 110 based on Foata normal form. 1/5113 useless extension candidates. Maximal degree in co-relation 6242. Up to 340 conditions per place. [2025-03-08 22:05:25,450 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2025-03-08 22:05:25,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1032 transitions, 2144 flow [2025-03-08 22:05:25,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:25,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-08 22:05:25,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-08 22:05:25,452 INFO L175 Difference]: Start difference. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand 3 states and 3206 transitions. [2025-03-08 22:05:25,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1032 transitions, 2144 flow [2025-03-08 22:05:25,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1032 transitions, 2144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:25,461 INFO L231 Difference]: Finished difference. Result has 999 places, 1030 transitions, 2086 flow [2025-03-08 22:05:25,462 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1030} [2025-03-08 22:05:25,462 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-08 22:05:25,462 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1030 transitions, 2086 flow [2025-03-08 22:05:25,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 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-08 22:05:25,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:25,463 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:25,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:05:25,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1385620179, now seen corresponding path program 1 times [2025-03-08 22:05:25,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:25,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132803794] [2025-03-08 22:05:25,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:25,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 22:05:25,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 22:05:25,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:25,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:25,493 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-08 22:05:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:25,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132803794] [2025-03-08 22:05:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132803794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82914324] [2025-03-08 22:05:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:25,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:25,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:25,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:25,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1030 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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-08 22:05:25,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:25,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:25,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:26,114 INFO L124 PetriNetUnfolderBase]: 166/2871 cut-off events. [2025-03-08 22:05:26,114 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-03-08 22:05:26,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 2871 events. 166/2871 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 20431 event pairs, 37 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 2250. Up to 106 conditions per place. [2025-03-08 22:05:26,171 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-03-08 22:05:26,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1031 transitions, 2138 flow [2025-03-08 22:05:26,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-08 22:05:26,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-08 22:05:26,173 INFO L175 Difference]: Start difference. First operand has 999 places, 1030 transitions, 2086 flow. Second operand 3 states and 3232 transitions. [2025-03-08 22:05:26,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1031 transitions, 2138 flow [2025-03-08 22:05:26,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2138 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:26,180 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2088 flow [2025-03-08 22:05:26,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2025-03-08 22:05:26,181 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -41 predicate places. [2025-03-08 22:05:26,182 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2088 flow [2025-03-08 22:05:26,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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-08 22:05:26,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:26,182 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:26,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:05:26,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:26,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:26,183 INFO L85 PathProgramCache]: Analyzing trace with hash 626883669, now seen corresponding path program 1 times [2025-03-08 22:05:26,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254289154] [2025-03-08 22:05:26,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:26,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:26,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-08 22:05:26,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-08 22:05:26,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:26,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:26,210 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-08 22:05:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:26,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254289154] [2025-03-08 22:05:26,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254289154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594993990] [2025-03-08 22:05:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:26,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:26,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:26,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:26,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:26,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-03-08 22:05:26,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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-08 22:05:26,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:26,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-03-08 22:05:26,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:26,619 INFO L124 PetriNetUnfolderBase]: 105/2080 cut-off events. [2025-03-08 22:05:26,619 INFO L125 PetriNetUnfolderBase]: For 21/35 co-relation queries the response was YES. [2025-03-08 22:05:26,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 2080 events. 105/2080 cut-off events. For 21/35 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11734 event pairs, 14 based on Foata normal form. 1/1710 useless extension candidates. Maximal degree in co-relation 1934. Up to 48 conditions per place. [2025-03-08 22:05:26,681 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2025-03-08 22:05:26,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2128 flow [2025-03-08 22:05:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:26,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-03-08 22:05:26,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-03-08 22:05:26,683 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand 3 states and 3244 transitions. [2025-03-08 22:05:26,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2128 flow [2025-03-08 22:05:26,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:26,691 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2086 flow [2025-03-08 22:05:26,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2025-03-08 22:05:26,692 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-03-08 22:05:26,692 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2086 flow [2025-03-08 22:05:26,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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-08 22:05:26,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:26,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:05:26,693 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:26,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:26,694 INFO L85 PathProgramCache]: Analyzing trace with hash 517139201, now seen corresponding path program 1 times [2025-03-08 22:05:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926535382] [2025-03-08 22:05:26,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:26,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-03-08 22:05:26,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-03-08 22:05:26,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:26,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:26,721 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-08 22:05:26,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:26,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926535382] [2025-03-08 22:05:26,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926535382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:26,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289875025] [2025-03-08 22:05:26,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:26,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:26,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:26,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:26,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1111 [2025-03-08 22:05:26,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 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-08 22:05:26,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:26,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1111 [2025-03-08 22:05:26,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:27,452 INFO L124 PetriNetUnfolderBase]: 191/3773 cut-off events. [2025-03-08 22:05:27,452 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-08 22:05:27,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3773 events. 191/3773 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25720 event pairs, 8 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 3438. Up to 42 conditions per place. [2025-03-08 22:05:27,576 INFO L140 encePairwiseOnDemand]: 1097/1111 looper letters, 18 selfloop transitions, 9 changer transitions 0/1029 dead transitions. [2025-03-08 22:05:27,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1029 transitions, 2144 flow [2025-03-08 22:05:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:27,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:27,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3230 transitions. [2025-03-08 22:05:27,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690969096909691 [2025-03-08 22:05:27,578 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2086 flow. Second operand 3 states and 3230 transitions. [2025-03-08 22:05:27,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1029 transitions, 2144 flow [2025-03-08 22:05:27,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1029 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:27,588 INFO L231 Difference]: Finished difference. Result has 995 places, 1027 transitions, 2115 flow [2025-03-08 22:05:27,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=995, PETRI_TRANSITIONS=1027} [2025-03-08 22:05:27,589 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2025-03-08 22:05:27,589 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1027 transitions, 2115 flow [2025-03-08 22:05:27,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 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-08 22:05:27,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:27,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:27,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:05:27,590 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err39ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:27,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:27,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2005271327, now seen corresponding path program 1 times [2025-03-08 22:05:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548732859] [2025-03-08 22:05:27,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:27,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 22:05:27,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 22:05:27,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:27,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:27,618 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-08 22:05:27,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:27,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548732859] [2025-03-08 22:05:27,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548732859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:27,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:27,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:27,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328459028] [2025-03-08 22:05:27,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:27,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:27,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:27,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:27,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-03-08 22:05:27,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1027 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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-08 22:05:27,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:27,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-03-08 22:05:27,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:30,999 INFO L124 PetriNetUnfolderBase]: 1560/19947 cut-off events. [2025-03-08 22:05:30,999 INFO L125 PetriNetUnfolderBase]: For 147/153 co-relation queries the response was YES. [2025-03-08 22:05:31,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21185 conditions, 19947 events. 1560/19947 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 223057 event pairs, 488 based on Foata normal form. 0/16098 useless extension candidates. Maximal degree in co-relation 15917. Up to 1175 conditions per place. [2025-03-08 22:05:31,259 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1021 dead transitions. [2025-03-08 22:05:31,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1021 transitions, 2167 flow [2025-03-08 22:05:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-03-08 22:05:31,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-03-08 22:05:31,261 INFO L175 Difference]: Start difference. First operand has 995 places, 1027 transitions, 2115 flow. Second operand 3 states and 3206 transitions. [2025-03-08 22:05:31,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1021 transitions, 2167 flow [2025-03-08 22:05:31,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1021 transitions, 2158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:31,270 INFO L231 Difference]: Finished difference. Result has 987 places, 1019 transitions, 2100 flow [2025-03-08 22:05:31,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1019} [2025-03-08 22:05:31,271 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-03-08 22:05:31,271 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1019 transitions, 2100 flow [2025-03-08 22:05:31,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 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-08 22:05:31,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:31,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:31,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:05:31,272 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:31,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:31,272 INFO L85 PathProgramCache]: Analyzing trace with hash 18865322, now seen corresponding path program 1 times [2025-03-08 22:05:31,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615986305] [2025-03-08 22:05:31,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:31,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-08 22:05:31,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-08 22:05:31,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:31,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:31,301 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-08 22:05:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:31,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615986305] [2025-03-08 22:05:31,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615986305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:31,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:31,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:31,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297399534] [2025-03-08 22:05:31,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:31,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:31,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:31,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:31,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:31,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1111 [2025-03-08 22:05:31,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1019 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 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-08 22:05:31,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:31,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1111 [2025-03-08 22:05:31,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:32,182 INFO L124 PetriNetUnfolderBase]: 261/5106 cut-off events. [2025-03-08 22:05:32,182 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-03-08 22:05:32,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 5106 events. 261/5106 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 44421 event pairs, 20 based on Foata normal form. 1/4217 useless extension candidates. Maximal degree in co-relation 4580. Up to 68 conditions per place. [2025-03-08 22:05:32,309 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 3 changer transitions 0/1020 dead transitions. [2025-03-08 22:05:32,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 1020 transitions, 2154 flow [2025-03-08 22:05:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2025-03-08 22:05:32,311 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714971497149715 [2025-03-08 22:05:32,311 INFO L175 Difference]: Start difference. First operand has 987 places, 1019 transitions, 2100 flow. Second operand 3 states and 3238 transitions. [2025-03-08 22:05:32,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 1020 transitions, 2154 flow [2025-03-08 22:05:32,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1020 transitions, 2154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:05:32,320 INFO L231 Difference]: Finished difference. Result has 988 places, 1018 transitions, 2104 flow [2025-03-08 22:05:32,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=988, PETRI_TRANSITIONS=1018} [2025-03-08 22:05:32,322 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -53 predicate places. [2025-03-08 22:05:32,322 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 1018 transitions, 2104 flow [2025-03-08 22:05:32,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 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-08 22:05:32,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:32,323 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:32,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:05:32,323 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err41ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:32,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:32,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1932998668, now seen corresponding path program 1 times [2025-03-08 22:05:32,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:32,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615158357] [2025-03-08 22:05:32,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:32,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:32,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 22:05:32,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 22:05:32,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:32,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:32,351 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-08 22:05:32,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:32,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615158357] [2025-03-08 22:05:32,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615158357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:32,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:32,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131601907] [2025-03-08 22:05:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:32,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:32,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:32,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:32,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:32,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:32,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:32,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:32,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:32,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:33,014 INFO L124 PetriNetUnfolderBase]: 180/3058 cut-off events. [2025-03-08 22:05:33,014 INFO L125 PetriNetUnfolderBase]: For 46/60 co-relation queries the response was YES. [2025-03-08 22:05:33,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 3058 events. 180/3058 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22280 event pairs, 37 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 2527. Up to 139 conditions per place. [2025-03-08 22:05:33,088 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1019 dead transitions. [2025-03-08 22:05:33,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1019 transitions, 2156 flow [2025-03-08 22:05:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-03-08 22:05:33,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-03-08 22:05:33,090 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2104 flow. Second operand 3 states and 3232 transitions. [2025-03-08 22:05:33,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1019 transitions, 2156 flow [2025-03-08 22:05:33,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1019 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:33,097 INFO L231 Difference]: Finished difference. Result has 987 places, 1017 transitions, 2100 flow [2025-03-08 22:05:33,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1017} [2025-03-08 22:05:33,098 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-03-08 22:05:33,098 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1017 transitions, 2100 flow [2025-03-08 22:05:33,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:33,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:33,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:33,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:05:33,099 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:33,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 340453243, now seen corresponding path program 1 times [2025-03-08 22:05:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:33,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719164060] [2025-03-08 22:05:33,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:33,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-08 22:05:33,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-08 22:05:33,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:33,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:33,129 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-08 22:05:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:33,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719164060] [2025-03-08 22:05:33,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719164060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:33,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:33,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46374831] [2025-03-08 22:05:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:33,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:33,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:33,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:33,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:33,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-08 22:05:33,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1017 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 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-08 22:05:33,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:33,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-08 22:05:33,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:34,069 INFO L124 PetriNetUnfolderBase]: 298/5500 cut-off events. [2025-03-08 22:05:34,069 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-03-08 22:05:34,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5500 events. 298/5500 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 44911 event pairs, 15 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 5387. Up to 68 conditions per place. [2025-03-08 22:05:34,202 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 20 selfloop transitions, 9 changer transitions 0/1017 dead transitions. [2025-03-08 22:05:34,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1017 transitions, 2160 flow [2025-03-08 22:05:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:34,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:34,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3224 transitions. [2025-03-08 22:05:34,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672967296729673 [2025-03-08 22:05:34,204 INFO L175 Difference]: Start difference. First operand has 987 places, 1017 transitions, 2100 flow. Second operand 3 states and 3224 transitions. [2025-03-08 22:05:34,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1017 transitions, 2160 flow [2025-03-08 22:05:34,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:34,218 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2127 flow [2025-03-08 22:05:34,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2025-03-08 22:05:34,219 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-08 22:05:34,219 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2127 flow [2025-03-08 22:05:34,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 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-08 22:05:34,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:34,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:34,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:05:34,220 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:34,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1997670501, now seen corresponding path program 1 times [2025-03-08 22:05:34,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:34,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330801192] [2025-03-08 22:05:34,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:34,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:34,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-08 22:05:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 22:05:34,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:34,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:34,257 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-08 22:05:34,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:34,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330801192] [2025-03-08 22:05:34,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330801192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:34,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:34,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:34,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828014903] [2025-03-08 22:05:34,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:34,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:34,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:34,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:34,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:34,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-08 22:05:34,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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-08 22:05:34,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:34,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-08 22:05:34,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:35,190 INFO L124 PetriNetUnfolderBase]: 285/5368 cut-off events. [2025-03-08 22:05:35,190 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-03-08 22:05:35,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 5368 events. 285/5368 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 47683 event pairs, 30 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 5082. Up to 105 conditions per place. [2025-03-08 22:05:35,297 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 23 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2025-03-08 22:05:35,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2183 flow [2025-03-08 22:05:35,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3236 transitions. [2025-03-08 22:05:35,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708970897089709 [2025-03-08 22:05:35,299 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2127 flow. Second operand 3 states and 3236 transitions. [2025-03-08 22:05:35,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2183 flow [2025-03-08 22:05:35,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1016 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:35,308 INFO L231 Difference]: Finished difference. Result has 982 places, 1014 transitions, 2122 flow [2025-03-08 22:05:35,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=982, PETRI_TRANSITIONS=1014} [2025-03-08 22:05:35,314 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-03-08 22:05:35,314 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1014 transitions, 2122 flow [2025-03-08 22:05:35,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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-08 22:05:35,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:35,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:35,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:05:35,315 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err38ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:35,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:35,315 INFO L85 PathProgramCache]: Analyzing trace with hash -583627212, now seen corresponding path program 1 times [2025-03-08 22:05:35,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:35,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594788726] [2025-03-08 22:05:35,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:35,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:35,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 22:05:35,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 22:05:35,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:35,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:35,344 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-08 22:05:35,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:35,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594788726] [2025-03-08 22:05:35,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594788726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:35,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:35,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414328202] [2025-03-08 22:05:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:35,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:35,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:35,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:35,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:35,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-03-08 22:05:35,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1014 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 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-08 22:05:35,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:35,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-03-08 22:05:35,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:35,935 INFO L124 PetriNetUnfolderBase]: 174/3080 cut-off events. [2025-03-08 22:05:35,935 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-03-08 22:05:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 3080 events. 174/3080 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 21955 event pairs, 21 based on Foata normal form. 2/2608 useless extension candidates. Maximal degree in co-relation 2561. Up to 91 conditions per place. [2025-03-08 22:05:36,013 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 16 selfloop transitions, 8 changer transitions 14/1014 dead transitions. [2025-03-08 22:05:36,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 1014 transitions, 2180 flow [2025-03-08 22:05:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3223 transitions. [2025-03-08 22:05:36,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966996699669967 [2025-03-08 22:05:36,015 INFO L175 Difference]: Start difference. First operand has 982 places, 1014 transitions, 2122 flow. Second operand 3 states and 3223 transitions. [2025-03-08 22:05:36,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 1014 transitions, 2180 flow [2025-03-08 22:05:36,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 1014 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:36,025 INFO L231 Difference]: Finished difference. Result has 977 places, 998 transitions, 2111 flow [2025-03-08 22:05:36,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=977, PETRI_TRANSITIONS=998} [2025-03-08 22:05:36,027 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -64 predicate places. [2025-03-08 22:05:36,027 INFO L471 AbstractCegarLoop]: Abstraction has has 977 places, 998 transitions, 2111 flow [2025-03-08 22:05:36,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 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-08 22:05:36,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:36,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:05:36,028 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:36,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 28013676, now seen corresponding path program 1 times [2025-03-08 22:05:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:36,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275174214] [2025-03-08 22:05:36,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 22:05:36,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 22:05:36,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:36,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:36,062 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-08 22:05:36,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275174214] [2025-03-08 22:05:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275174214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813786851] [2025-03-08 22:05:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:36,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:36,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:36,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:36,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-08 22:05:36,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 998 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 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-08 22:05:36,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:36,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-08 22:05:36,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:37,097 INFO L124 PetriNetUnfolderBase]: 215/4625 cut-off events. [2025-03-08 22:05:37,097 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2025-03-08 22:05:37,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 4625 events. 215/4625 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39030 event pairs, 4 based on Foata normal form. 1/3903 useless extension candidates. Maximal degree in co-relation 4558. Up to 73 conditions per place. [2025-03-08 22:05:37,193 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-03-08 22:05:37,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 1003 transitions, 2161 flow [2025-03-08 22:05:37,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3253 transitions. [2025-03-08 22:05:37,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975997599759976 [2025-03-08 22:05:37,195 INFO L175 Difference]: Start difference. First operand has 977 places, 998 transitions, 2111 flow. Second operand 3 states and 3253 transitions. [2025-03-08 22:05:37,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 1003 transitions, 2161 flow [2025-03-08 22:05:37,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 1003 transitions, 2153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:37,203 INFO L231 Difference]: Finished difference. Result has 966 places, 999 transitions, 2117 flow [2025-03-08 22:05:37,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2117, PETRI_PLACES=966, PETRI_TRANSITIONS=999} [2025-03-08 22:05:37,204 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -75 predicate places. [2025-03-08 22:05:37,205 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 999 transitions, 2117 flow [2025-03-08 22:05:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 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-08 22:05:37,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:37,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:05:37,205 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:37,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1156551223, now seen corresponding path program 1 times [2025-03-08 22:05:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23517586] [2025-03-08 22:05:37,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:37,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-08 22:05:37,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 22:05:37,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:37,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:05:37,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:37,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23517586] [2025-03-08 22:05:37,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23517586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548935460] [2025-03-08 22:05:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:37,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:37,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:37,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:37,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-08 22:05:37,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 999 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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-08 22:05:37,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:37,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-08 22:05:37,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:39,287 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-03-08 22:05:39,287 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2025-03-08 22:05:39,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 9044 events. 488/9044 cut-off events. For 6/42 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 83269 event pairs, 14 based on Foata normal form. 2/7653 useless extension candidates. Maximal degree in co-relation 8207. Up to 166 conditions per place. [2025-03-08 22:05:39,417 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-03-08 22:05:39,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2179 flow [2025-03-08 22:05:39,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-08 22:05:39,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-08 22:05:39,419 INFO L175 Difference]: Start difference. First operand has 966 places, 999 transitions, 2117 flow. Second operand 3 states and 3211 transitions. [2025-03-08 22:05:39,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2179 flow [2025-03-08 22:05:39,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:39,427 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-03-08 22:05:39,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2025-03-08 22:05:39,428 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-08 22:05:39,428 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-03-08 22:05:39,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 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-08 22:05:39,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:39,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:39,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:05:39,429 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err37ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:39,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -837489279, now seen corresponding path program 1 times [2025-03-08 22:05:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947582833] [2025-03-08 22:05:39,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:05:39,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:05:39,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:39,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:39,456 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-08 22:05:39,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:39,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947582833] [2025-03-08 22:05:39,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947582833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:39,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:39,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946190370] [2025-03-08 22:05:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:39,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:39,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:39,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-08 22:05:39,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 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-08 22:05:39,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:39,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-08 22:05:39,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:40,326 INFO L124 PetriNetUnfolderBase]: 243/3759 cut-off events. [2025-03-08 22:05:40,326 INFO L125 PetriNetUnfolderBase]: For 199/217 co-relation queries the response was YES. [2025-03-08 22:05:40,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 3759 events. 243/3759 cut-off events. For 199/217 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30779 event pairs, 36 based on Foata normal form. 1/3174 useless extension candidates. Maximal degree in co-relation 3606. Up to 212 conditions per place. [2025-03-08 22:05:40,455 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 20 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-03-08 22:05:40,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2201 flow [2025-03-08 22:05:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-03-08 22:05:40,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96999699969997 [2025-03-08 22:05:40,457 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3233 transitions. [2025-03-08 22:05:40,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2201 flow [2025-03-08 22:05:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:40,465 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-03-08 22:05:40,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2025-03-08 22:05:40,466 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -81 predicate places. [2025-03-08 22:05:40,466 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-03-08 22:05:40,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 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-08 22:05:40,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:40,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:40,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:05:40,467 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:40,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:40,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1304405235, now seen corresponding path program 1 times [2025-03-08 22:05:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:40,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050166448] [2025-03-08 22:05:40,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:40,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:40,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:05:40,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:05:40,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:40,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:40,493 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-08 22:05:40,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050166448] [2025-03-08 22:05:40,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050166448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:40,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725484898] [2025-03-08 22:05:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:40,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:40,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:40,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:40,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:40,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:40,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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-08 22:05:40,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:40,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:40,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:42,343 INFO L124 PetriNetUnfolderBase]: 367/7045 cut-off events. [2025-03-08 22:05:42,344 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2025-03-08 22:05:42,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 7045 events. 367/7045 cut-off events. For 97/135 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 68114 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6189. Up to 147 conditions per place. [2025-03-08 22:05:42,541 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-03-08 22:05:42,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2195 flow [2025-03-08 22:05:42,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-08 22:05:42,544 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-08 22:05:42,544 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3231 transitions. [2025-03-08 22:05:42,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2195 flow [2025-03-08 22:05:42,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:42,555 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-03-08 22:05:42,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2025-03-08 22:05:42,555 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -82 predicate places. [2025-03-08 22:05:42,556 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-03-08 22:05:42,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 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-08 22:05:42,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:42,556 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:42,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:05:42,556 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:42,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:42,557 INFO L85 PathProgramCache]: Analyzing trace with hash -572587610, now seen corresponding path program 1 times [2025-03-08 22:05:42,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:42,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071505846] [2025-03-08 22:05:42,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:42,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:42,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 22:05:42,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 22:05:42,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:42,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:42,595 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-08 22:05:42,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071505846] [2025-03-08 22:05:42,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071505846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:42,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:42,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:42,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772268565] [2025-03-08 22:05:42,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:42,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:42,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:42,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:42,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:42,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-08 22:05:42,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 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-08 22:05:42,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:42,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-08 22:05:42,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:44,497 INFO L124 PetriNetUnfolderBase]: 267/5701 cut-off events. [2025-03-08 22:05:44,497 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2025-03-08 22:05:44,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5701 events. 267/5701 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50656 event pairs, 8 based on Foata normal form. 0/4817 useless extension candidates. Maximal degree in co-relation 4923. Up to 89 conditions per place. [2025-03-08 22:05:44,752 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-03-08 22:05:44,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-03-08 22:05:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3252 transitions. [2025-03-08 22:05:44,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9756975697569757 [2025-03-08 22:05:44,754 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3252 transitions. [2025-03-08 22:05:44,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-03-08 22:05:44,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:44,763 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-03-08 22:05:44,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2025-03-08 22:05:44,764 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-03-08 22:05:44,764 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-03-08 22:05:44,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 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-08 22:05:44,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:44,765 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:44,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:05:44,765 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:44,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:44,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1486206755, now seen corresponding path program 1 times [2025-03-08 22:05:44,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240208435] [2025-03-08 22:05:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:44,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:44,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 22:05:44,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 22:05:44,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:44,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:44,790 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-08 22:05:44,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:44,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240208435] [2025-03-08 22:05:44,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240208435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:44,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:44,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:44,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155880241] [2025-03-08 22:05:44,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:44,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:44,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:44,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-08 22:05:44,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 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-08 22:05:44,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:44,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-08 22:05:44,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:47,730 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-03-08 22:05:47,730 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2025-03-08 22:05:48,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 10693 events. 631/10693 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 110170 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9704. Up to 336 conditions per place. [2025-03-08 22:05:48,205 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-03-08 22:05:48,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-03-08 22:05:48,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:48,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-08 22:05:48,207 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-08 22:05:48,207 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3211 transitions. [2025-03-08 22:05:48,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-03-08 22:05:48,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:48,216 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-03-08 22:05:48,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2025-03-08 22:05:48,217 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -85 predicate places. [2025-03-08 22:05:48,217 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-03-08 22:05:48,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 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-08 22:05:48,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:48,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:48,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:05:48,217 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:48,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1625524206, now seen corresponding path program 1 times [2025-03-08 22:05:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:48,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65385662] [2025-03-08 22:05:48,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:48,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:48,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 22:05:48,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 22:05:48,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:48,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:48,242 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-08 22:05:48,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:48,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65385662] [2025-03-08 22:05:48,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65385662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:48,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:48,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:48,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774991349] [2025-03-08 22:05:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:48,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:48,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:48,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:48,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:48,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:48,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:48,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:48,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:48,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:50,649 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-03-08 22:05:50,649 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2025-03-08 22:05:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 8694 events. 484/8694 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 92440 event pairs, 59 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7686. Up to 284 conditions per place. [2025-03-08 22:05:51,044 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-03-08 22:05:51,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-03-08 22:05:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:51,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:51,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-08 22:05:51,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-08 22:05:51,046 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3231 transitions. [2025-03-08 22:05:51,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-03-08 22:05:51,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:51,055 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-03-08 22:05:51,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2025-03-08 22:05:51,056 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -86 predicate places. [2025-03-08 22:05:51,056 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-03-08 22:05:51,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 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-08 22:05:51,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:51,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:51,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-08 22:05:51,057 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:51,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1729275389, now seen corresponding path program 1 times [2025-03-08 22:05:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:51,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131817201] [2025-03-08 22:05:51,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:51,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 22:05:51,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 22:05:51,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:51,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:51,085 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-08 22:05:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:51,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131817201] [2025-03-08 22:05:51,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131817201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:51,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:51,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:51,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599183602] [2025-03-08 22:05:51,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:51,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:51,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:51,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:51,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-08 22:05:51,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 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-08 22:05:51,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:51,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-08 22:05:51,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:52,667 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-03-08 22:05:52,668 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-03-08 22:05:52,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 48310 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2025-03-08 22:05:52,824 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-03-08 22:05:52,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-03-08 22:05:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-08 22:05:52,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-08 22:05:52,826 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3235 transitions. [2025-03-08 22:05:52,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-03-08 22:05:52,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:52,834 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-03-08 22:05:52,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2025-03-08 22:05:52,834 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -90 predicate places. [2025-03-08 22:05:52,834 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-03-08 22:05:52,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 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-08 22:05:52,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:52,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:52,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-08 22:05:52,835 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:52,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:52,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1382690145, now seen corresponding path program 1 times [2025-03-08 22:05:52,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:52,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676239184] [2025-03-08 22:05:52,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:52,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 22:05:52,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 22:05:52,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:52,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:52,861 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-08 22:05:52,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:52,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676239184] [2025-03-08 22:05:52,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676239184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:52,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:52,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:05:52,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478795915] [2025-03-08 22:05:52,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:52,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:52,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:52,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:52,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:52,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-03-08 22:05:52,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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-08 22:05:52,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:52,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-03-08 22:05:52,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:55,233 INFO L124 PetriNetUnfolderBase]: 386/8449 cut-off events. [2025-03-08 22:05:55,233 INFO L125 PetriNetUnfolderBase]: For 37/73 co-relation queries the response was YES. [2025-03-08 22:05:55,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9048 conditions, 8449 events. 386/8449 cut-off events. For 37/73 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 77381 event pairs, 16 based on Foata normal form. 2/7129 useless extension candidates. Maximal degree in co-relation 7625. Up to 183 conditions per place. [2025-03-08 22:05:55,616 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-03-08 22:05:55,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-03-08 22:05:55,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:55,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3251 transitions. [2025-03-08 22:05:55,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753975397539754 [2025-03-08 22:05:55,617 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3251 transitions. [2025-03-08 22:05:55,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-03-08 22:05:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:05:55,626 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-03-08 22:05:55,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2025-03-08 22:05:55,627 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -88 predicate places. [2025-03-08 22:05:55,627 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-03-08 22:05:55,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 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-08 22:05:55,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:55,628 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:55,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-08 22:05:55,628 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:55,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:55,629 INFO L85 PathProgramCache]: Analyzing trace with hash 366760060, now seen corresponding path program 1 times [2025-03-08 22:05:55,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144976796] [2025-03-08 22:05:55,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:55,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-08 22:05:55,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-08 22:05:55,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:55,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:55,656 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-08 22:05:55,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:55,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144976796] [2025-03-08 22:05:55,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144976796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:55,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:55,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:55,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941672596] [2025-03-08 22:05:55,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:55,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:55,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:55,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:55,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:55,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-03-08 22:05:55,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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-08 22:05:55,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:55,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-03-08 22:05:55,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:05:58,397 INFO L124 PetriNetUnfolderBase]: 674/9720 cut-off events. [2025-03-08 22:05:58,397 INFO L125 PetriNetUnfolderBase]: For 301/368 co-relation queries the response was YES. [2025-03-08 22:05:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 9720 events. 674/9720 cut-off events. For 301/368 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 108716 event pairs, 166 based on Foata normal form. 2/8329 useless extension candidates. Maximal degree in co-relation 9620. Up to 682 conditions per place. [2025-03-08 22:05:58,881 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-03-08 22:05:58,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-03-08 22:05:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:05:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:05:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-03-08 22:05:58,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-03-08 22:05:58,882 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3211 transitions. [2025-03-08 22:05:58,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-03-08 22:05:58,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:05:58,892 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-03-08 22:05:58,892 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2025-03-08 22:05:58,893 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -93 predicate places. [2025-03-08 22:05:58,893 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-03-08 22:05:58,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 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-08 22:05:58,893 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:05:58,893 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:05:58,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-08 22:05:58,893 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:05:58,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:05:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1282415306, now seen corresponding path program 1 times [2025-03-08 22:05:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:05:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939885320] [2025-03-08 22:05:58,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:05:58,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:05:58,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 22:05:58,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 22:05:58,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:05:58,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:58,919 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-08 22:05:58,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939885320] [2025-03-08 22:05:58,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939885320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:05:58,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:05:58,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:05:58,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021670404] [2025-03-08 22:05:58,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:05:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:05:58,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:05:58,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:05:58,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:05:58,962 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-03-08 22:05:58,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 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-08 22:05:58,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:05:58,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-03-08 22:05:58,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:01,743 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-03-08 22:06:01,744 INFO L125 PetriNetUnfolderBase]: For 903/986 co-relation queries the response was YES. [2025-03-08 22:06:02,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 903/986 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 112713 event pairs, 190 based on Foata normal form. 2/8817 useless extension candidates. Maximal degree in co-relation 10496. Up to 585 conditions per place. [2025-03-08 22:06:02,215 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-03-08 22:06:02,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-03-08 22:06:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-03-08 22:06:02,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-03-08 22:06:02,217 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3231 transitions. [2025-03-08 22:06:02,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-03-08 22:06:02,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:02,228 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-03-08 22:06:02,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2025-03-08 22:06:02,229 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -94 predicate places. [2025-03-08 22:06:02,229 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-03-08 22:06:02,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 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-08 22:06:02,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:02,230 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:02,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-08 22:06:02,230 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:06:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:02,230 INFO L85 PathProgramCache]: Analyzing trace with hash -58656648, now seen corresponding path program 1 times [2025-03-08 22:06:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:02,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770839368] [2025-03-08 22:06:02,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:02,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:02,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 22:06:02,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 22:06:02,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:02,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:02,255 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-08 22:06:02,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:02,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770839368] [2025-03-08 22:06:02,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770839368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:02,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:02,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:02,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171301582] [2025-03-08 22:06:02,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:02,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:02,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:02,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:02,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:02,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-03-08 22:06:02,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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-08 22:06:02,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:02,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-03-08 22:06:02,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:06:05,095 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-03-08 22:06:05,096 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-03-08 22:06:05,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 92082 event pairs, 11 based on Foata normal form. 0/7728 useless extension candidates. Maximal degree in co-relation 7688. Up to 204 conditions per place. [2025-03-08 22:06:05,596 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-03-08 22:06:05,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-03-08 22:06:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:06:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:06:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-03-08 22:06:05,598 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-03-08 22:06:05,598 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3235 transitions. [2025-03-08 22:06:05,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-03-08 22:06:05,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:06:05,608 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-03-08 22:06:05,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2025-03-08 22:06:05,608 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -98 predicate places. [2025-03-08 22:06:05,609 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-03-08 22:06:05,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 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-08 22:06:05,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:06:05,609 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:06:05,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-08 22:06:05,609 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err30ASSERT_VIOLATIONDATA_RACE === [thread1Err42ASSERT_VIOLATIONDATA_RACE, thread1Err41ASSERT_VIOLATIONDATA_RACE, thread1Err40ASSERT_VIOLATIONDATA_RACE, thread1Err39ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-03-08 22:06:05,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:06:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 37283626, now seen corresponding path program 1 times [2025-03-08 22:06:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:06:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108559533] [2025-03-08 22:06:05,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:06:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:06:05,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 22:06:05,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 22:06:05,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:06:05,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:06:05,641 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-08 22:06:05,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:06:05,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108559533] [2025-03-08 22:06:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108559533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:06:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:06:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:06:05,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775912747] [2025-03-08 22:06:05,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:06:05,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:06:05,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:06:05,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:06:05,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:06:05,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-03-08 22:06:05,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 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-08 22:06:05,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:06:05,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-03-08 22:06:05,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand