./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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/pthread/queue_ok_longer.i -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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:56:48,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:56:48,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:56:48,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:56:48,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:56:48,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:56:48,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:56:48,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:56:48,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:56:48,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:56:48,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:56:48,877 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:56:48,877 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:56:48,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:56:48,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:56:48,879 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:48,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:56:48,879 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:56:48,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:56:48,880 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2025-03-13 21:56:49,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:56:49,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:56:49,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:56:49,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:56:49,131 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:56:49,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-13 21:56:50,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc3db74/513fc207c24d4321b2044891f29e0d2f/FLAG7faca84f7 [2025-03-13 21:56:50,565 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:56:50,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok_longer.i [2025-03-13 21:56:50,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc3db74/513fc207c24d4321b2044891f29e0d2f/FLAG7faca84f7 [2025-03-13 21:56:50,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cc3db74/513fc207c24d4321b2044891f29e0d2f [2025-03-13 21:56:50,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:56:50,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:56:50,880 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:50,880 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:56:50,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:56:50,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:50" (1/1) ... [2025-03-13 21:56:50,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158ae3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:50, skipping insertion in model container [2025-03-13 21:56:50,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:56:50" (1/1) ... [2025-03-13 21:56:50,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:56:51,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:51,298 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:56:51,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:56:51,424 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:56:51,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51 WrapperNode [2025-03-13 21:56:51,425 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:56:51,426 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:51,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:56:51,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:56:51,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,522 INFO L138 Inliner]: procedures = 274, calls = 854, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1169 [2025-03-13 21:56:51,522 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:56:51,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:56:51,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:56:51,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:56:51,530 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:56:51,598 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:56:51,598 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:56:51,598 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:56:51,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (1/1) ... [2025-03-13 21:56:51,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:56:51,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:56:51,631 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-13 21:56:51,633 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-13 21:56:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-13 21:56:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-13 21:56:51,649 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-13 21:56:51,649 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-13 21:56:51,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:56:51,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:56:51,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:56:51,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:56:51,653 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:56:51,761 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:56:51,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:56:52,881 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:56:52,882 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:56:52,882 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:56:52,935 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:56:52,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:52 BoogieIcfgContainer [2025-03-13 21:56:52,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:56:52,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:56:52,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:56:52,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:56:52,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:56:50" (1/3) ... [2025-03-13 21:56:52,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ef658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:52, skipping insertion in model container [2025-03-13 21:56:52,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:56:51" (2/3) ... [2025-03-13 21:56:52,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@291ef658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:56:52, skipping insertion in model container [2025-03-13 21:56:52,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:56:52" (3/3) ... [2025-03-13 21:56:52,947 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2025-03-13 21:56:52,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:56:52,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 1220 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-13 21:56:52,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:56:53,104 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:56:53,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1226 places, 1232 transitions, 2478 flow [2025-03-13 21:56:53,661 INFO L124 PetriNetUnfolderBase]: 13/1230 cut-off events. [2025-03-13 21:56:53,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:56:53,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 1230 events. 13/1230 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 742 event pairs, 0 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1055. Up to 3 conditions per place. [2025-03-13 21:56:53,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 1226 places, 1232 transitions, 2478 flow [2025-03-13 21:56:53,691 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1219 places, 1225 transitions, 2459 flow [2025-03-13 21:56:53,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:56:53,715 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;@2117240a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:56:53,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-13 21:56:53,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:56:53,832 INFO L124 PetriNetUnfolderBase]: 0/830 cut-off events. [2025-03-13 21:56:53,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:56:53,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:53,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:56:53,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:53,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1323852543, now seen corresponding path program 1 times [2025-03-13 21:56:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:53,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824737391] [2025-03-13 21:56:53,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:53,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:53,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 830 statements into 1 equivalence classes. [2025-03-13 21:56:54,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 830 of 830 statements. [2025-03-13 21:56:54,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:54,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:54,654 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-13 21:56:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:54,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824737391] [2025-03-13 21:56:54,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824737391] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:54,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:54,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:54,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869984953] [2025-03-13 21:56:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:54,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:54,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:54,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:54,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:54,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1207 out of 1232 [2025-03-13 21:56:54,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1219 places, 1225 transitions, 2459 flow. Second operand has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 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-13 21:56:54,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:54,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1207 of 1232 [2025-03-13 21:56:54,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:55,121 INFO L124 PetriNetUnfolderBase]: 40/1746 cut-off events. [2025-03-13 21:56:55,122 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-13 21:56:55,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1819 conditions, 1746 events. 40/1746 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4413 event pairs, 19 based on Foata normal form. 3/1641 useless extension candidates. Maximal degree in co-relation 1056. Up to 52 conditions per place. [2025-03-13 21:56:55,131 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1212 dead transitions. [2025-03-13 21:56:55,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1212 transitions, 2463 flow [2025-03-13 21:56:55,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3640 transitions. [2025-03-13 21:56:55,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9848484848484849 [2025-03-13 21:56:55,147 INFO L175 Difference]: Start difference. First operand has 1219 places, 1225 transitions, 2459 flow. Second operand 3 states and 3640 transitions. [2025-03-13 21:56:55,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1212 transitions, 2463 flow [2025-03-13 21:56:55,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1212 transitions, 2458 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 21:56:55,171 INFO L231 Difference]: Finished difference. Result has 1209 places, 1212 transitions, 2432 flow [2025-03-13 21:56:55,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2428, PETRI_DIFFERENCE_MINUEND_PLACES=1207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2432, PETRI_PLACES=1209, PETRI_TRANSITIONS=1212} [2025-03-13 21:56:55,177 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-13 21:56:55,177 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1212 transitions, 2432 flow [2025-03-13 21:56:55,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 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-13 21:56:55,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:55,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:56:55,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:56:55,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:55,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1016471969, now seen corresponding path program 1 times [2025-03-13 21:56:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:55,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042166030] [2025-03-13 21:56:55,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:55,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 835 statements into 1 equivalence classes. [2025-03-13 21:56:55,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 835 of 835 statements. [2025-03-13 21:56:55,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:55,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:55,700 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-13 21:56:55,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:55,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042166030] [2025-03-13 21:56:55,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042166030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:55,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:55,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:56:55,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944305432] [2025-03-13 21:56:55,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:55,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:56:55,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:55,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:56:55,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:56:55,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1207 out of 1232 [2025-03-13 21:56:55,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1212 transitions, 2432 flow. Second operand has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 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-13 21:56:55,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:55,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1207 of 1232 [2025-03-13 21:56:55,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:56:56,065 INFO L124 PetriNetUnfolderBase]: 43/1874 cut-off events. [2025-03-13 21:56:56,066 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:56:56,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1874 events. 43/1874 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5456 event pairs, 19 based on Foata normal form. 0/1756 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-03-13 21:56:56,072 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1211 dead transitions. [2025-03-13 21:56:56,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1211 transitions, 2460 flow [2025-03-13 21:56:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:56:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:56:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3637 transitions. [2025-03-13 21:56:56,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9840367965367965 [2025-03-13 21:56:56,080 INFO L175 Difference]: Start difference. First operand has 1209 places, 1212 transitions, 2432 flow. Second operand 3 states and 3637 transitions. [2025-03-13 21:56:56,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1211 transitions, 2460 flow [2025-03-13 21:56:56,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1211 transitions, 2456 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:56:56,097 INFO L231 Difference]: Finished difference. Result has 1208 places, 1211 transitions, 2430 flow [2025-03-13 21:56:56,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=1206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2430, PETRI_PLACES=1208, PETRI_TRANSITIONS=1211} [2025-03-13 21:56:56,100 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-13 21:56:56,101 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1211 transitions, 2430 flow [2025-03-13 21:56:56,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1208.3333333333333) internal successors, (3625), 3 states have internal predecessors, (3625), 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-13 21:56:56,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:56:56,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:56:56,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:56:56,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:56:56,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:56:56,106 INFO L85 PathProgramCache]: Analyzing trace with hash -635963254, now seen corresponding path program 1 times [2025-03-13 21:56:56,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:56:56,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604364804] [2025-03-13 21:56:56,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:56:56,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:56:56,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-03-13 21:56:56,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-03-13 21:56:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:56:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:56:59,190 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-13 21:56:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:56:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604364804] [2025-03-13 21:56:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604364804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:56:59,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:56:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:56:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948838520] [2025-03-13 21:56:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:56:59,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:56:59,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:56:59,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:56:59,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:56:59,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-13 21:56:59,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1211 transitions, 2430 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:56:59,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:56:59,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-13 21:56:59,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:02,068 INFO L124 PetriNetUnfolderBase]: 2177/9951 cut-off events. [2025-03-13 21:57:02,068 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:57:02,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14053 conditions, 9951 events. 2177/9951 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80129 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13212. Up to 4014 conditions per place. [2025-03-13 21:57:02,120 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1210 dead transitions. [2025-03-13 21:57:02,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1210 transitions, 2638 flow [2025-03-13 21:57:02,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-13 21:57:02,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-13 21:57:02,133 INFO L175 Difference]: Start difference. First operand has 1208 places, 1211 transitions, 2430 flow. Second operand 6 states and 6814 transitions. [2025-03-13 21:57:02,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1210 transitions, 2638 flow [2025-03-13 21:57:02,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1210 places, 1210 transitions, 2634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:02,149 INFO L231 Difference]: Finished difference. Result has 1210 places, 1210 transitions, 2434 flow [2025-03-13 21:57:02,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2424, PETRI_DIFFERENCE_MINUEND_PLACES=1205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2434, PETRI_PLACES=1210, PETRI_TRANSITIONS=1210} [2025-03-13 21:57:02,151 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -9 predicate places. [2025-03-13 21:57:02,151 INFO L471 AbstractCegarLoop]: Abstraction has has 1210 places, 1210 transitions, 2434 flow [2025-03-13 21:57:02,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:57:02,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:02,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:02,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:57:02,156 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:02,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -887793548, now seen corresponding path program 1 times [2025-03-13 21:57:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730610150] [2025-03-13 21:57:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:02,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:02,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 854 statements into 1 equivalence classes. [2025-03-13 21:57:02,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 854 of 854 statements. [2025-03-13 21:57:02,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:02,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:03,638 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-13 21:57:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730610150] [2025-03-13 21:57:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730610150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:03,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252655210] [2025-03-13 21:57:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:03,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:03,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:03,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:04,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-13 21:57:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1210 places, 1210 transitions, 2434 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:57:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-13 21:57:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:06,240 INFO L124 PetriNetUnfolderBase]: 2177/9950 cut-off events. [2025-03-13 21:57:06,240 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:57:06,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14055 conditions, 9950 events. 2177/9950 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80305 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13198. Up to 4014 conditions per place. [2025-03-13 21:57:06,288 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1209 dead transitions. [2025-03-13 21:57:06,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1214 places, 1209 transitions, 2642 flow [2025-03-13 21:57:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-13 21:57:06,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-13 21:57:06,297 INFO L175 Difference]: Start difference. First operand has 1210 places, 1210 transitions, 2434 flow. Second operand 6 states and 6814 transitions. [2025-03-13 21:57:06,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1214 places, 1209 transitions, 2642 flow [2025-03-13 21:57:06,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1209 transitions, 2632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:06,311 INFO L231 Difference]: Finished difference. Result has 1209 places, 1209 transitions, 2432 flow [2025-03-13 21:57:06,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2422, PETRI_DIFFERENCE_MINUEND_PLACES=1204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2432, PETRI_PLACES=1209, PETRI_TRANSITIONS=1209} [2025-03-13 21:57:06,313 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-13 21:57:06,313 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1209 transitions, 2432 flow [2025-03-13 21:57:06,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:57:06,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:06,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:57:06,317 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:06,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:06,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1088119195, now seen corresponding path program 1 times [2025-03-13 21:57:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704751347] [2025-03-13 21:57:06,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:06,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:06,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 862 statements into 1 equivalence classes. [2025-03-13 21:57:06,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 862 of 862 statements. [2025-03-13 21:57:06,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:06,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:07,772 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-13 21:57:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:07,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704751347] [2025-03-13 21:57:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704751347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:07,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:07,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:07,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920551638] [2025-03-13 21:57:07,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:07,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:07,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:07,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:07,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:08,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1118 out of 1232 [2025-03-13 21:57:08,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1209 transitions, 2432 flow. Second operand has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:57:08,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:08,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1118 of 1232 [2025-03-13 21:57:08,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:10,286 INFO L124 PetriNetUnfolderBase]: 2177/9949 cut-off events. [2025-03-13 21:57:10,286 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-13 21:57:10,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14054 conditions, 9949 events. 2177/9949 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 80107 event pairs, 1832 based on Foata normal form. 0/8995 useless extension candidates. Maximal degree in co-relation 13189. Up to 4014 conditions per place. [2025-03-13 21:57:10,326 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 100 selfloop transitions, 5 changer transitions 0/1208 dead transitions. [2025-03-13 21:57:10,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1213 places, 1208 transitions, 2640 flow [2025-03-13 21:57:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:10,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6814 transitions. [2025-03-13 21:57:10,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218073593073594 [2025-03-13 21:57:10,336 INFO L175 Difference]: Start difference. First operand has 1209 places, 1209 transitions, 2432 flow. Second operand 6 states and 6814 transitions. [2025-03-13 21:57:10,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1213 places, 1208 transitions, 2640 flow [2025-03-13 21:57:10,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1208 transitions, 2630 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:10,351 INFO L231 Difference]: Finished difference. Result has 1208 places, 1208 transitions, 2430 flow [2025-03-13 21:57:10,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2420, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2430, PETRI_PLACES=1208, PETRI_TRANSITIONS=1208} [2025-03-13 21:57:10,353 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-13 21:57:10,353 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1208 transitions, 2430 flow [2025-03-13 21:57:10,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1119.3333333333333) internal successors, (6716), 6 states have internal predecessors, (6716), 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-13 21:57:10,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:10,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:10,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:57:10,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:10,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -509437694, now seen corresponding path program 1 times [2025-03-13 21:57:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:10,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030234385] [2025-03-13 21:57:10,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:10,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:10,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 875 statements into 1 equivalence classes. [2025-03-13 21:57:10,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 875 of 875 statements. [2025-03-13 21:57:10,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:10,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:57:11,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:11,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030234385] [2025-03-13 21:57:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030234385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231724313] [2025-03-13 21:57:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:11,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:11,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:12,652 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-13 21:57:12,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1208 transitions, 2430 flow. Second operand has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 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-13 21:57:12,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:12,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-13 21:57:12,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:13,587 INFO L124 PetriNetUnfolderBase]: 513/5691 cut-off events. [2025-03-13 21:57:13,587 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:57:13,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 5691 events. 513/5691 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39264 event pairs, 344 based on Foata normal form. 0/5106 useless extension candidates. Maximal degree in co-relation 5689. Up to 822 conditions per place. [2025-03-13 21:57:13,611 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 54 selfloop transitions, 5 changer transitions 0/1207 dead transitions. [2025-03-13 21:57:13,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1207 transitions, 2546 flow [2025-03-13 21:57:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7044 transitions. [2025-03-13 21:57:13,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952922077922078 [2025-03-13 21:57:13,618 INFO L175 Difference]: Start difference. First operand has 1208 places, 1208 transitions, 2430 flow. Second operand 6 states and 7044 transitions. [2025-03-13 21:57:13,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1207 transitions, 2546 flow [2025-03-13 21:57:13,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1207 transitions, 2536 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:13,629 INFO L231 Difference]: Finished difference. Result has 1207 places, 1207 transitions, 2428 flow [2025-03-13 21:57:13,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2418, PETRI_DIFFERENCE_MINUEND_PLACES=1202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2428, PETRI_PLACES=1207, PETRI_TRANSITIONS=1207} [2025-03-13 21:57:13,631 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-13 21:57:13,631 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1207 transitions, 2428 flow [2025-03-13 21:57:13,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 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-13 21:57:13,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:13,634 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:13,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:57:13,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:13,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 155403673, now seen corresponding path program 1 times [2025-03-13 21:57:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849896450] [2025-03-13 21:57:13,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:13,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-03-13 21:57:13,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-03-13 21:57:13,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:13,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:15,242 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-13 21:57:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:15,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849896450] [2025-03-13 21:57:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849896450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:15,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:15,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:15,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810016244] [2025-03-13 21:57:15,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:15,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:15,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:15,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:15,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-13 21:57:15,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1207 transitions, 2428 flow. Second operand has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 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-13 21:57:15,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:15,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-13 21:57:15,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:17,348 INFO L124 PetriNetUnfolderBase]: 513/5690 cut-off events. [2025-03-13 21:57:17,348 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-13 21:57:17,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6571 conditions, 5690 events. 513/5690 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 39388 event pairs, 344 based on Foata normal form. 0/5106 useless extension candidates. Maximal degree in co-relation 5650. Up to 822 conditions per place. [2025-03-13 21:57:17,375 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 54 selfloop transitions, 5 changer transitions 0/1206 dead transitions. [2025-03-13 21:57:17,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1206 transitions, 2544 flow [2025-03-13 21:57:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:17,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7044 transitions. [2025-03-13 21:57:17,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.952922077922078 [2025-03-13 21:57:17,385 INFO L175 Difference]: Start difference. First operand has 1207 places, 1207 transitions, 2428 flow. Second operand 6 states and 7044 transitions. [2025-03-13 21:57:17,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1206 transitions, 2544 flow [2025-03-13 21:57:17,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1206 places, 1206 transitions, 2534 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:17,398 INFO L231 Difference]: Finished difference. Result has 1206 places, 1206 transitions, 2426 flow [2025-03-13 21:57:17,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2426, PETRI_PLACES=1206, PETRI_TRANSITIONS=1206} [2025-03-13 21:57:17,400 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -13 predicate places. [2025-03-13 21:57:17,400 INFO L471 AbstractCegarLoop]: Abstraction has has 1206 places, 1206 transitions, 2426 flow [2025-03-13 21:57:17,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1167.1666666666667) internal successors, (7003), 6 states have internal predecessors, (7003), 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-13 21:57:17,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:17,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:17,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:57:17,403 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:17,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:17,404 INFO L85 PathProgramCache]: Analyzing trace with hash -693478345, now seen corresponding path program 1 times [2025-03-13 21:57:17,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:17,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92689581] [2025-03-13 21:57:17,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:17,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:17,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 903 statements into 1 equivalence classes. [2025-03-13 21:57:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 903 of 903 statements. [2025-03-13 21:57:17,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:17,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:17,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:57:17,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:17,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92689581] [2025-03-13 21:57:17,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92689581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:17,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:17,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:17,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474503772] [2025-03-13 21:57:17,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:17,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:17,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:17,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:17,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:17,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1211 out of 1232 [2025-03-13 21:57:17,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1206 places, 1206 transitions, 2426 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:57:17,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:17,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1211 of 1232 [2025-03-13 21:57:17,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:17,900 INFO L124 PetriNetUnfolderBase]: 53/1798 cut-off events. [2025-03-13 21:57:17,900 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:57:17,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 1798 events. 53/1798 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4907 event pairs, 14 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 1006. Up to 56 conditions per place. [2025-03-13 21:57:17,904 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 17 selfloop transitions, 4 changer transitions 0/1214 dead transitions. [2025-03-13 21:57:17,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1208 places, 1214 transitions, 2487 flow [2025-03-13 21:57:17,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-13 21:57:17,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-13 21:57:17,908 INFO L175 Difference]: Start difference. First operand has 1206 places, 1206 transitions, 2426 flow. Second operand 3 states and 3655 transitions. [2025-03-13 21:57:17,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1208 places, 1214 transitions, 2487 flow [2025-03-13 21:57:17,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1203 places, 1214 transitions, 2477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:17,922 INFO L231 Difference]: Finished difference. Result has 1205 places, 1209 transitions, 2446 flow [2025-03-13 21:57:17,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2416, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2446, PETRI_PLACES=1205, PETRI_TRANSITIONS=1209} [2025-03-13 21:57:17,924 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -14 predicate places. [2025-03-13 21:57:17,924 INFO L471 AbstractCegarLoop]: Abstraction has has 1205 places, 1209 transitions, 2446 flow [2025-03-13 21:57:17,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:57:17,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:17,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:17,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:57:17,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1468023787, now seen corresponding path program 1 times [2025-03-13 21:57:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396094] [2025-03-13 21:57:17,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:17,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:17,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 908 statements into 1 equivalence classes. [2025-03-13 21:57:17,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 908 of 908 statements. [2025-03-13 21:57:17,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:17,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-13 21:57:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396094] [2025-03-13 21:57:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:18,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391484259] [2025-03-13 21:57:18,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:18,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:18,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:18,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1211 out of 1232 [2025-03-13 21:57:18,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1205 places, 1209 transitions, 2446 flow. Second operand has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 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-13 21:57:18,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:18,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1211 of 1232 [2025-03-13 21:57:18,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:18,515 INFO L124 PetriNetUnfolderBase]: 96/2861 cut-off events. [2025-03-13 21:57:18,515 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-13 21:57:18,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 2861 events. 96/2861 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13701 event pairs, 22 based on Foata normal form. 0/2638 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-03-13 21:57:18,524 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 16 selfloop transitions, 4 changer transitions 0/1216 dead transitions. [2025-03-13 21:57:18,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1207 places, 1216 transitions, 2501 flow [2025-03-13 21:57:18,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3654 transitions. [2025-03-13 21:57:18,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9886363636363636 [2025-03-13 21:57:18,528 INFO L175 Difference]: Start difference. First operand has 1205 places, 1209 transitions, 2446 flow. Second operand 3 states and 3654 transitions. [2025-03-13 21:57:18,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1207 places, 1216 transitions, 2501 flow [2025-03-13 21:57:18,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1205 places, 1216 transitions, 2493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:18,540 INFO L231 Difference]: Finished difference. Result has 1207 places, 1212 transitions, 2468 flow [2025-03-13 21:57:18,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2438, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2468, PETRI_PLACES=1207, PETRI_TRANSITIONS=1212} [2025-03-13 21:57:18,542 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-13 21:57:18,542 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1212 transitions, 2468 flow [2025-03-13 21:57:18,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1213.0) internal successors, (3639), 3 states have internal predecessors, (3639), 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-13 21:57:18,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:18,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:18,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:57:18,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash -199966866, now seen corresponding path program 1 times [2025-03-13 21:57:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355065091] [2025-03-13 21:57:18,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:18,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:18,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 910 statements into 1 equivalence classes. [2025-03-13 21:57:18,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 910 of 910 statements. [2025-03-13 21:57:18,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:18,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:18,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:18,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355065091] [2025-03-13 21:57:18,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355065091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:18,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:18,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614699008] [2025-03-13 21:57:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:18,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:18,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:18,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1213 out of 1232 [2025-03-13 21:57:18,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1212 transitions, 2468 flow. Second operand has 3 states, 3 states have (on average 1214.6666666666667) internal successors, (3644), 3 states have internal predecessors, (3644), 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-13 21:57:18,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:18,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1213 of 1232 [2025-03-13 21:57:18,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:19,246 INFO L124 PetriNetUnfolderBase]: 81/2937 cut-off events. [2025-03-13 21:57:19,246 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-13 21:57:19,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 2937 events. 81/2937 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12370 event pairs, 33 based on Foata normal form. 7/2730 useless extension candidates. Maximal degree in co-relation 1934. Up to 103 conditions per place. [2025-03-13 21:57:19,260 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1216 dead transitions. [2025-03-13 21:57:19,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 1216 transitions, 2508 flow [2025-03-13 21:57:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:19,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-13 21:57:19,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-13 21:57:19,263 INFO L175 Difference]: Start difference. First operand has 1207 places, 1212 transitions, 2468 flow. Second operand 3 states and 3655 transitions. [2025-03-13 21:57:19,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 1216 transitions, 2508 flow [2025-03-13 21:57:19,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1216 transitions, 2500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:19,276 INFO L231 Difference]: Finished difference. Result has 1208 places, 1213 transitions, 2472 flow [2025-03-13 21:57:19,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2460, PETRI_DIFFERENCE_MINUEND_PLACES=1205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2472, PETRI_PLACES=1208, PETRI_TRANSITIONS=1213} [2025-03-13 21:57:19,278 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-13 21:57:19,278 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1213 transitions, 2472 flow [2025-03-13 21:57:19,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1214.6666666666667) internal successors, (3644), 3 states have internal predecessors, (3644), 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-13 21:57:19,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:19,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:19,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:57:19,279 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:19,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:19,281 INFO L85 PathProgramCache]: Analyzing trace with hash -980050692, now seen corresponding path program 1 times [2025-03-13 21:57:19,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143940497] [2025-03-13 21:57:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:19,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 915 statements into 1 equivalence classes. [2025-03-13 21:57:19,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 915 of 915 statements. [2025-03-13 21:57:19,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:19,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143940497] [2025-03-13 21:57:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143940497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622286691] [2025-03-13 21:57:19,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:19,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:19,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:19,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:19,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:19,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1213 out of 1232 [2025-03-13 21:57:19,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1213 transitions, 2472 flow. Second operand has 3 states, 3 states have (on average 1215.0) internal successors, (3645), 3 states have internal predecessors, (3645), 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-13 21:57:19,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:19,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1213 of 1232 [2025-03-13 21:57:19,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:20,328 INFO L124 PetriNetUnfolderBase]: 136/4585 cut-off events. [2025-03-13 21:57:20,329 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-13 21:57:20,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 4585 events. 136/4585 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26317 event pairs, 40 based on Foata normal form. 9/4194 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-03-13 21:57:20,354 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 13 selfloop transitions, 2 changer transitions 0/1217 dead transitions. [2025-03-13 21:57:20,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1217 transitions, 2511 flow [2025-03-13 21:57:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3655 transitions. [2025-03-13 21:57:20,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9889069264069265 [2025-03-13 21:57:20,358 INFO L175 Difference]: Start difference. First operand has 1208 places, 1213 transitions, 2472 flow. Second operand 3 states and 3655 transitions. [2025-03-13 21:57:20,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1217 transitions, 2511 flow [2025-03-13 21:57:20,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1217 transitions, 2509 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:20,371 INFO L231 Difference]: Finished difference. Result has 1210 places, 1214 transitions, 2482 flow [2025-03-13 21:57:20,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=1207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2482, PETRI_PLACES=1210, PETRI_TRANSITIONS=1214} [2025-03-13 21:57:20,373 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -9 predicate places. [2025-03-13 21:57:20,373 INFO L471 AbstractCegarLoop]: Abstraction has has 1210 places, 1214 transitions, 2482 flow [2025-03-13 21:57:20,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1215.0) internal successors, (3645), 3 states have internal predecessors, (3645), 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-13 21:57:20,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:20,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:57:20,374 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:20,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 519161698, now seen corresponding path program 1 times [2025-03-13 21:57:20,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:20,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979698912] [2025-03-13 21:57:20,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:20,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:20,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-13 21:57:20,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-13 21:57:20,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:20,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:20,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979698912] [2025-03-13 21:57:20,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979698912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:20,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:20,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:20,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114092940] [2025-03-13 21:57:20,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:20,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:20,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:20,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:20,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:20,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1212 out of 1232 [2025-03-13 21:57:20,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1210 places, 1214 transitions, 2482 flow. Second operand has 3 states, 3 states have (on average 1214.0) internal successors, (3642), 3 states have internal predecessors, (3642), 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-13 21:57:20,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:20,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1212 of 1232 [2025-03-13 21:57:20,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:21,364 INFO L124 PetriNetUnfolderBase]: 86/3627 cut-off events. [2025-03-13 21:57:21,364 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 21:57:21,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 3627 events. 86/3627 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 17510 event pairs, 17 based on Foata normal form. 4/3343 useless extension candidates. Maximal degree in co-relation 2617. Up to 41 conditions per place. [2025-03-13 21:57:21,374 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 14 selfloop transitions, 3 changer transitions 0/1215 dead transitions. [2025-03-13 21:57:21,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1215 transitions, 2513 flow [2025-03-13 21:57:21,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3654 transitions. [2025-03-13 21:57:21,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9886363636363636 [2025-03-13 21:57:21,378 INFO L175 Difference]: Start difference. First operand has 1210 places, 1214 transitions, 2482 flow. Second operand 3 states and 3654 transitions. [2025-03-13 21:57:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1215 transitions, 2513 flow [2025-03-13 21:57:21,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1215 transitions, 2503 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:57:21,390 INFO L231 Difference]: Finished difference. Result has 1209 places, 1210 transitions, 2467 flow [2025-03-13 21:57:21,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2456, PETRI_DIFFERENCE_MINUEND_PLACES=1206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2467, PETRI_PLACES=1209, PETRI_TRANSITIONS=1210} [2025-03-13 21:57:21,392 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-13 21:57:21,392 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1210 transitions, 2467 flow [2025-03-13 21:57:21,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1214.0) internal successors, (3642), 3 states have internal predecessors, (3642), 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-13 21:57:21,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:21,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:21,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:57:21,393 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 184100842, now seen corresponding path program 1 times [2025-03-13 21:57:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396803794] [2025-03-13 21:57:21,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:21,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 921 statements into 1 equivalence classes. [2025-03-13 21:57:21,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 921 of 921 statements. [2025-03-13 21:57:21,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:21,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396803794] [2025-03-13 21:57:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396803794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:22,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537910464] [2025-03-13 21:57:22,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:22,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:22,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:22,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:23,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1154 out of 1232 [2025-03-13 21:57:23,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1210 transitions, 2467 flow. Second operand has 6 states, 6 states have (on average 1157.5) internal successors, (6945), 6 states have internal predecessors, (6945), 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-13 21:57:23,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:23,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1154 of 1232 [2025-03-13 21:57:23,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:23,843 INFO L124 PetriNetUnfolderBase]: 387/3658 cut-off events. [2025-03-13 21:57:23,843 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2025-03-13 21:57:23,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4703 conditions, 3658 events. 387/3658 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 17360 event pairs, 244 based on Foata normal form. 0/3420 useless extension candidates. Maximal degree in co-relation 3161. Up to 603 conditions per place. [2025-03-13 21:57:23,853 INFO L140 encePairwiseOnDemand]: 1218/1232 looper letters, 68 selfloop transitions, 11 changer transitions 0/1219 dead transitions. [2025-03-13 21:57:23,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1219 transitions, 2651 flow [2025-03-13 21:57:23,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7006 transitions. [2025-03-13 21:57:23,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9477813852813853 [2025-03-13 21:57:23,858 INFO L175 Difference]: Start difference. First operand has 1209 places, 1210 transitions, 2467 flow. Second operand 6 states and 7006 transitions. [2025-03-13 21:57:23,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1219 transitions, 2651 flow [2025-03-13 21:57:23,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1209 places, 1219 transitions, 2645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:23,870 INFO L231 Difference]: Finished difference. Result has 1209 places, 1207 transitions, 2477 flow [2025-03-13 21:57:23,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2455, PETRI_DIFFERENCE_MINUEND_PLACES=1204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2477, PETRI_PLACES=1209, PETRI_TRANSITIONS=1207} [2025-03-13 21:57:23,872 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -10 predicate places. [2025-03-13 21:57:23,872 INFO L471 AbstractCegarLoop]: Abstraction has has 1209 places, 1207 transitions, 2477 flow [2025-03-13 21:57:23,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1157.5) internal successors, (6945), 6 states have internal predecessors, (6945), 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-13 21:57:23,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:23,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:23,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:57:23,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:23,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:23,875 INFO L85 PathProgramCache]: Analyzing trace with hash 28383803, now seen corresponding path program 1 times [2025-03-13 21:57:23,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:23,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155243866] [2025-03-13 21:57:23,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:23,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 928 statements into 1 equivalence classes. [2025-03-13 21:57:23,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 928 of 928 statements. [2025-03-13 21:57:23,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:23,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155243866] [2025-03-13 21:57:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155243866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160229161] [2025-03-13 21:57:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:25,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:25,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:25,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:25,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1108 out of 1232 [2025-03-13 21:57:25,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1209 places, 1207 transitions, 2477 flow. Second operand has 6 states, 6 states have (on average 1113.8333333333333) internal successors, (6683), 6 states have internal predecessors, (6683), 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-13 21:57:25,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:25,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1108 of 1232 [2025-03-13 21:57:25,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:26,320 INFO L124 PetriNetUnfolderBase]: 693/4197 cut-off events. [2025-03-13 21:57:26,321 INFO L125 PetriNetUnfolderBase]: For 210/210 co-relation queries the response was YES. [2025-03-13 21:57:26,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6105 conditions, 4197 events. 693/4197 cut-off events. For 210/210 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23963 event pairs, 604 based on Foata normal form. 0/3934 useless extension candidates. Maximal degree in co-relation 4457. Up to 1497 conditions per place. [2025-03-13 21:57:26,331 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 122 selfloop transitions, 5 changer transitions 0/1218 dead transitions. [2025-03-13 21:57:26,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1213 places, 1218 transitions, 2761 flow [2025-03-13 21:57:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6776 transitions. [2025-03-13 21:57:26,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-03-13 21:57:26,335 INFO L175 Difference]: Start difference. First operand has 1209 places, 1207 transitions, 2477 flow. Second operand 6 states and 6776 transitions. [2025-03-13 21:57:26,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1213 places, 1218 transitions, 2761 flow [2025-03-13 21:57:26,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1208 places, 1218 transitions, 2739 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:26,346 INFO L231 Difference]: Finished difference. Result has 1208 places, 1206 transitions, 2463 flow [2025-03-13 21:57:26,347 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=1203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2463, PETRI_PLACES=1208, PETRI_TRANSITIONS=1206} [2025-03-13 21:57:26,348 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -11 predicate places. [2025-03-13 21:57:26,348 INFO L471 AbstractCegarLoop]: Abstraction has has 1208 places, 1206 transitions, 2463 flow [2025-03-13 21:57:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1113.8333333333333) internal successors, (6683), 6 states have internal predecessors, (6683), 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-13 21:57:26,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:26,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:26,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:57:26,349 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:26,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash 320195647, now seen corresponding path program 1 times [2025-03-13 21:57:26,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024430547] [2025-03-13 21:57:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-03-13 21:57:26,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-03-13 21:57:26,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:26,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:27,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:27,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:27,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024430547] [2025-03-13 21:57:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024430547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:27,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:27,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496467973] [2025-03-13 21:57:27,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:27,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:27,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:27,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:27,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:28,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1171 out of 1232 [2025-03-13 21:57:28,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1208 places, 1206 transitions, 2463 flow. Second operand has 6 states, 6 states have (on average 1175.1666666666667) internal successors, (7051), 6 states have internal predecessors, (7051), 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-13 21:57:28,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:28,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1171 of 1232 [2025-03-13 21:57:28,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:28,819 INFO L124 PetriNetUnfolderBase]: 297/3552 cut-off events. [2025-03-13 21:57:28,820 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-13 21:57:28,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4356 conditions, 3552 events. 297/3552 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16326 event pairs, 214 based on Foata normal form. 0/3322 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-03-13 21:57:28,831 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 59 selfloop transitions, 5 changer transitions 0/1217 dead transitions. [2025-03-13 21:57:28,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1212 places, 1217 transitions, 2621 flow [2025-03-13 21:57:28,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:28,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7091 transitions. [2025-03-13 21:57:28,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959280303030303 [2025-03-13 21:57:28,834 INFO L175 Difference]: Start difference. First operand has 1208 places, 1206 transitions, 2463 flow. Second operand 6 states and 7091 transitions. [2025-03-13 21:57:28,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1212 places, 1217 transitions, 2621 flow [2025-03-13 21:57:28,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1207 places, 1217 transitions, 2611 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:28,845 INFO L231 Difference]: Finished difference. Result has 1207 places, 1205 transitions, 2461 flow [2025-03-13 21:57:28,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2451, PETRI_DIFFERENCE_MINUEND_PLACES=1202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2461, PETRI_PLACES=1207, PETRI_TRANSITIONS=1205} [2025-03-13 21:57:28,847 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -12 predicate places. [2025-03-13 21:57:28,847 INFO L471 AbstractCegarLoop]: Abstraction has has 1207 places, 1205 transitions, 2461 flow [2025-03-13 21:57:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1175.1666666666667) internal successors, (7051), 6 states have internal predecessors, (7051), 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-13 21:57:28,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:28,848 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:28,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:57:28,848 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:28,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash -107245885, now seen corresponding path program 1 times [2025-03-13 21:57:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829557008] [2025-03-13 21:57:28,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:28,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:28,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 944 statements into 1 equivalence classes. [2025-03-13 21:57:28,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 944 of 944 statements. [2025-03-13 21:57:28,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:28,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:30,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829557008] [2025-03-13 21:57:30,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829557008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:30,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271617647] [2025-03-13 21:57:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:30,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:30,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:30,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:30,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1129 out of 1232 [2025-03-13 21:57:30,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 1205 transitions, 2461 flow. Second operand has 6 states, 6 states have (on average 1135.5) internal successors, (6813), 6 states have internal predecessors, (6813), 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-13 21:57:30,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:30,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1129 of 1232 [2025-03-13 21:57:30,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:31,396 INFO L124 PetriNetUnfolderBase]: 567/4055 cut-off events. [2025-03-13 21:57:31,396 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-13 21:57:31,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5537 conditions, 4055 events. 567/4055 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 22548 event pairs, 478 based on Foata normal form. 0/3808 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-03-13 21:57:31,408 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 101 selfloop transitions, 5 changer transitions 0/1216 dead transitions. [2025-03-13 21:57:31,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1211 places, 1216 transitions, 2703 flow [2025-03-13 21:57:31,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6881 transitions. [2025-03-13 21:57:31,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9308712121212122 [2025-03-13 21:57:31,412 INFO L175 Difference]: Start difference. First operand has 1207 places, 1205 transitions, 2461 flow. Second operand 6 states and 6881 transitions. [2025-03-13 21:57:31,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1211 places, 1216 transitions, 2703 flow [2025-03-13 21:57:31,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1206 places, 1216 transitions, 2693 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:31,422 INFO L231 Difference]: Finished difference. Result has 1206 places, 1204 transitions, 2459 flow [2025-03-13 21:57:31,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=1201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2459, PETRI_PLACES=1206, PETRI_TRANSITIONS=1204} [2025-03-13 21:57:31,423 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -13 predicate places. [2025-03-13 21:57:31,424 INFO L471 AbstractCegarLoop]: Abstraction has has 1206 places, 1204 transitions, 2459 flow [2025-03-13 21:57:31,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1135.5) internal successors, (6813), 6 states have internal predecessors, (6813), 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-13 21:57:31,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:31,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:31,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:57:31,425 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:31,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:31,427 INFO L85 PathProgramCache]: Analyzing trace with hash 15389586, now seen corresponding path program 1 times [2025-03-13 21:57:31,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:31,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610004805] [2025-03-13 21:57:31,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:31,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 962 statements into 1 equivalence classes. [2025-03-13 21:57:31,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 962 of 962 statements. [2025-03-13 21:57:31,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:31,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-13 21:57:32,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610004805] [2025-03-13 21:57:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610004805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841015199] [2025-03-13 21:57:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:32,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:32,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:33,113 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1114 out of 1232 [2025-03-13 21:57:33,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1206 places, 1204 transitions, 2459 flow. Second operand has 6 states, 6 states have (on average 1121.3333333333333) internal successors, (6728), 6 states have internal predecessors, (6728), 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-13 21:57:33,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:33,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1114 of 1232 [2025-03-13 21:57:33,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:33,749 INFO L124 PetriNetUnfolderBase]: 657/4137 cut-off events. [2025-03-13 21:57:33,749 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-13 21:57:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5889 conditions, 4137 events. 657/4137 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23488 event pairs, 568 based on Foata normal form. 0/3906 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-03-13 21:57:33,759 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 116 selfloop transitions, 5 changer transitions 0/1215 dead transitions. [2025-03-13 21:57:33,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1210 places, 1215 transitions, 2731 flow [2025-03-13 21:57:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:33,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6806 transitions. [2025-03-13 21:57:33,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207251082251082 [2025-03-13 21:57:33,763 INFO L175 Difference]: Start difference. First operand has 1206 places, 1204 transitions, 2459 flow. Second operand 6 states and 6806 transitions. [2025-03-13 21:57:33,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1210 places, 1215 transitions, 2731 flow [2025-03-13 21:57:33,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1205 places, 1215 transitions, 2721 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:33,772 INFO L231 Difference]: Finished difference. Result has 1205 places, 1203 transitions, 2457 flow [2025-03-13 21:57:33,773 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2447, PETRI_DIFFERENCE_MINUEND_PLACES=1200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2457, PETRI_PLACES=1205, PETRI_TRANSITIONS=1203} [2025-03-13 21:57:33,774 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -14 predicate places. [2025-03-13 21:57:33,774 INFO L471 AbstractCegarLoop]: Abstraction has has 1205 places, 1203 transitions, 2457 flow [2025-03-13 21:57:33,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1121.3333333333333) internal successors, (6728), 6 states have internal predecessors, (6728), 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-13 21:57:33,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:33,775 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:33,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:57:33,776 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:33,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1839927053, now seen corresponding path program 1 times [2025-03-13 21:57:33,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:33,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854448307] [2025-03-13 21:57:33,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:33,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:33,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-03-13 21:57:33,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-03-13 21:57:33,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:33,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-13 21:57:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854448307] [2025-03-13 21:57:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854448307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:35,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:35,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128456596] [2025-03-13 21:57:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:35,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:35,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:35,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:35,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:35,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1114 out of 1232 [2025-03-13 21:57:35,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1205 places, 1203 transitions, 2457 flow. Second operand has 6 states, 6 states have (on average 1122.1666666666667) internal successors, (6733), 6 states have internal predecessors, (6733), 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-13 21:57:35,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:35,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1114 of 1232 [2025-03-13 21:57:35,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:36,318 INFO L124 PetriNetUnfolderBase]: 651/4123 cut-off events. [2025-03-13 21:57:36,318 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-13 21:57:36,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5865 conditions, 4123 events. 651/4123 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23215 event pairs, 562 based on Foata normal form. 0/3892 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-03-13 21:57:36,330 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 116 selfloop transitions, 5 changer transitions 0/1214 dead transitions. [2025-03-13 21:57:36,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1209 places, 1214 transitions, 2729 flow [2025-03-13 21:57:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6806 transitions. [2025-03-13 21:57:36,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207251082251082 [2025-03-13 21:57:36,333 INFO L175 Difference]: Start difference. First operand has 1205 places, 1203 transitions, 2457 flow. Second operand 6 states and 6806 transitions. [2025-03-13 21:57:36,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1209 places, 1214 transitions, 2729 flow [2025-03-13 21:57:36,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1204 places, 1214 transitions, 2719 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:36,344 INFO L231 Difference]: Finished difference. Result has 1204 places, 1202 transitions, 2455 flow [2025-03-13 21:57:36,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2445, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2455, PETRI_PLACES=1204, PETRI_TRANSITIONS=1202} [2025-03-13 21:57:36,346 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -15 predicate places. [2025-03-13 21:57:36,346 INFO L471 AbstractCegarLoop]: Abstraction has has 1204 places, 1202 transitions, 2455 flow [2025-03-13 21:57:36,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1122.1666666666667) internal successors, (6733), 6 states have internal predecessors, (6733), 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-13 21:57:36,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:36,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:36,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:57:36,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1501437567, now seen corresponding path program 1 times [2025-03-13 21:57:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920193761] [2025-03-13 21:57:36,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:36,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:36,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 976 statements into 1 equivalence classes. [2025-03-13 21:57:36,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 976 of 976 statements. [2025-03-13 21:57:36,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:36,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-13 21:57:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920193761] [2025-03-13 21:57:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920193761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:37,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:37,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:37,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237199168] [2025-03-13 21:57:37,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:37,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:37,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:37,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:39,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1109 out of 1232 [2025-03-13 21:57:39,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1204 places, 1202 transitions, 2455 flow. Second operand has 6 states, 6 states have (on average 1118.1666666666667) internal successors, (6709), 6 states have internal predecessors, (6709), 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-13 21:57:39,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:39,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1109 of 1232 [2025-03-13 21:57:39,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:40,029 INFO L124 PetriNetUnfolderBase]: 672/4139 cut-off events. [2025-03-13 21:57:40,030 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-13 21:57:40,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5941 conditions, 4139 events. 672/4139 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 23348 event pairs, 583 based on Foata normal form. 0/3914 useless extension candidates. Maximal degree in co-relation 5734. Up to 1453 conditions per place. [2025-03-13 21:57:40,041 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 122 selfloop transitions, 5 changer transitions 0/1213 dead transitions. [2025-03-13 21:57:40,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1208 places, 1213 transitions, 2739 flow [2025-03-13 21:57:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:40,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6781 transitions. [2025-03-13 21:57:40,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9173430735930735 [2025-03-13 21:57:40,044 INFO L175 Difference]: Start difference. First operand has 1204 places, 1202 transitions, 2455 flow. Second operand 6 states and 6781 transitions. [2025-03-13 21:57:40,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1208 places, 1213 transitions, 2739 flow [2025-03-13 21:57:40,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1203 places, 1213 transitions, 2729 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:40,054 INFO L231 Difference]: Finished difference. Result has 1203 places, 1201 transitions, 2453 flow [2025-03-13 21:57:40,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=1198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2453, PETRI_PLACES=1203, PETRI_TRANSITIONS=1201} [2025-03-13 21:57:40,055 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -16 predicate places. [2025-03-13 21:57:40,055 INFO L471 AbstractCegarLoop]: Abstraction has has 1203 places, 1201 transitions, 2453 flow [2025-03-13 21:57:40,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1118.1666666666667) internal successors, (6709), 6 states have internal predecessors, (6709), 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-13 21:57:40,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:40,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:57:40,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:40,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash 552623750, now seen corresponding path program 1 times [2025-03-13 21:57:40,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:40,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319324664] [2025-03-13 21:57:40,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:40,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-03-13 21:57:40,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-03-13 21:57:40,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-13 21:57:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319324664] [2025-03-13 21:57:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319324664] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212768540] [2025-03-13 21:57:40,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:40,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:40,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:40,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 21:57:40,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 985 statements into 1 equivalence classes. [2025-03-13 21:57:40,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 985 of 985 statements. [2025-03-13 21:57:40,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:40,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:40,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 2145 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:40,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-13 21:57:40,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212768540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:40,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:40,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677266115] [2025-03-13 21:57:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:40,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:40,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:40,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:40,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:40,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-13 21:57:40,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1203 places, 1201 transitions, 2453 flow. Second operand has 3 states, 3 states have (on average 1211.3333333333333) internal successors, (3634), 3 states have internal predecessors, (3634), 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-13 21:57:40,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:40,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-13 21:57:40,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:41,060 INFO L124 PetriNetUnfolderBase]: 64/2448 cut-off events. [2025-03-13 21:57:41,060 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-13 21:57:41,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 2448 events. 64/2448 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7498 event pairs, 29 based on Foata normal form. 0/2358 useless extension candidates. Maximal degree in co-relation 2023. Up to 79 conditions per place. [2025-03-13 21:57:41,065 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 15 selfloop transitions, 2 changer transitions 0/1203 dead transitions. [2025-03-13 21:57:41,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1204 places, 1203 transitions, 2493 flow [2025-03-13 21:57:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:41,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3645 transitions. [2025-03-13 21:57:41,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9862012987012987 [2025-03-13 21:57:41,067 INFO L175 Difference]: Start difference. First operand has 1203 places, 1201 transitions, 2453 flow. Second operand 3 states and 3645 transitions. [2025-03-13 21:57:41,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1204 places, 1203 transitions, 2493 flow [2025-03-13 21:57:41,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 1203 transitions, 2483 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:41,078 INFO L231 Difference]: Finished difference. Result has 1199 places, 1200 transitions, 2445 flow [2025-03-13 21:57:41,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=1197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2445, PETRI_PLACES=1199, PETRI_TRANSITIONS=1200} [2025-03-13 21:57:41,079 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -20 predicate places. [2025-03-13 21:57:41,079 INFO L471 AbstractCegarLoop]: Abstraction has has 1199 places, 1200 transitions, 2445 flow [2025-03-13 21:57:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1211.3333333333333) internal successors, (3634), 3 states have internal predecessors, (3634), 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-13 21:57:41,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:41,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:41,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:57:41,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:41,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:41,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash -833266834, now seen corresponding path program 1 times [2025-03-13 21:57:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:41,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108871271] [2025-03-13 21:57:41,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:41,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:41,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-13 21:57:41,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-13 21:57:41,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:41,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-13 21:57:41,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108871271] [2025-03-13 21:57:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108871271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150726613] [2025-03-13 21:57:41,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:41,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:41,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:41,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:41,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 21:57:41,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 990 statements into 1 equivalence classes. [2025-03-13 21:57:41,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 990 of 990 statements. [2025-03-13 21:57:41,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:41,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:41,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 2153 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:41,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-13 21:57:41,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:41,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150726613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:41,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:41,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:41,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397646562] [2025-03-13 21:57:41,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:41,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:41,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:41,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:41,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:41,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-13 21:57:41,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1199 places, 1200 transitions, 2445 flow. Second operand has 3 states, 3 states have (on average 1211.0) internal successors, (3633), 3 states have internal predecessors, (3633), 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-13 21:57:41,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:41,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-13 21:57:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:42,494 INFO L124 PetriNetUnfolderBase]: 136/4130 cut-off events. [2025-03-13 21:57:42,495 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-03-13 21:57:42,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4429 conditions, 4130 events. 136/4130 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22230 event pairs, 38 based on Foata normal form. 1/3876 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-03-13 21:57:42,503 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 17 selfloop transitions, 7 changer transitions 1/1208 dead transitions. [2025-03-13 21:57:42,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1208 transitions, 2519 flow [2025-03-13 21:57:42,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3650 transitions. [2025-03-13 21:57:42,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9875541125541125 [2025-03-13 21:57:42,505 INFO L175 Difference]: Start difference. First operand has 1199 places, 1200 transitions, 2445 flow. Second operand 3 states and 3650 transitions. [2025-03-13 21:57:42,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1208 transitions, 2519 flow [2025-03-13 21:57:42,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1199 places, 1208 transitions, 2515 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:42,515 INFO L231 Difference]: Finished difference. Result has 1201 places, 1205 transitions, 2497 flow [2025-03-13 21:57:42,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2441, PETRI_DIFFERENCE_MINUEND_PLACES=1197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2497, PETRI_PLACES=1201, PETRI_TRANSITIONS=1205} [2025-03-13 21:57:42,516 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -18 predicate places. [2025-03-13 21:57:42,516 INFO L471 AbstractCegarLoop]: Abstraction has has 1201 places, 1205 transitions, 2497 flow [2025-03-13 21:57:42,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1211.0) internal successors, (3633), 3 states have internal predecessors, (3633), 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-13 21:57:42,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:42,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:42,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-13 21:57:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-13 21:57:42,718 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:42,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1954362940, now seen corresponding path program 1 times [2025-03-13 21:57:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:42,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620339910] [2025-03-13 21:57:42,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:42,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:42,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-13 21:57:42,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-13 21:57:42,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:42,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:43,061 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-13 21:57:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620339910] [2025-03-13 21:57:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620339910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431050865] [2025-03-13 21:57:43,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:43,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:43,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:43,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 21:57:43,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1001 statements into 1 equivalence classes. [2025-03-13 21:57:43,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1001 of 1001 statements. [2025-03-13 21:57:43,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:43,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:43,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 2187 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:43,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:43,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-13 21:57:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-13 21:57:43,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:43,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431050865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:43,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:43,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-13 21:57:43,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187313714] [2025-03-13 21:57:43,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:43,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:43,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:43,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:43,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:43,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1215 out of 1232 [2025-03-13 21:57:43,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 1205 transitions, 2497 flow. Second operand has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 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-13 21:57:43,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:43,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1215 of 1232 [2025-03-13 21:57:43,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:43,693 INFO L124 PetriNetUnfolderBase]: 33/2188 cut-off events. [2025-03-13 21:57:43,693 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:57:43,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 2188 events. 33/2188 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5274 event pairs, 6 based on Foata normal form. 2/2116 useless extension candidates. Maximal degree in co-relation 1697. Up to 26 conditions per place. [2025-03-13 21:57:43,697 INFO L140 encePairwiseOnDemand]: 1228/1232 looper letters, 7 selfloop transitions, 3 changer transitions 5/1198 dead transitions. [2025-03-13 21:57:43,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1198 transitions, 2474 flow [2025-03-13 21:57:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3658 transitions. [2025-03-13 21:57:43,699 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9897186147186147 [2025-03-13 21:57:43,699 INFO L175 Difference]: Start difference. First operand has 1201 places, 1205 transitions, 2497 flow. Second operand 3 states and 3658 transitions. [2025-03-13 21:57:43,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1198 transitions, 2474 flow [2025-03-13 21:57:43,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1197 places, 1198 transitions, 2454 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:57:43,708 INFO L231 Difference]: Finished difference. Result has 1197 places, 1191 transitions, 2419 flow [2025-03-13 21:57:43,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2425, PETRI_DIFFERENCE_MINUEND_PLACES=1195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2419, PETRI_PLACES=1197, PETRI_TRANSITIONS=1191} [2025-03-13 21:57:43,709 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -22 predicate places. [2025-03-13 21:57:43,710 INFO L471 AbstractCegarLoop]: Abstraction has has 1197 places, 1191 transitions, 2419 flow [2025-03-13 21:57:43,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 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-13 21:57:43,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:43,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:43,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:57:43,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:43,911 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:43,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1560316496, now seen corresponding path program 1 times [2025-03-13 21:57:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:43,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720149808] [2025-03-13 21:57:43,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:43,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-03-13 21:57:43,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-03-13 21:57:43,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:43,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-13 21:57:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720149808] [2025-03-13 21:57:44,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720149808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:44,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424268030] [2025-03-13 21:57:44,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:44,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:44,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:44,273 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:44,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:57:44,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1017 statements into 1 equivalence classes. [2025-03-13 21:57:44,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1017 of 1017 statements. [2025-03-13 21:57:44,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:44,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:44,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 2230 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 21:57:44,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:44,672 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-13 21:57:44,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-13 21:57:44,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424268030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:44,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:44,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 21:57:44,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442790198] [2025-03-13 21:57:44,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:57:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:44,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:57:44,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:57:44,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-13 21:57:44,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1197 places, 1191 transitions, 2419 flow. Second operand has 10 states, 10 states have (on average 1212.2) internal successors, (12122), 10 states have internal predecessors, (12122), 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-13 21:57:44,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:44,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-13 21:57:44,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:45,150 INFO L124 PetriNetUnfolderBase]: 44/2159 cut-off events. [2025-03-13 21:57:45,151 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 21:57:45,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2317 conditions, 2159 events. 44/2159 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3400 event pairs, 10 based on Foata normal form. 4/2086 useless extension candidates. Maximal degree in co-relation 1726. Up to 35 conditions per place. [2025-03-13 21:57:45,155 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 20 selfloop transitions, 9 changer transitions 0/1206 dead transitions. [2025-03-13 21:57:45,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 1206 transitions, 2523 flow [2025-03-13 21:57:45,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:57:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:57:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10921 transitions. [2025-03-13 21:57:45,158 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9849386724386724 [2025-03-13 21:57:45,158 INFO L175 Difference]: Start difference. First operand has 1197 places, 1191 transitions, 2419 flow. Second operand 9 states and 10921 transitions. [2025-03-13 21:57:45,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1201 places, 1206 transitions, 2523 flow [2025-03-13 21:57:45,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1198 places, 1206 transitions, 2514 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-13 21:57:45,167 INFO L231 Difference]: Finished difference. Result has 1201 places, 1197 transitions, 2460 flow [2025-03-13 21:57:45,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2410, PETRI_DIFFERENCE_MINUEND_PLACES=1190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2460, PETRI_PLACES=1201, PETRI_TRANSITIONS=1197} [2025-03-13 21:57:45,169 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -18 predicate places. [2025-03-13 21:57:45,169 INFO L471 AbstractCegarLoop]: Abstraction has has 1201 places, 1197 transitions, 2460 flow [2025-03-13 21:57:45,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1212.2) internal successors, (12122), 10 states have internal predecessors, (12122), 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-13 21:57:45,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:45,171 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:45,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:57:45,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:45,374 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:45,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1850240272, now seen corresponding path program 2 times [2025-03-13 21:57:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:45,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151097040] [2025-03-13 21:57:45,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:45,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1167 statements into 2 equivalence classes. [2025-03-13 21:57:45,435 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 905 of 1167 statements. [2025-03-13 21:57:45,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:45,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2025-03-13 21:57:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151097040] [2025-03-13 21:57:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151097040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513497221] [2025-03-13 21:57:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:46,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:46,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:47,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-13 21:57:47,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 1197 transitions, 2460 flow. Second operand has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 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-13 21:57:47,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:47,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-13 21:57:47,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:47,421 INFO L124 PetriNetUnfolderBase]: 130/2237 cut-off events. [2025-03-13 21:57:47,421 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-13 21:57:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 2237 events. 130/2237 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4498 event pairs, 95 based on Foata normal form. 0/2165 useless extension candidates. Maximal degree in co-relation 2026. Up to 303 conditions per place. [2025-03-13 21:57:47,425 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 57 selfloop transitions, 5 changer transitions 0/1200 dead transitions. [2025-03-13 21:57:47,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1205 places, 1200 transitions, 2594 flow [2025-03-13 21:57:47,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7047 transitions. [2025-03-13 21:57:47,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953327922077922 [2025-03-13 21:57:47,428 INFO L175 Difference]: Start difference. First operand has 1201 places, 1197 transitions, 2460 flow. Second operand 6 states and 7047 transitions. [2025-03-13 21:57:47,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1205 places, 1200 transitions, 2594 flow [2025-03-13 21:57:47,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1204 places, 1200 transitions, 2588 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:47,438 INFO L231 Difference]: Finished difference. Result has 1204 places, 1196 transitions, 2462 flow [2025-03-13 21:57:47,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2462, PETRI_PLACES=1204, PETRI_TRANSITIONS=1196} [2025-03-13 21:57:47,439 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, -15 predicate places. [2025-03-13 21:57:47,439 INFO L471 AbstractCegarLoop]: Abstraction has has 1204 places, 1196 transitions, 2462 flow [2025-03-13 21:57:47,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 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-13 21:57:47,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:47,440 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:47,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-13 21:57:47,441 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:47,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -985554477, now seen corresponding path program 1 times [2025-03-13 21:57:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:47,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632708963] [2025-03-13 21:57:47,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:47,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1173 statements into 1 equivalence classes. [2025-03-13 21:57:47,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1173 of 1173 statements. [2025-03-13 21:57:47,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:47,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-13 21:57:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632708963] [2025-03-13 21:57:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632708963] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520440653] [2025-03-13 21:57:48,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:48,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:48,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:48,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:48,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:57:48,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1173 statements into 1 equivalence classes. [2025-03-13 21:57:48,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1173 of 1173 statements. [2025-03-13 21:57:48,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:48,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:48,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 2738 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:57:48,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-13 21:57:49,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 318 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-13 21:57:49,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520440653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:49,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:49,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 21:57:49,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848652232] [2025-03-13 21:57:49,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:49,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 21:57:49,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:49,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 21:57:49,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 21:57:49,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-13 21:57:49,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1204 places, 1196 transitions, 2462 flow. Second operand has 18 states, 18 states have (on average 1212.111111111111) internal successors, (21818), 18 states have internal predecessors, (21818), 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-13 21:57:49,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:49,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-13 21:57:49,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:50,121 INFO L124 PetriNetUnfolderBase]: 70/2923 cut-off events. [2025-03-13 21:57:50,122 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-13 21:57:50,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 2923 events. 70/2923 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4847 event pairs, 10 based on Foata normal form. 8/2850 useless extension candidates. Maximal degree in co-relation 2657. Up to 35 conditions per place. [2025-03-13 21:57:50,126 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 36 selfloop transitions, 21 changer transitions 0/1233 dead transitions. [2025-03-13 21:57:50,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1224 places, 1233 transitions, 2740 flow [2025-03-13 21:57:50,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 21:57:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 21:57:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25471 transitions. [2025-03-13 21:57:50,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9845006184291899 [2025-03-13 21:57:50,133 INFO L175 Difference]: Start difference. First operand has 1204 places, 1196 transitions, 2462 flow. Second operand 21 states and 25471 transitions. [2025-03-13 21:57:50,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1224 places, 1233 transitions, 2740 flow [2025-03-13 21:57:50,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1219 places, 1233 transitions, 2730 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:50,143 INFO L231 Difference]: Finished difference. Result has 1224 places, 1209 transitions, 2582 flow [2025-03-13 21:57:50,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2452, PETRI_DIFFERENCE_MINUEND_PLACES=1199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2582, PETRI_PLACES=1224, PETRI_TRANSITIONS=1209} [2025-03-13 21:57:50,144 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 5 predicate places. [2025-03-13 21:57:50,145 INFO L471 AbstractCegarLoop]: Abstraction has has 1224 places, 1209 transitions, 2582 flow [2025-03-13 21:57:50,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1212.111111111111) internal successors, (21818), 18 states have internal predecessors, (21818), 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-13 21:57:50,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:50,147 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:50,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-13 21:57:50,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-13 21:57:50,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t2Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1594889995, now seen corresponding path program 2 times [2025-03-13 21:57:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746585316] [2025-03-13 21:57:50,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:57:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:50,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1473 statements into 2 equivalence classes. [2025-03-13 21:57:50,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 911 of 1473 statements. [2025-03-13 21:57:50,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:57:50,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:51,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2353 trivial. 0 not checked. [2025-03-13 21:57:51,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:51,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746585316] [2025-03-13 21:57:51,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746585316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:51,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:51,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:51,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14440926] [2025-03-13 21:57:51,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:51,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:51,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:51,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:51,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:52,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1164 out of 1232 [2025-03-13 21:57:52,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1224 places, 1209 transitions, 2582 flow. Second operand has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 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-13 21:57:52,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:52,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1164 of 1232 [2025-03-13 21:57:52,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:52,697 INFO L124 PetriNetUnfolderBase]: 218/3065 cut-off events. [2025-03-13 21:57:52,697 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-13 21:57:52,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4122 conditions, 3065 events. 218/3065 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6805 event pairs, 175 based on Foata normal form. 0/2989 useless extension candidates. Maximal degree in co-relation 3374. Up to 543 conditions per place. [2025-03-13 21:57:52,706 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 57 selfloop transitions, 5 changer transitions 0/1212 dead transitions. [2025-03-13 21:57:52,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1228 places, 1212 transitions, 2716 flow [2025-03-13 21:57:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7047 transitions. [2025-03-13 21:57:52,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.953327922077922 [2025-03-13 21:57:52,709 INFO L175 Difference]: Start difference. First operand has 1224 places, 1209 transitions, 2582 flow. Second operand 6 states and 7047 transitions. [2025-03-13 21:57:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1228 places, 1212 transitions, 2716 flow [2025-03-13 21:57:52,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1222 places, 1212 transitions, 2692 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 21:57:52,719 INFO L231 Difference]: Finished difference. Result has 1222 places, 1208 transitions, 2566 flow [2025-03-13 21:57:52,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=1217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2566, PETRI_PLACES=1222, PETRI_TRANSITIONS=1208} [2025-03-13 21:57:52,720 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-13 21:57:52,720 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1208 transitions, 2566 flow [2025-03-13 21:57:52,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1170.6666666666667) internal successors, (7024), 6 states have internal predecessors, (7024), 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-13 21:57:52,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:52,722 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-13 21:57:52,722 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1489545194, now seen corresponding path program 1 times [2025-03-13 21:57:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717211583] [2025-03-13 21:57:52,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:52,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1491 statements into 1 equivalence classes. [2025-03-13 21:57:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1491 of 1491 statements. [2025-03-13 21:57:52,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:52,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2354 trivial. 0 not checked. [2025-03-13 21:57:53,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:53,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717211583] [2025-03-13 21:57:53,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717211583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:53,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:53,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:57:53,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803184497] [2025-03-13 21:57:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:53,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:57:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:53,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:57:53,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:57:53,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-13 21:57:53,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1208 transitions, 2566 flow. Second operand has 4 states, 4 states have (on average 1212.5) internal successors, (4850), 4 states have internal predecessors, (4850), 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-13 21:57:53,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:53,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-13 21:57:53,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:53,951 INFO L124 PetriNetUnfolderBase]: 60/3357 cut-off events. [2025-03-13 21:57:53,951 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-13 21:57:53,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3645 conditions, 3357 events. 60/3357 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7981 event pairs, 17 based on Foata normal form. 4/3241 useless extension candidates. Maximal degree in co-relation 2530. Up to 59 conditions per place. [2025-03-13 21:57:53,957 INFO L140 encePairwiseOnDemand]: 1227/1232 looper letters, 14 selfloop transitions, 4 changer transitions 0/1213 dead transitions. [2025-03-13 21:57:53,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1225 places, 1213 transitions, 2614 flow [2025-03-13 21:57:53,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:57:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:57:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4859 transitions. [2025-03-13 21:57:53,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9859983766233766 [2025-03-13 21:57:53,959 INFO L175 Difference]: Start difference. First operand has 1222 places, 1208 transitions, 2566 flow. Second operand 4 states and 4859 transitions. [2025-03-13 21:57:53,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1225 places, 1213 transitions, 2614 flow [2025-03-13 21:57:53,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1220 places, 1213 transitions, 2604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:53,968 INFO L231 Difference]: Finished difference. Result has 1222 places, 1211 transitions, 2584 flow [2025-03-13 21:57:53,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2556, PETRI_DIFFERENCE_MINUEND_PLACES=1217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2584, PETRI_PLACES=1222, PETRI_TRANSITIONS=1211} [2025-03-13 21:57:53,969 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-13 21:57:53,969 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1211 transitions, 2584 flow [2025-03-13 21:57:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1212.5) internal successors, (4850), 4 states have internal predecessors, (4850), 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-13 21:57:53,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:53,970 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:53,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-13 21:57:53,970 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:53,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:53,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1899956204, now seen corresponding path program 1 times [2025-03-13 21:57:53,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:53,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222555732] [2025-03-13 21:57:53,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:54,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-13 21:57:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-13 21:57:54,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:54,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2354 trivial. 0 not checked. [2025-03-13 21:57:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222555732] [2025-03-13 21:57:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222555732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189600071] [2025-03-13 21:57:54,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:54,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:54,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:54,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:54,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 21:57:54,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-03-13 21:57:55,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-03-13 21:57:55,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:55,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 3738 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:57:55,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:55,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2025-03-13 21:57:55,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:57:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189600071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:57:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:57:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688712785] [2025-03-13 21:57:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:55,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:55,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:55,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-13 21:57:55,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1211 transitions, 2584 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:57:55,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:55,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-13 21:57:55,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:55,941 INFO L124 PetriNetUnfolderBase]: 53/3346 cut-off events. [2025-03-13 21:57:55,942 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-13 21:57:55,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 3346 events. 53/3346 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7854 event pairs, 12 based on Foata normal form. 0/3230 useless extension candidates. Maximal degree in co-relation 3114. Up to 44 conditions per place. [2025-03-13 21:57:55,947 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 12 selfloop transitions, 2 changer transitions 0/1211 dead transitions. [2025-03-13 21:57:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1223 places, 1211 transitions, 2613 flow [2025-03-13 21:57:55,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3642 transitions. [2025-03-13 21:57:55,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853896103896104 [2025-03-13 21:57:55,949 INFO L175 Difference]: Start difference. First operand has 1222 places, 1211 transitions, 2584 flow. Second operand 3 states and 3642 transitions. [2025-03-13 21:57:55,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1223 places, 1211 transitions, 2613 flow [2025-03-13 21:57:55,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1222 places, 1211 transitions, 2611 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:55,959 INFO L231 Difference]: Finished difference. Result has 1222 places, 1210 transitions, 2584 flow [2025-03-13 21:57:55,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=1220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2584, PETRI_PLACES=1222, PETRI_TRANSITIONS=1210} [2025-03-13 21:57:55,960 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 3 predicate places. [2025-03-13 21:57:55,960 INFO L471 AbstractCegarLoop]: Abstraction has has 1222 places, 1210 transitions, 2584 flow [2025-03-13 21:57:55,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:57:55,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:55,961 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:55,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:57:56,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-13 21:57:56,162 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:57:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:56,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1741443358, now seen corresponding path program 1 times [2025-03-13 21:57:56,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:56,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658885198] [2025-03-13 21:57:56,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:56,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:56,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1494 statements into 1 equivalence classes. [2025-03-13 21:57:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1494 of 1494 statements. [2025-03-13 21:57:56,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:56,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-13 21:57:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658885198] [2025-03-13 21:57:57,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658885198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:57:57,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955140083] [2025-03-13 21:57:57,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:57,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:57:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:57,771 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:57:57,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 21:57:58,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1494 statements into 1 equivalence classes. [2025-03-13 21:57:58,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1494 of 1494 statements. [2025-03-13 21:57:58,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:58,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:58,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 3752 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 21:57:58,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:57:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-13 21:57:58,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:57:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2212 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-13 21:57:59,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955140083] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:57:59,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:57:59,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 21:57:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905987437] [2025-03-13 21:57:59,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:57:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 21:57:59,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:59,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 21:57:59,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 21:57:59,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1210 out of 1232 [2025-03-13 21:57:59,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1222 places, 1210 transitions, 2584 flow. Second operand has 34 states, 34 states have (on average 1212.0588235294117) internal successors, (41210), 34 states have internal predecessors, (41210), 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-13 21:57:59,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:59,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1210 of 1232 [2025-03-13 21:57:59,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:00,921 INFO L124 PetriNetUnfolderBase]: 122/4905 cut-off events. [2025-03-13 21:58:00,921 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-03-13 21:58:00,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5656 conditions, 4905 events. 122/4905 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11104 event pairs, 10 based on Foata normal form. 16/4788 useless extension candidates. Maximal degree in co-relation 5595. Up to 67 conditions per place. [2025-03-13 21:58:00,928 INFO L140 encePairwiseOnDemand]: 1226/1232 looper letters, 68 selfloop transitions, 45 changer transitions 0/1290 dead transitions. [2025-03-13 21:58:00,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1266 places, 1290 transitions, 3254 flow [2025-03-13 21:58:00,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 21:58:00,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 21:58:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54571 transitions. [2025-03-13 21:58:00,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9843253968253968 [2025-03-13 21:58:00,942 INFO L175 Difference]: Start difference. First operand has 1222 places, 1210 transitions, 2584 flow. Second operand 45 states and 54571 transitions. [2025-03-13 21:58:00,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1266 places, 1290 transitions, 3254 flow [2025-03-13 21:58:00,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1264 places, 1290 transitions, 3250 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:58:00,952 INFO L231 Difference]: Finished difference. Result has 1273 places, 1235 transitions, 2882 flow [2025-03-13 21:58:00,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2580, PETRI_DIFFERENCE_MINUEND_PLACES=1220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2882, PETRI_PLACES=1273, PETRI_TRANSITIONS=1235} [2025-03-13 21:58:00,954 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 54 predicate places. [2025-03-13 21:58:00,954 INFO L471 AbstractCegarLoop]: Abstraction has has 1273 places, 1235 transitions, 2882 flow [2025-03-13 21:58:00,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1212.0588235294117) internal successors, (41210), 34 states have internal predecessors, (41210), 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-13 21:58:00,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:00,958 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:00,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-13 21:58:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:01,160 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:58:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash 502561506, now seen corresponding path program 2 times [2025-03-13 21:58:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:01,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670794069] [2025-03-13 21:58:01,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:58:01,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:01,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2094 statements into 2 equivalence classes. [2025-03-13 21:58:01,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 925 of 2094 statements. [2025-03-13 21:58:01,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:58:01,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11304 trivial. 0 not checked. [2025-03-13 21:58:02,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670794069] [2025-03-13 21:58:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670794069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:58:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457181484] [2025-03-13 21:58:02,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:02,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:58:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:02,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:58:02,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:03,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1154 out of 1232 [2025-03-13 21:58:03,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1273 places, 1235 transitions, 2882 flow. Second operand has 6 states, 6 states have (on average 1160.6666666666667) internal successors, (6964), 6 states have internal predecessors, (6964), 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-13 21:58:03,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:03,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1154 of 1232 [2025-03-13 21:58:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:04,527 INFO L124 PetriNetUnfolderBase]: 466/5223 cut-off events. [2025-03-13 21:58:04,528 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-13 21:58:04,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 5223 events. 466/5223 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15403 event pairs, 353 based on Foata normal form. 0/5131 useless extension candidates. Maximal degree in co-relation 6210. Up to 1085 conditions per place. [2025-03-13 21:58:04,540 INFO L140 encePairwiseOnDemand]: 1223/1232 looper letters, 64 selfloop transitions, 6 changer transitions 0/1236 dead transitions. [2025-03-13 21:58:04,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1275 places, 1236 transitions, 3028 flow [2025-03-13 21:58:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:58:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:58:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6997 transitions. [2025-03-13 21:58:04,545 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9465638528138528 [2025-03-13 21:58:04,545 INFO L175 Difference]: Start difference. First operand has 1273 places, 1235 transitions, 2882 flow. Second operand 6 states and 6997 transitions. [2025-03-13 21:58:04,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1275 places, 1236 transitions, 3028 flow [2025-03-13 21:58:04,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1257 places, 1236 transitions, 2972 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-13 21:58:04,564 INFO L231 Difference]: Finished difference. Result has 1257 places, 1232 transitions, 2832 flow [2025-03-13 21:58:04,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=1252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2832, PETRI_PLACES=1257, PETRI_TRANSITIONS=1232} [2025-03-13 21:58:04,566 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 38 predicate places. [2025-03-13 21:58:04,566 INFO L471 AbstractCegarLoop]: Abstraction has has 1257 places, 1232 transitions, 2832 flow [2025-03-13 21:58:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1160.6666666666667) internal successors, (6964), 6 states have internal predecessors, (6964), 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-13 21:58:04,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:04,568 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:04,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-13 21:58:04,568 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:58:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2008444362, now seen corresponding path program 1 times [2025-03-13 21:58:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618405686] [2025-03-13 21:58:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:04,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2098 statements into 1 equivalence classes. [2025-03-13 21:58:04,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2098 of 2098 statements. [2025-03-13 21:58:04,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:04,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11305 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11304 trivial. 0 not checked. [2025-03-13 21:58:06,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618405686] [2025-03-13 21:58:06,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618405686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:58:06,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47818409] [2025-03-13 21:58:06,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:06,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:58:06,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:58:06,060 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:58:06,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-13 21:58:06,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2098 statements into 1 equivalence classes. [2025-03-13 21:58:07,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2098 of 2098 statements. [2025-03-13 21:58:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:07,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 5674 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-13 21:58:07,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:58:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11305 trivial. 0 not checked. [2025-03-13 21:58:07,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-13 21:58:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47818409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-13 21:58:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-13 21:58:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749325273] [2025-03-13 21:58:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:07,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:07,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:58:07,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1209 out of 1232 [2025-03-13 21:58:07,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1257 places, 1232 transitions, 2832 flow. Second operand has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:58:07,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:07,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1209 of 1232 [2025-03-13 21:58:07,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:08,278 INFO L124 PetriNetUnfolderBase]: 67/4820 cut-off events. [2025-03-13 21:58:08,279 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-13 21:58:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 4820 events. 67/4820 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10161 event pairs, 10 based on Foata normal form. 0/4716 useless extension candidates. Maximal degree in co-relation 4585. Up to 60 conditions per place. [2025-03-13 21:58:08,288 INFO L140 encePairwiseOnDemand]: 1229/1232 looper letters, 9 selfloop transitions, 0 changer transitions 5/1232 dead transitions. [2025-03-13 21:58:08,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1258 places, 1232 transitions, 2861 flow [2025-03-13 21:58:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3642 transitions. [2025-03-13 21:58:08,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9853896103896104 [2025-03-13 21:58:08,290 INFO L175 Difference]: Start difference. First operand has 1257 places, 1232 transitions, 2832 flow. Second operand 3 states and 3642 transitions. [2025-03-13 21:58:08,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1258 places, 1232 transitions, 2861 flow [2025-03-13 21:58:08,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1253 places, 1232 transitions, 2849 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:58:08,301 INFO L231 Difference]: Finished difference. Result has 1253 places, 1227 transitions, 2810 flow [2025-03-13 21:58:08,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1232, PETRI_DIFFERENCE_MINUEND_FLOW=2818, PETRI_DIFFERENCE_MINUEND_PLACES=1251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2810, PETRI_PLACES=1253, PETRI_TRANSITIONS=1227} [2025-03-13 21:58:08,302 INFO L279 CegarLoopForPetriNet]: 1219 programPoint places, 34 predicate places. [2025-03-13 21:58:08,302 INFO L471 AbstractCegarLoop]: Abstraction has has 1253 places, 1227 transitions, 2810 flow [2025-03-13 21:58:08,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1212.6666666666667) internal successors, (3638), 3 states have internal predecessors, (3638), 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-13 21:58:08,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:08,304 INFO L206 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:08,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-13 21:58:08,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-13 21:58:08,504 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-13 21:58:08,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:08,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1707928571, now seen corresponding path program 1 times [2025-03-13 21:58:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:08,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990457504] [2025-03-13 21:58:08,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:08,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2100 statements into 1 equivalence classes. [2025-03-13 21:58:08,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2100 of 2100 statements. [2025-03-13 21:58:08,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat