./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_ok.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 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:22:48,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:22:48,191 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:22:48,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:22:48,198 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:22:48,222 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:22:48,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:22:48,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:22:48,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:22:48,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:22:48,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:22:48,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:22:48,225 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:22:48,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:22:48,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:22:48,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:22:48,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:22:48,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:22:48,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:48,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:22:48,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:22:48,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:22:48,228 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2025-03-04 06:22:48,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:22:48,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:22:48,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:22:48,451 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:22:48,451 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:22:48,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 06:22:49,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a8e9bea/8de03b338592417b987778bd84be6f0f/FLAGc63b4a2e9 [2025-03-04 06:22:49,891 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:22:49,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_ok.i [2025-03-04 06:22:49,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a8e9bea/8de03b338592417b987778bd84be6f0f/FLAGc63b4a2e9 [2025-03-04 06:22:50,167 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18a8e9bea/8de03b338592417b987778bd84be6f0f [2025-03-04 06:22:50,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:22:50,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:22:50,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:50,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:22:50,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:22:50,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691d64f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50, skipping insertion in model container [2025-03-04 06:22:50,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:22:50,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:50,602 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:22:50,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:22:50,693 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:22:50,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50 WrapperNode [2025-03-04 06:22:50,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:22:50,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:50,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:22:50,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:22:50,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,746 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 409 [2025-03-04 06:22:50,747 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:22:50,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:22:50,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:22:50,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:22:50,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,797 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:22:50,798 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:22:50,798 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:22:50,798 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:22:50,799 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (1/1) ... [2025-03-04 06:22:50,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:22:50,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:22:50,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:22:50,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:22:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 06:22:50,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 06:22:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 06:22:50,848 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 06:22:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:22:50,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:22:50,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:22:50,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:22:50,850 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:22:50,963 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:22:50,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:22:51,544 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:22:51,545 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:22:51,564 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:22:51,564 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:22:51,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:51 BoogieIcfgContainer [2025-03-04 06:22:51,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:22:51,566 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:22:51,566 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:22:51,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:22:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:22:50" (1/3) ... [2025-03-04 06:22:51,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7c40ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:51, skipping insertion in model container [2025-03-04 06:22:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:22:50" (2/3) ... [2025-03-04 06:22:51,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7c40ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:22:51, skipping insertion in model container [2025-03-04 06:22:51,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:22:51" (3/3) ... [2025-03-04 06:22:51,571 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-04 06:22:51,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:22:51,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 460 locations, 1 initial locations, 2 loop locations, and 33 error locations. [2025-03-04 06:22:51,581 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:22:51,685 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 06:22:51,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 466 places, 472 transitions, 958 flow [2025-03-04 06:22:51,895 INFO L124 PetriNetUnfolderBase]: 13/470 cut-off events. [2025-03-04 06:22:51,896 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:22:51,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 470 events. 13/470 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 740 event pairs, 0 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 309. Up to 3 conditions per place. [2025-03-04 06:22:51,911 INFO L82 GeneralOperation]: Start removeDead. Operand has 466 places, 472 transitions, 958 flow [2025-03-04 06:22:51,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 459 places, 465 transitions, 939 flow [2025-03-04 06:22:51,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:22:51,928 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;@7b06826b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:22:51,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-04 06:22:51,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:22:51,939 INFO L124 PetriNetUnfolderBase]: 0/70 cut-off events. [2025-03-04 06:22:51,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:22:51,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:51,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:51,940 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-04 06:22:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1038377964, now seen corresponding path program 1 times [2025-03-04 06:22:51,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:51,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79311025] [2025-03-04 06:22:51,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:52,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:22:52,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:22:52,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:52,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:52,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:52,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:52,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79311025] [2025-03-04 06:22:52,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79311025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:52,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:52,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:52,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470627652] [2025-03-04 06:22:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:52,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:52,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:52,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:52,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-04 06:22:52,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 465 transitions, 939 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:52,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:52,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-04 06:22:52,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:52,437 INFO L124 PetriNetUnfolderBase]: 40/986 cut-off events. [2025-03-04 06:22:52,437 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 06:22:52,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 986 events. 40/986 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4394 event pairs, 19 based on Foata normal form. 3/881 useless extension candidates. Maximal degree in co-relation 881. Up to 52 conditions per place. [2025-03-04 06:22:52,453 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2025-03-04 06:22:52,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 452 transitions, 943 flow [2025-03-04 06:22:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1360 transitions. [2025-03-04 06:22:52,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2025-03-04 06:22:52,469 INFO L175 Difference]: Start difference. First operand has 459 places, 465 transitions, 939 flow. Second operand 3 states and 1360 transitions. [2025-03-04 06:22:52,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 452 transitions, 943 flow [2025-03-04 06:22:52,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 452 transitions, 938 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 06:22:52,489 INFO L231 Difference]: Finished difference. Result has 449 places, 452 transitions, 912 flow [2025-03-04 06:22:52,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=452} [2025-03-04 06:22:52,499 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-04 06:22:52,500 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 452 transitions, 912 flow [2025-03-04 06:22:52,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:52,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:52,502 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] [2025-03-04 06:22:52,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:22:52,502 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-04 06:22:52,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:52,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1995106460, now seen corresponding path program 1 times [2025-03-04 06:22:52,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:52,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653126835] [2025-03-04 06:22:52,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:52,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-04 06:22:52,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-04 06:22:52,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:52,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:52,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:52,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653126835] [2025-03-04 06:22:52,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653126835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:52,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:52,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:22:52,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254591455] [2025-03-04 06:22:52,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:22:52,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:52,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:22:52,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:22:52,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 472 [2025-03-04 06:22:52,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 452 transitions, 912 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:52,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:52,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 472 [2025-03-04 06:22:52,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:52,852 INFO L124 PetriNetUnfolderBase]: 43/1114 cut-off events. [2025-03-04 06:22:52,852 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:22:52,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1181 conditions, 1114 events. 43/1114 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5448 event pairs, 19 based on Foata normal form. 0/996 useless extension candidates. Maximal degree in co-relation 1104. Up to 52 conditions per place. [2025-03-04 06:22:52,858 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-04 06:22:52,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 451 transitions, 940 flow [2025-03-04 06:22:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:22:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:22:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1357 transitions. [2025-03-04 06:22:52,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2025-03-04 06:22:52,863 INFO L175 Difference]: Start difference. First operand has 449 places, 452 transitions, 912 flow. Second operand 3 states and 1357 transitions. [2025-03-04 06:22:52,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 451 transitions, 940 flow [2025-03-04 06:22:52,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 451 transitions, 936 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:52,870 INFO L231 Difference]: Finished difference. Result has 448 places, 451 transitions, 910 flow [2025-03-04 06:22:52,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=451} [2025-03-04 06:22:52,871 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-04 06:22:52,871 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 451 transitions, 910 flow [2025-03-04 06:22:52,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:52,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:52,872 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] [2025-03-04 06:22:52,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:22:52,873 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-04 06:22:52,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash 651287665, now seen corresponding path program 1 times [2025-03-04 06:22:52,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:52,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796833574] [2025-03-04 06:22:52,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:52,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:52,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 06:22:52,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 06:22:52,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:52,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:53,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796833574] [2025-03-04 06:22:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796833574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:53,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:53,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218217081] [2025-03-04 06:22:53,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:53,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:53,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:53,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:53,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-04 06:22:53,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 451 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:53,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:53,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-04 06:22:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:55,097 INFO L124 PetriNetUnfolderBase]: 2177/9184 cut-off events. [2025-03-04 06:22:55,098 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 06:22:55,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13285 conditions, 9184 events. 2177/9184 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80052 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13204. Up to 4013 conditions per place. [2025-03-04 06:22:55,148 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-04 06:22:55,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 1118 flow [2025-03-04 06:22:55,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:22:55,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:22:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-04 06:22:55,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-04 06:22:55,155 INFO L175 Difference]: Start difference. First operand has 448 places, 451 transitions, 910 flow. Second operand 6 states and 2254 transitions. [2025-03-04 06:22:55,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 1118 flow [2025-03-04 06:22:55,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 1114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:22:55,161 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 914 flow [2025-03-04 06:22:55,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2025-03-04 06:22:55,163 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-04 06:22:55,164 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 914 flow [2025-03-04 06:22:55,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:55,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:55,165 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:22:55,166 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-04 06:22:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1989225366, now seen corresponding path program 1 times [2025-03-04 06:22:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562687346] [2025-03-04 06:22:55,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:22:55,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:22:55,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562687346] [2025-03-04 06:22:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562687346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478810595] [2025-03-04 06:22:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:55,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:55,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:55,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:55,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:55,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-04 06:22:55,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 914 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:55,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:55,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-04 06:22:55,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:57,217 INFO L124 PetriNetUnfolderBase]: 2177/9183 cut-off events. [2025-03-04 06:22:57,217 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 06:22:57,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13287 conditions, 9183 events. 2177/9183 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 80103 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13190. Up to 4013 conditions per place. [2025-03-04 06:22:57,272 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-04 06:22:57,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 449 transitions, 1122 flow [2025-03-04 06:22:57,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:22:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:22:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-04 06:22:57,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-04 06:22:57,277 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 914 flow. Second operand 6 states and 2254 transitions. [2025-03-04 06:22:57,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 449 transitions, 1122 flow [2025-03-04 06:22:57,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 449 transitions, 1112 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:22:57,284 INFO L231 Difference]: Finished difference. Result has 449 places, 449 transitions, 912 flow [2025-03-04 06:22:57,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=912, PETRI_PLACES=449, PETRI_TRANSITIONS=449} [2025-03-04 06:22:57,285 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -10 predicate places. [2025-03-04 06:22:57,285 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 449 transitions, 912 flow [2025-03-04 06:22:57,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:57,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:57,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:57,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:22:57,287 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-04 06:22:57,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash -674521394, now seen corresponding path program 1 times [2025-03-04 06:22:57,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:57,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64787398] [2025-03-04 06:22:57,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:57,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:57,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 06:22:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 06:22:57,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:57,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:57,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64787398] [2025-03-04 06:22:57,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64787398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:57,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:57,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:57,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11184494] [2025-03-04 06:22:57,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:57,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:57,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:57,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:57,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:22:58,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 472 [2025-03-04 06:22:58,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 449 transitions, 912 flow. Second operand has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:58,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:22:58,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 472 [2025-03-04 06:22:58,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:22:59,100 INFO L124 PetriNetUnfolderBase]: 2177/9182 cut-off events. [2025-03-04 06:22:59,101 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 06:22:59,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13286 conditions, 9182 events. 2177/9182 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 79914 event pairs, 1832 based on Foata normal form. 0/8228 useless extension candidates. Maximal degree in co-relation 13181. Up to 4013 conditions per place. [2025-03-04 06:22:59,137 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 100 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-04 06:22:59,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 448 transitions, 1120 flow [2025-03-04 06:22:59,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:22:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:22:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2254 transitions. [2025-03-04 06:22:59,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7959039548022598 [2025-03-04 06:22:59,142 INFO L175 Difference]: Start difference. First operand has 449 places, 449 transitions, 912 flow. Second operand 6 states and 2254 transitions. [2025-03-04 06:22:59,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 448 transitions, 1120 flow [2025-03-04 06:22:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 448 transitions, 1110 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:22:59,151 INFO L231 Difference]: Finished difference. Result has 448 places, 448 transitions, 910 flow [2025-03-04 06:22:59,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=448, PETRI_TRANSITIONS=448} [2025-03-04 06:22:59,152 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-04 06:22:59,152 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 448 transitions, 910 flow [2025-03-04 06:22:59,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 359.3333333333333) internal successors, (2156), 6 states have internal predecessors, (2156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:22:59,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:22:59,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:22:59,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:22:59,154 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-04 06:22:59,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:22:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 84007781, now seen corresponding path program 1 times [2025-03-04 06:22:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:22:59,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310048475] [2025-03-04 06:22:59,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:22:59,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:22:59,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 06:22:59,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 06:22:59,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:22:59,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:22:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:22:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:22:59,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310048475] [2025-03-04 06:22:59,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310048475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:22:59,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:22:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:22:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4953500] [2025-03-04 06:22:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:22:59,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:22:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:22:59,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:22:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:00,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-04 06:23:00,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 448 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:00,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:00,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-04 06:23:00,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:00,942 INFO L124 PetriNetUnfolderBase]: 502/4907 cut-off events. [2025-03-04 06:23:00,942 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:23:00,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5777 conditions, 4907 events. 502/4907 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 39017 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5654. Up to 811 conditions per place. [2025-03-04 06:23:00,968 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-04 06:23:00,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 447 transitions, 1026 flow [2025-03-04 06:23:00,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:00,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-04 06:23:00,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-04 06:23:00,974 INFO L175 Difference]: Start difference. First operand has 448 places, 448 transitions, 910 flow. Second operand 6 states and 2484 transitions. [2025-03-04 06:23:00,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 447 transitions, 1026 flow [2025-03-04 06:23:00,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 447 transitions, 1016 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:00,981 INFO L231 Difference]: Finished difference. Result has 447 places, 447 transitions, 908 flow [2025-03-04 06:23:00,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=908, PETRI_PLACES=447, PETRI_TRANSITIONS=447} [2025-03-04 06:23:00,982 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-04 06:23:00,982 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 447 transitions, 908 flow [2025-03-04 06:23:00,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:00,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:00,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:00,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:23:00,984 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-04 06:23:00,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:00,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1788507416, now seen corresponding path program 1 times [2025-03-04 06:23:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:00,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493834300] [2025-03-04 06:23:00,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:00,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:00,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 06:23:01,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 06:23:01,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:01,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:23:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493834300] [2025-03-04 06:23:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493834300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:01,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726109141] [2025-03-04 06:23:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:01,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:01,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:02,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-04 06:23:02,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:02,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:02,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-04 06:23:02,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:02,663 INFO L124 PetriNetUnfolderBase]: 502/4906 cut-off events. [2025-03-04 06:23:02,663 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 06:23:02,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5776 conditions, 4906 events. 502/4906 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39174 event pairs, 344 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 5615. Up to 811 conditions per place. [2025-03-04 06:23:02,679 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 54 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-04 06:23:02,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 446 transitions, 1024 flow [2025-03-04 06:23:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2484 transitions. [2025-03-04 06:23:02,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8771186440677966 [2025-03-04 06:23:02,684 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 908 flow. Second operand 6 states and 2484 transitions. [2025-03-04 06:23:02,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 446 transitions, 1024 flow [2025-03-04 06:23:02,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 446 transitions, 1014 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:02,689 INFO L231 Difference]: Finished difference. Result has 446 places, 446 transitions, 906 flow [2025-03-04 06:23:02,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=446} [2025-03-04 06:23:02,690 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-04 06:23:02,690 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 446 transitions, 906 flow [2025-03-04 06:23:02,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.1666666666667) internal successors, (2443), 6 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:02,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:02,692 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] [2025-03-04 06:23:02,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:23:02,692 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-04 06:23:02,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:02,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1108378393, now seen corresponding path program 1 times [2025-03-04 06:23:02,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:02,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595186751] [2025-03-04 06:23:02,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:02,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:02,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 06:23:02,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 06:23:02,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:02,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:23:02,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:02,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595186751] [2025-03-04 06:23:02,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595186751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:02,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:02,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:02,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058853194] [2025-03-04 06:23:02,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:02,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:02,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:02,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:02,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:02,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-04 06:23:02,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 446 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:02,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:02,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-04 06:23:02,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:02,878 INFO L124 PetriNetUnfolderBase]: 53/1041 cut-off events. [2025-03-04 06:23:02,878 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 06:23:02,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 1041 events. 53/1041 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4919 event pairs, 12 based on Foata normal form. 0/937 useless extension candidates. Maximal degree in co-relation 1009. Up to 56 conditions per place. [2025-03-04 06:23:02,884 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 17 selfloop transitions, 4 changer transitions 0/454 dead transitions. [2025-03-04 06:23:02,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 454 transitions, 967 flow [2025-03-04 06:23:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:02,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:02,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-04 06:23:02,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-04 06:23:02,889 INFO L175 Difference]: Start difference. First operand has 446 places, 446 transitions, 906 flow. Second operand 3 states and 1375 transitions. [2025-03-04 06:23:02,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 454 transitions, 967 flow [2025-03-04 06:23:02,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 454 transitions, 957 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:02,897 INFO L231 Difference]: Finished difference. Result has 445 places, 449 transitions, 926 flow [2025-03-04 06:23:02,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=926, PETRI_PLACES=445, PETRI_TRANSITIONS=449} [2025-03-04 06:23:02,899 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-04 06:23:02,900 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 449 transitions, 926 flow [2025-03-04 06:23:02,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:02,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:02,901 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] [2025-03-04 06:23:02,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:23:02,901 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-04 06:23:02,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 874979927, now seen corresponding path program 1 times [2025-03-04 06:23:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696479387] [2025-03-04 06:23:02,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:02,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:02,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-04 06:23:02,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-04 06:23:02,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:02,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:23:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696479387] [2025-03-04 06:23:02,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696479387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:23:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473846656] [2025-03-04 06:23:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:02,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:02,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:02,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 472 [2025-03-04 06:23:02,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 449 transitions, 926 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:02,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:02,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 472 [2025-03-04 06:23:02,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:03,125 INFO L124 PetriNetUnfolderBase]: 96/2101 cut-off events. [2025-03-04 06:23:03,126 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 06:23:03,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 2101 events. 96/2101 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13704 event pairs, 24 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 1965. Up to 85 conditions per place. [2025-03-04 06:23:03,136 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 16 selfloop transitions, 4 changer transitions 0/456 dead transitions. [2025-03-04 06:23:03,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 456 transitions, 981 flow [2025-03-04 06:23:03,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:03,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-04 06:23:03,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-04 06:23:03,138 INFO L175 Difference]: Start difference. First operand has 445 places, 449 transitions, 926 flow. Second operand 3 states and 1374 transitions. [2025-03-04 06:23:03,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 456 transitions, 981 flow [2025-03-04 06:23:03,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 456 transitions, 973 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:03,144 INFO L231 Difference]: Finished difference. Result has 447 places, 452 transitions, 948 flow [2025-03-04 06:23:03,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=948, PETRI_PLACES=447, PETRI_TRANSITIONS=452} [2025-03-04 06:23:03,146 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-04 06:23:03,146 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 452 transitions, 948 flow [2025-03-04 06:23:03,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:03,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:03,147 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] [2025-03-04 06:23:03,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:23:03,147 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-04 06:23:03,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1675236772, now seen corresponding path program 1 times [2025-03-04 06:23:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:03,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177701893] [2025-03-04 06:23:03,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 06:23:03,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 06:23:03,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177701893] [2025-03-04 06:23:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177701893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:03,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:23:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818824969] [2025-03-04 06:23:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:03,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:03,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:03,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-04 06:23:03,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 452 transitions, 948 flow. Second operand has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:03,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:03,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-04 06:23:03,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:03,421 INFO L124 PetriNetUnfolderBase]: 82/2173 cut-off events. [2025-03-04 06:23:03,421 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-04 06:23:03,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2361 conditions, 2173 events. 82/2173 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 12317 event pairs, 35 based on Foata normal form. 7/1964 useless extension candidates. Maximal degree in co-relation 1929. Up to 102 conditions per place. [2025-03-04 06:23:03,434 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2025-03-04 06:23:03,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 456 transitions, 988 flow [2025-03-04 06:23:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-04 06:23:03,436 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-04 06:23:03,436 INFO L175 Difference]: Start difference. First operand has 447 places, 452 transitions, 948 flow. Second operand 3 states and 1375 transitions. [2025-03-04 06:23:03,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 456 transitions, 988 flow [2025-03-04 06:23:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 456 transitions, 980 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:03,442 INFO L231 Difference]: Finished difference. Result has 448 places, 453 transitions, 952 flow [2025-03-04 06:23:03,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=952, PETRI_PLACES=448, PETRI_TRANSITIONS=453} [2025-03-04 06:23:03,444 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-04 06:23:03,444 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 453 transitions, 952 flow [2025-03-04 06:23:03,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:03,445 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:03,445 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:23:03,445 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-04 06:23:03,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 182214944, now seen corresponding path program 1 times [2025-03-04 06:23:03,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:03,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007085459] [2025-03-04 06:23:03,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:03,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-04 06:23:03,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-04 06:23:03,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:03,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:03,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:03,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007085459] [2025-03-04 06:23:03,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007085459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:03,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:03,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:23:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387757215] [2025-03-04 06:23:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:03,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:03,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:03,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:03,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 472 [2025-03-04 06:23:03,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 453 transitions, 952 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:03,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:03,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 472 [2025-03-04 06:23:03,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:03,912 INFO L124 PetriNetUnfolderBase]: 136/3825 cut-off events. [2025-03-04 06:23:03,912 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 06:23:03,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4046 conditions, 3825 events. 136/3825 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 26285 event pairs, 40 based on Foata normal form. 9/3434 useless extension candidates. Maximal degree in co-relation 3630. Up to 113 conditions per place. [2025-03-04 06:23:03,938 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 13 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2025-03-04 06:23:03,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 457 transitions, 991 flow [2025-03-04 06:23:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1375 transitions. [2025-03-04 06:23:03,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971045197740113 [2025-03-04 06:23:03,941 INFO L175 Difference]: Start difference. First operand has 448 places, 453 transitions, 952 flow. Second operand 3 states and 1375 transitions. [2025-03-04 06:23:03,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 457 transitions, 991 flow [2025-03-04 06:23:03,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 457 transitions, 989 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:03,947 INFO L231 Difference]: Finished difference. Result has 450 places, 454 transitions, 962 flow [2025-03-04 06:23:03,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=962, PETRI_PLACES=450, PETRI_TRANSITIONS=454} [2025-03-04 06:23:03,948 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -9 predicate places. [2025-03-04 06:23:03,948 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 454 transitions, 962 flow [2025-03-04 06:23:03,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:03,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:03,949 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] [2025-03-04 06:23:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:23:03,950 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:03,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2048093260, now seen corresponding path program 1 times [2025-03-04 06:23:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013729696] [2025-03-04 06:23:03,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:03,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:23:03,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:23:03,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:03,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:04,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:04,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013729696] [2025-03-04 06:23:04,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013729696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:04,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:04,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039083525] [2025-03-04 06:23:04,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:04,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:04,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:04,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:04,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:05,002 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-04 06:23:05,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 454 transitions, 962 flow. Second operand has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:05,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:05,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-04 06:23:05,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:05,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 333#L1020true, 375#L1053-1true]) [2025-03-04 06:23:05,615 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1104] L1039-3-->L1039: Formula: (and (= |v_t2Thread1of1ForFork0_#t~ret74#1_1| 0) (= (store |v_#pthreadsMutex_40| |v_~#m~0.base_26| (store (select |v_#pthreadsMutex_40| |v_~#m~0.base_26|) |v_~#m~0.offset_26| 0)) |v_#pthreadsMutex_39|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_40|, ~#m~0.base=|v_~#m~0.base_26|, ~#m~0.offset=|v_~#m~0.offset_26|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_39|, ~#m~0.base=|v_~#m~0.base_26|, t2Thread1of1ForFork0_#t~ret74#1=|v_t2Thread1of1ForFork0_#t~ret74#1_1|, ~#m~0.offset=|v_~#m~0.offset_26|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork0_#t~ret74#1][178], [523#true, Black: 512#(= |#race~dequeue_flag~0| 0), 519#true, Black: 517#(= |t1Thread1of1ForFork1_~i~0#1| 0), Black: 521#(= 0 |t2Thread1of1ForFork0_~i~1#1|), 103#L1039true, 465#true, Black: 507#(= |#race~enqueue_flag~0| 0), 204#L1055true]) [2025-03-04 06:23:05,615 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 207 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2025-03-04 06:23:05,615 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2025-03-04 06:23:07,848 INFO L124 PetriNetUnfolderBase]: 3991/24250 cut-off events. [2025-03-04 06:23:07,848 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 06:23:07,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32098 conditions, 24250 events. 3991/24250 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 282487 event pairs, 1492 based on Foata normal form. 0/21673 useless extension candidates. Maximal degree in co-relation 31316. Up to 5596 conditions per place. [2025-03-04 06:23:07,983 INFO L140 encePairwiseOnDemand]: 439/472 looper letters, 83 selfloop transitions, 66 changer transitions 0/533 dead transitions. [2025-03-04 06:23:07,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 533 transitions, 1426 flow [2025-03-04 06:23:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2516 transitions. [2025-03-04 06:23:08,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8884180790960452 [2025-03-04 06:23:08,214 INFO L175 Difference]: Start difference. First operand has 450 places, 454 transitions, 962 flow. Second operand 6 states and 2516 transitions. [2025-03-04 06:23:08,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 533 transitions, 1426 flow [2025-03-04 06:23:08,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 533 transitions, 1424 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:08,223 INFO L231 Difference]: Finished difference. Result has 459 places, 518 transitions, 1414 flow [2025-03-04 06:23:08,223 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=960, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1414, PETRI_PLACES=459, PETRI_TRANSITIONS=518} [2025-03-04 06:23:08,225 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 0 predicate places. [2025-03-04 06:23:08,225 INFO L471 AbstractCegarLoop]: Abstraction has has 459 places, 518 transitions, 1414 flow [2025-03-04 06:23:08,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 397.5) internal successors, (2385), 6 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:08,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:08,227 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] [2025-03-04 06:23:08,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:23:08,227 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:08,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:08,228 INFO L85 PathProgramCache]: Analyzing trace with hash 356132486, now seen corresponding path program 1 times [2025-03-04 06:23:08,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:08,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419866665] [2025-03-04 06:23:08,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:08,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:08,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 06:23:08,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 06:23:08,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:08,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:08,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419866665] [2025-03-04 06:23:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419866665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:08,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:08,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:23:08,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542156897] [2025-03-04 06:23:08,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:08,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:08,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:08,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:23:08,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 472 [2025-03-04 06:23:08,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 518 transitions, 1414 flow. Second operand has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:08,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:08,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 472 [2025-03-04 06:23:08,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:08,629 INFO L124 PetriNetUnfolderBase]: 86/2843 cut-off events. [2025-03-04 06:23:08,629 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-03-04 06:23:08,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3390 conditions, 2843 events. 86/2843 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17270 event pairs, 17 based on Foata normal form. 4/2583 useless extension candidates. Maximal degree in co-relation 2911. Up to 169 conditions per place. [2025-03-04 06:23:08,638 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 14 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2025-03-04 06:23:08,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 452 transitions, 1067 flow [2025-03-04 06:23:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2025-03-04 06:23:08,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9703389830508474 [2025-03-04 06:23:08,640 INFO L175 Difference]: Start difference. First operand has 459 places, 518 transitions, 1414 flow. Second operand 3 states and 1374 transitions. [2025-03-04 06:23:08,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 452 transitions, 1067 flow [2025-03-04 06:23:08,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 452 transitions, 977 flow, removed 21 selfloop flow, removed 12 redundant places. [2025-03-04 06:23:08,647 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 941 flow [2025-03-04 06:23:08,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2025-03-04 06:23:08,648 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-04 06:23:08,648 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 941 flow [2025-03-04 06:23:08,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.0) internal successors, (1362), 3 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:08,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:08,649 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] [2025-03-04 06:23:08,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:23:08,649 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-04 06:23:08,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:08,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1178204073, now seen corresponding path program 1 times [2025-03-04 06:23:08,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:08,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019808783] [2025-03-04 06:23:08,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:08,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:08,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 06:23:08,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 06:23:08,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:08,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019808783] [2025-03-04 06:23:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019808783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:08,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546435316] [2025-03-04 06:23:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:08,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:08,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:09,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 472 [2025-03-04 06:23:09,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:09,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:09,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 472 [2025-03-04 06:23:09,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:09,854 INFO L124 PetriNetUnfolderBase]: 693/3437 cut-off events. [2025-03-04 06:23:09,854 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2025-03-04 06:23:09,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5268 conditions, 3437 events. 693/3437 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 23994 event pairs, 604 based on Foata normal form. 0/3174 useless extension candidates. Maximal degree in co-relation 4400. Up to 1497 conditions per place. [2025-03-04 06:23:09,862 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/458 dead transitions. [2025-03-04 06:23:09,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 458 transitions, 1225 flow [2025-03-04 06:23:09,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2216 transitions. [2025-03-04 06:23:09,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7824858757062146 [2025-03-04 06:23:09,865 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 941 flow. Second operand 6 states and 2216 transitions. [2025-03-04 06:23:09,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 458 transitions, 1225 flow [2025-03-04 06:23:09,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 458 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:09,871 INFO L231 Difference]: Finished difference. Result has 448 places, 446 transitions, 943 flow [2025-03-04 06:23:09,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=933, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=448, PETRI_TRANSITIONS=446} [2025-03-04 06:23:09,872 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -11 predicate places. [2025-03-04 06:23:09,872 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 446 transitions, 943 flow [2025-03-04 06:23:09,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 353.8333333333333) internal successors, (2123), 6 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:09,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:09,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] [2025-03-04 06:23:09,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:23:09,873 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-04 06:23:09,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:09,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1063033939, now seen corresponding path program 1 times [2025-03-04 06:23:09,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:09,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63031774] [2025-03-04 06:23:09,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:09,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 06:23:09,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 06:23:09,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:09,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:10,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63031774] [2025-03-04 06:23:10,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63031774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:10,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:10,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043539290] [2025-03-04 06:23:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:10,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:10,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:10,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:10,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:10,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-04 06:23:10,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 446 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:10,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:10,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-04 06:23:10,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:11,112 INFO L124 PetriNetUnfolderBase]: 297/2792 cut-off events. [2025-03-04 06:23:11,112 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-03-04 06:23:11,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3596 conditions, 2792 events. 297/2792 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 16355 event pairs, 214 based on Foata normal form. 0/2562 useless extension candidates. Maximal degree in co-relation 2960. Up to 533 conditions per place. [2025-03-04 06:23:11,120 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/457 dead transitions. [2025-03-04 06:23:11,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 457 transitions, 1101 flow [2025-03-04 06:23:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2531 transitions. [2025-03-04 06:23:11,123 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8937146892655368 [2025-03-04 06:23:11,123 INFO L175 Difference]: Start difference. First operand has 448 places, 446 transitions, 943 flow. Second operand 6 states and 2531 transitions. [2025-03-04 06:23:11,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 457 transitions, 1101 flow [2025-03-04 06:23:11,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 457 transitions, 1091 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:11,129 INFO L231 Difference]: Finished difference. Result has 447 places, 445 transitions, 941 flow [2025-03-04 06:23:11,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=931, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=941, PETRI_PLACES=447, PETRI_TRANSITIONS=445} [2025-03-04 06:23:11,130 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -12 predicate places. [2025-03-04 06:23:11,130 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 445 transitions, 941 flow [2025-03-04 06:23:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 415.1666666666667) internal successors, (2491), 6 states have internal predecessors, (2491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:11,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:11,131 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] [2025-03-04 06:23:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:23:11,131 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-04 06:23:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:11,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2066489295, now seen corresponding path program 1 times [2025-03-04 06:23:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245429814] [2025-03-04 06:23:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:11,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:11,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 06:23:11,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 06:23:11,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:11,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:23:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245429814] [2025-03-04 06:23:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245429814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53936337] [2025-03-04 06:23:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:11,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:11,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:11,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-04 06:23:11,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 445 transitions, 941 flow. Second operand has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:11,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:11,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-04 06:23:11,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:12,413 INFO L124 PetriNetUnfolderBase]: 567/3295 cut-off events. [2025-03-04 06:23:12,413 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-04 06:23:12,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4777 conditions, 3295 events. 567/3295 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22641 event pairs, 478 based on Foata normal form. 0/3048 useless extension candidates. Maximal degree in co-relation 4115. Up to 1203 conditions per place. [2025-03-04 06:23:12,424 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 101 selfloop transitions, 5 changer transitions 0/456 dead transitions. [2025-03-04 06:23:12,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 456 transitions, 1183 flow [2025-03-04 06:23:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2321 transitions. [2025-03-04 06:23:12,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8195621468926554 [2025-03-04 06:23:12,428 INFO L175 Difference]: Start difference. First operand has 447 places, 445 transitions, 941 flow. Second operand 6 states and 2321 transitions. [2025-03-04 06:23:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 456 transitions, 1183 flow [2025-03-04 06:23:12,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 456 transitions, 1173 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:12,435 INFO L231 Difference]: Finished difference. Result has 446 places, 444 transitions, 939 flow [2025-03-04 06:23:12,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=939, PETRI_PLACES=446, PETRI_TRANSITIONS=444} [2025-03-04 06:23:12,436 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -13 predicate places. [2025-03-04 06:23:12,436 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 444 transitions, 939 flow [2025-03-04 06:23:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 375.5) internal successors, (2253), 6 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:12,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:12,437 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] [2025-03-04 06:23:12,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:23:12,437 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-04 06:23:12,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1821259648, now seen corresponding path program 1 times [2025-03-04 06:23:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:12,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135207068] [2025-03-04 06:23:12,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:12,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:12,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 06:23:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 06:23:12,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:12,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 06:23:12,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135207068] [2025-03-04 06:23:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135207068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672509773] [2025-03-04 06:23:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:12,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:12,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:12,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:13,361 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-04 06:23:13,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 444 transitions, 939 flow. Second operand has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:13,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:13,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-04 06:23:13,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:13,876 INFO L124 PetriNetUnfolderBase]: 657/3377 cut-off events. [2025-03-04 06:23:13,877 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2025-03-04 06:23:13,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5129 conditions, 3377 events. 657/3377 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23392 event pairs, 568 based on Foata normal form. 0/3146 useless extension candidates. Maximal degree in co-relation 4319. Up to 1413 conditions per place. [2025-03-04 06:23:13,889 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/455 dead transitions. [2025-03-04 06:23:13,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 455 transitions, 1211 flow [2025-03-04 06:23:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-04 06:23:13,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-04 06:23:13,893 INFO L175 Difference]: Start difference. First operand has 446 places, 444 transitions, 939 flow. Second operand 6 states and 2246 transitions. [2025-03-04 06:23:13,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 455 transitions, 1211 flow [2025-03-04 06:23:13,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 455 transitions, 1201 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:13,899 INFO L231 Difference]: Finished difference. Result has 445 places, 443 transitions, 937 flow [2025-03-04 06:23:13,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=937, PETRI_PLACES=445, PETRI_TRANSITIONS=443} [2025-03-04 06:23:13,900 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -14 predicate places. [2025-03-04 06:23:13,900 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 443 transitions, 937 flow [2025-03-04 06:23:13,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.3333333333333) internal successors, (2168), 6 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:13,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:13,905 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] [2025-03-04 06:23:13,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 06:23:13,905 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-04 06:23:13,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:13,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1293842287, now seen corresponding path program 1 times [2025-03-04 06:23:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045863772] [2025-03-04 06:23:13,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:13,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:13,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 06:23:13,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 06:23:13,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:13,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 06:23:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045863772] [2025-03-04 06:23:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045863772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:14,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112570083] [2025-03-04 06:23:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:14,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:14,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:14,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:14,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:14,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-04 06:23:14,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 443 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:14,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:14,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-04 06:23:14,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:15,174 INFO L124 PetriNetUnfolderBase]: 651/3363 cut-off events. [2025-03-04 06:23:15,174 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2025-03-04 06:23:15,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5105 conditions, 3363 events. 651/3363 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23230 event pairs, 562 based on Foata normal form. 0/3132 useless extension candidates. Maximal degree in co-relation 4305. Up to 1407 conditions per place. [2025-03-04 06:23:15,184 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 116 selfloop transitions, 5 changer transitions 0/454 dead transitions. [2025-03-04 06:23:15,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 449 places, 454 transitions, 1209 flow [2025-03-04 06:23:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2246 transitions. [2025-03-04 06:23:15,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7930790960451978 [2025-03-04 06:23:15,187 INFO L175 Difference]: Start difference. First operand has 445 places, 443 transitions, 937 flow. Second operand 6 states and 2246 transitions. [2025-03-04 06:23:15,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 449 places, 454 transitions, 1209 flow [2025-03-04 06:23:15,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 454 transitions, 1199 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:15,192 INFO L231 Difference]: Finished difference. Result has 444 places, 442 transitions, 935 flow [2025-03-04 06:23:15,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=442} [2025-03-04 06:23:15,193 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-04 06:23:15,193 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 442 transitions, 935 flow [2025-03-04 06:23:15,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 362.1666666666667) internal successors, (2173), 6 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:15,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:15,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:15,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:23:15,194 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-04 06:23:15,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1910331373, now seen corresponding path program 1 times [2025-03-04 06:23:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423875977] [2025-03-04 06:23:15,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:15,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:15,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-04 06:23:15,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-04 06:23:15,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:15,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 06:23:15,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:15,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423875977] [2025-03-04 06:23:15,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423875977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:15,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848587910] [2025-03-04 06:23:15,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:15,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:15,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:15,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:15,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:15,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 472 [2025-03-04 06:23:15,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 442 transitions, 935 flow. Second operand has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:15,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:15,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 472 [2025-03-04 06:23:15,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:16,155 INFO L124 PetriNetUnfolderBase]: 672/3379 cut-off events. [2025-03-04 06:23:16,155 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-03-04 06:23:16,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5181 conditions, 3379 events. 672/3379 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 23483 event pairs, 583 based on Foata normal form. 0/3154 useless extension candidates. Maximal degree in co-relation 4974. Up to 1453 conditions per place. [2025-03-04 06:23:16,167 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 122 selfloop transitions, 5 changer transitions 0/453 dead transitions. [2025-03-04 06:23:16,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 453 transitions, 1219 flow [2025-03-04 06:23:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2221 transitions. [2025-03-04 06:23:16,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7842514124293786 [2025-03-04 06:23:16,181 INFO L175 Difference]: Start difference. First operand has 444 places, 442 transitions, 935 flow. Second operand 6 states and 2221 transitions. [2025-03-04 06:23:16,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 453 transitions, 1219 flow [2025-03-04 06:23:16,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 453 transitions, 1209 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:16,194 INFO L231 Difference]: Finished difference. Result has 443 places, 441 transitions, 933 flow [2025-03-04 06:23:16,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=933, PETRI_PLACES=443, PETRI_TRANSITIONS=441} [2025-03-04 06:23:16,195 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -16 predicate places. [2025-03-04 06:23:16,195 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 441 transitions, 933 flow [2025-03-04 06:23:16,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 358.1666666666667) internal successors, (2149), 6 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:16,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:16,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:16,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 06:23:16,196 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-04 06:23:16,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:16,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1499016472, now seen corresponding path program 1 times [2025-03-04 06:23:16,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:16,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205928482] [2025-03-04 06:23:16,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:16,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:16,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:23:16,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:23:16,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:16,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:16,323 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:16,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205928482] [2025-03-04 06:23:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205928482] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:16,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430482216] [2025-03-04 06:23:16,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:16,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:16,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:16,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:23:16,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:23:16,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-04 06:23:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-04 06:23:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:16,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:23:16,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 06:23:16,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:23:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430482216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:23:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 06:23:16,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274781569] [2025-03-04 06:23:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:16,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:16,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:16,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-04 06:23:16,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 441 transitions, 933 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:16,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:16,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-04 06:23:16,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:16,698 INFO L124 PetriNetUnfolderBase]: 64/1688 cut-off events. [2025-03-04 06:23:16,698 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 06:23:16,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1892 conditions, 1688 events. 64/1688 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7490 event pairs, 29 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1461. Up to 79 conditions per place. [2025-03-04 06:23:16,702 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/443 dead transitions. [2025-03-04 06:23:16,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 443 transitions, 973 flow [2025-03-04 06:23:16,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:16,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1365 transitions. [2025-03-04 06:23:16,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639830508474576 [2025-03-04 06:23:16,704 INFO L175 Difference]: Start difference. First operand has 443 places, 441 transitions, 933 flow. Second operand 3 states and 1365 transitions. [2025-03-04 06:23:16,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 443 transitions, 973 flow [2025-03-04 06:23:16,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 443 transitions, 963 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:16,708 INFO L231 Difference]: Finished difference. Result has 439 places, 440 transitions, 925 flow [2025-03-04 06:23:16,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=439, PETRI_TRANSITIONS=440} [2025-03-04 06:23:16,709 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -20 predicate places. [2025-03-04 06:23:16,709 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 440 transitions, 925 flow [2025-03-04 06:23:16,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:16,710 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:16,710 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:16,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:23:16,910 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-04 06:23:16,911 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-04 06:23:16,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:16,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1387476388, now seen corresponding path program 1 times [2025-03-04 06:23:16,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:16,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651487390] [2025-03-04 06:23:16,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:16,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:16,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 06:23:16,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 06:23:16,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:16,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:17,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651487390] [2025-03-04 06:23:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651487390] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:17,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430676493] [2025-03-04 06:23:17,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:17,018 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-04 06:23:17,020 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-04 06:23:17,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-04 06:23:17,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-04 06:23:17,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:17,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:17,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:23:17,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 06:23:17,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:23:17,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430676493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:17,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:23:17,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 06:23:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932435437] [2025-03-04 06:23:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:17,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:17,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:17,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:17,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-04 06:23:17,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 440 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:17,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:17,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-04 06:23:17,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:17,497 INFO L124 PetriNetUnfolderBase]: 136/3370 cut-off events. [2025-03-04 06:23:17,497 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2025-03-04 06:23:17,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3370 events. 136/3370 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 22195 event pairs, 38 based on Foata normal form. 1/3116 useless extension candidates. Maximal degree in co-relation 3252. Up to 129 conditions per place. [2025-03-04 06:23:17,508 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 17 selfloop transitions, 7 changer transitions 1/448 dead transitions. [2025-03-04 06:23:17,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 448 transitions, 999 flow [2025-03-04 06:23:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2025-03-04 06:23:17,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675141242937854 [2025-03-04 06:23:17,510 INFO L175 Difference]: Start difference. First operand has 439 places, 440 transitions, 925 flow. Second operand 3 states and 1370 transitions. [2025-03-04 06:23:17,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 448 transitions, 999 flow [2025-03-04 06:23:17,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 448 transitions, 995 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:17,516 INFO L231 Difference]: Finished difference. Result has 441 places, 445 transitions, 977 flow [2025-03-04 06:23:17,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=977, PETRI_PLACES=441, PETRI_TRANSITIONS=445} [2025-03-04 06:23:17,516 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-04 06:23:17,516 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 445 transitions, 977 flow [2025-03-04 06:23:17,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:17,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:17,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] [2025-03-04 06:23:17,523 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-04 06:23:17,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-04 06:23:17,717 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-04 06:23:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash 834769128, now seen corresponding path program 1 times [2025-03-04 06:23:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:17,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584264973] [2025-03-04 06:23:17,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:17,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:17,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 06:23:17,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 06:23:17,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:17,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584264973] [2025-03-04 06:23:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584264973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989805031] [2025-03-04 06:23:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:17,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:17,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:17,839 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-04 06:23:17,841 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-04 06:23:17,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-04 06:23:18,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-04 06:23:18,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:18,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:18,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:23:18,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:18,064 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-04 06:23:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 06:23:18,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:23:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989805031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:23:18,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-04 06:23:18,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849798484] [2025-03-04 06:23:18,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:18,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:18,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:18,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 472 [2025-03-04 06:23:18,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 445 transitions, 977 flow. Second operand has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:18,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:18,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 472 [2025-03-04 06:23:18,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:18,212 INFO L124 PetriNetUnfolderBase]: 33/1428 cut-off events. [2025-03-04 06:23:18,213 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 06:23:18,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543 conditions, 1428 events. 33/1428 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 5282 event pairs, 6 based on Foata normal form. 2/1356 useless extension candidates. Maximal degree in co-relation 1141. Up to 26 conditions per place. [2025-03-04 06:23:18,216 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 7 selfloop transitions, 3 changer transitions 5/438 dead transitions. [2025-03-04 06:23:18,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 954 flow [2025-03-04 06:23:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1378 transitions. [2025-03-04 06:23:18,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9731638418079096 [2025-03-04 06:23:18,220 INFO L175 Difference]: Start difference. First operand has 441 places, 445 transitions, 977 flow. Second operand 3 states and 1378 transitions. [2025-03-04 06:23:18,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 954 flow [2025-03-04 06:23:18,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 438 transitions, 934 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 06:23:18,225 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 899 flow [2025-03-04 06:23:18,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-04 06:23:18,225 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -22 predicate places. [2025-03-04 06:23:18,226 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 899 flow [2025-03-04 06:23:18,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.0) internal successors, (1371), 3 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:18,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:18,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:18,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:23:18,427 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-04 06:23:18,427 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-04 06:23:18,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash -229473674, now seen corresponding path program 1 times [2025-03-04 06:23:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555639023] [2025-03-04 06:23:18,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:18,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 06:23:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 06:23:18,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:18,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:18,541 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:18,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:18,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555639023] [2025-03-04 06:23:18,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555639023] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:18,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017252177] [2025-03-04 06:23:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:18,544 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-04 06:23:18,545 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-04 06:23:18,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-04 06:23:18,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-04 06:23:18,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:18,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:18,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:23:18,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:18,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:23:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 06:23:18,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017252177] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:23:18,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:23:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:23:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59961300] [2025-03-04 06:23:18,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:23:18,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:23:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:18,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:23:18,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:23:18,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-04 06:23:18,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 899 flow. Second operand has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:18,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:18,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-04 06:23:18,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:19,151 INFO L124 PetriNetUnfolderBase]: 44/1399 cut-off events. [2025-03-04 06:23:19,151 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:23:19,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1557 conditions, 1399 events. 44/1399 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 3399 event pairs, 10 based on Foata normal form. 4/1326 useless extension candidates. Maximal degree in co-relation 986. Up to 35 conditions per place. [2025-03-04 06:23:19,155 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 20 selfloop transitions, 9 changer transitions 0/446 dead transitions. [2025-03-04 06:23:19,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 446 transitions, 1003 flow [2025-03-04 06:23:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:23:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:23:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4081 transitions. [2025-03-04 06:23:19,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9606873822975518 [2025-03-04 06:23:19,158 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 899 flow. Second operand 9 states and 4081 transitions. [2025-03-04 06:23:19,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 446 transitions, 1003 flow [2025-03-04 06:23:19,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 446 transitions, 994 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 06:23:19,163 INFO L231 Difference]: Finished difference. Result has 441 places, 437 transitions, 940 flow [2025-03-04 06:23:19,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=940, PETRI_PLACES=441, PETRI_TRANSITIONS=437} [2025-03-04 06:23:19,164 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -18 predicate places. [2025-03-04 06:23:19,164 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 437 transitions, 940 flow [2025-03-04 06:23:19,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 452.2) internal successors, (4522), 10 states have internal predecessors, (4522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:19,165 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:19,166 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] [2025-03-04 06:23:19,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 06:23:19,366 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-04 06:23:19,366 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-04 06:23:19,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:19,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1469125228, now seen corresponding path program 2 times [2025-03-04 06:23:19,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:19,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744386355] [2025-03-04 06:23:19,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:23:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:19,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 407 statements into 2 equivalence classes. [2025-03-04 06:23:19,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 407 statements. [2025-03-04 06:23:19,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:23:19,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:19,662 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2025-03-04 06:23:19,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:19,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744386355] [2025-03-04 06:23:19,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744386355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:19,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:19,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:19,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423921899] [2025-03-04 06:23:19,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:19,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:19,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:19,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:19,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:20,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-04 06:23:20,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 437 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:20,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:20,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-04 06:23:20,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:20,381 INFO L124 PetriNetUnfolderBase]: 130/1477 cut-off events. [2025-03-04 06:23:20,381 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-04 06:23:20,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 1477 events. 130/1477 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4521 event pairs, 95 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 1266. Up to 303 conditions per place. [2025-03-04 06:23:20,384 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/440 dead transitions. [2025-03-04 06:23:20,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1074 flow [2025-03-04 06:23:20,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:20,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-04 06:23:20,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-04 06:23:20,387 INFO L175 Difference]: Start difference. First operand has 441 places, 437 transitions, 940 flow. Second operand 6 states and 2487 transitions. [2025-03-04 06:23:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1074 flow [2025-03-04 06:23:20,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1068 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:20,391 INFO L231 Difference]: Finished difference. Result has 444 places, 436 transitions, 942 flow [2025-03-04 06:23:20,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=444, PETRI_TRANSITIONS=436} [2025-03-04 06:23:20,392 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, -15 predicate places. [2025-03-04 06:23:20,392 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 436 transitions, 942 flow [2025-03-04 06:23:20,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:20,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:20,393 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] [2025-03-04 06:23:20,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 06:23:20,393 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-04 06:23:20,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:20,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1950634249, now seen corresponding path program 1 times [2025-03-04 06:23:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:20,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333036012] [2025-03-04 06:23:20,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:20,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 06:23:20,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 06:23:20,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:20,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 06:23:20,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333036012] [2025-03-04 06:23:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333036012] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427420202] [2025-03-04 06:23:20,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:20,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:20,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:20,691 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-04 06:23:20,695 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-04 06:23:20,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-04 06:23:20,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-04 06:23:20,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:20,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:20,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:23:20,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:21,181 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 06:23:21,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:23:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 06:23:21,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427420202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:23:21,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:23:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:23:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137427976] [2025-03-04 06:23:21,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:23:21,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:23:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:23:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:23:21,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-04 06:23:21,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 436 transitions, 942 flow. Second operand has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:21,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:21,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-04 06:23:21,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:21,932 INFO L124 PetriNetUnfolderBase]: 70/2163 cut-off events. [2025-03-04 06:23:21,932 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 06:23:21,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 2163 events. 70/2163 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 4837 event pairs, 10 based on Foata normal form. 8/2090 useless extension candidates. Maximal degree in co-relation 1897. Up to 35 conditions per place. [2025-03-04 06:23:21,940 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 36 selfloop transitions, 21 changer transitions 0/473 dead transitions. [2025-03-04 06:23:21,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 473 transitions, 1220 flow [2025-03-04 06:23:21,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:23:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:23:21,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9511 transitions. [2025-03-04 06:23:21,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95954398708636 [2025-03-04 06:23:21,950 INFO L175 Difference]: Start difference. First operand has 444 places, 436 transitions, 942 flow. Second operand 21 states and 9511 transitions. [2025-03-04 06:23:21,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 473 transitions, 1220 flow [2025-03-04 06:23:21,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 473 transitions, 1210 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:21,957 INFO L231 Difference]: Finished difference. Result has 464 places, 449 transitions, 1062 flow [2025-03-04 06:23:21,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1062, PETRI_PLACES=464, PETRI_TRANSITIONS=449} [2025-03-04 06:23:21,958 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 5 predicate places. [2025-03-04 06:23:21,959 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 449 transitions, 1062 flow [2025-03-04 06:23:21,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 452.1111111111111) internal successors, (8138), 18 states have internal predecessors, (8138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:21,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:21,962 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] [2025-03-04 06:23:21,970 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-04 06:23:22,162 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-04 06:23:22,163 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-04 06:23:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:22,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1071825591, now seen corresponding path program 2 times [2025-03-04 06:23:22,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:22,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065076456] [2025-03-04 06:23:22,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:23:22,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:22,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 713 statements into 2 equivalence classes. [2025-03-04 06:23:22,236 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 713 statements. [2025-03-04 06:23:22,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:23:22,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:22,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-04 06:23:22,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065076456] [2025-03-04 06:23:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065076456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840307879] [2025-03-04 06:23:22,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:22,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:22,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:22,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:23,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 472 [2025-03-04 06:23:23,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 449 transitions, 1062 flow. Second operand has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:23,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:23,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 472 [2025-03-04 06:23:23,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:23,376 INFO L124 PetriNetUnfolderBase]: 218/2305 cut-off events. [2025-03-04 06:23:23,376 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-04 06:23:23,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2305 events. 218/2305 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 6855 event pairs, 175 based on Foata normal form. 0/2229 useless extension candidates. Maximal degree in co-relation 2614. Up to 543 conditions per place. [2025-03-04 06:23:23,388 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 57 selfloop transitions, 5 changer transitions 0/452 dead transitions. [2025-03-04 06:23:23,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 452 transitions, 1196 flow [2025-03-04 06:23:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2025-03-04 06:23:23,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878177966101695 [2025-03-04 06:23:23,391 INFO L175 Difference]: Start difference. First operand has 464 places, 449 transitions, 1062 flow. Second operand 6 states and 2487 transitions. [2025-03-04 06:23:23,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 452 transitions, 1196 flow [2025-03-04 06:23:23,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 452 transitions, 1172 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:23:23,398 INFO L231 Difference]: Finished difference. Result has 462 places, 448 transitions, 1046 flow [2025-03-04 06:23:23,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1046, PETRI_PLACES=462, PETRI_TRANSITIONS=448} [2025-03-04 06:23:23,398 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-04 06:23:23,398 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 448 transitions, 1046 flow [2025-03-04 06:23:23,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 410.6666666666667) internal successors, (2464), 6 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:23,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:23,399 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] [2025-03-04 06:23:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 06:23:23,399 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-04 06:23:23,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:23,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1315803186, now seen corresponding path program 1 times [2025-03-04 06:23:23,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:23,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027871548] [2025-03-04 06:23:23,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:23,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:23,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-03-04 06:23:23,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-03-04 06:23:23,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:23,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:23,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-04 06:23:23,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:23,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027871548] [2025-03-04 06:23:23,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027871548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:23,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:23,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:23:23,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111183072] [2025-03-04 06:23:23,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:23,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:23:23,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:23,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:23:23,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:23:23,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-04 06:23:23,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 448 transitions, 1046 flow. Second operand has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:23,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:23,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-04 06:23:23,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:24,178 INFO L124 PetriNetUnfolderBase]: 60/2597 cut-off events. [2025-03-04 06:23:24,178 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-04 06:23:24,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2885 conditions, 2597 events. 60/2597 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 8023 event pairs, 17 based on Foata normal form. 4/2481 useless extension candidates. Maximal degree in co-relation 1943. Up to 59 conditions per place. [2025-03-04 06:23:24,187 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 14 selfloop transitions, 4 changer transitions 0/453 dead transitions. [2025-03-04 06:23:24,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 453 transitions, 1094 flow [2025-03-04 06:23:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 06:23:24,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 06:23:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1819 transitions. [2025-03-04 06:23:24,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9634533898305084 [2025-03-04 06:23:24,189 INFO L175 Difference]: Start difference. First operand has 462 places, 448 transitions, 1046 flow. Second operand 4 states and 1819 transitions. [2025-03-04 06:23:24,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 453 transitions, 1094 flow [2025-03-04 06:23:24,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 460 places, 453 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:24,195 INFO L231 Difference]: Finished difference. Result has 462 places, 451 transitions, 1064 flow [2025-03-04 06:23:24,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1036, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=451} [2025-03-04 06:23:24,196 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-04 06:23:24,196 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 451 transitions, 1064 flow [2025-03-04 06:23:24,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 452.5) internal successors, (1810), 4 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:24,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:24,197 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] [2025-03-04 06:23:24,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 06:23:24,197 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-04 06:23:24,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:24,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2001715536, now seen corresponding path program 1 times [2025-03-04 06:23:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147069448] [2025-03-04 06:23:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:24,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-04 06:23:24,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-04 06:23:24,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:24,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2612 trivial. 0 not checked. [2025-03-04 06:23:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147069448] [2025-03-04 06:23:24,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147069448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918170044] [2025-03-04 06:23:24,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:24,550 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-04 06:23:24,551 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-04 06:23:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-04 06:23:24,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-04 06:23:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:24,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 2218 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:23:24,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2613 trivial. 0 not checked. [2025-03-04 06:23:25,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:23:25,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918170044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:25,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:23:25,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 06:23:25,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075043713] [2025-03-04 06:23:25,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:25,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:25,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:25,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:25,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:25,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-04 06:23:25,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 451 transitions, 1064 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:25,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:25,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-04 06:23:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:25,363 INFO L124 PetriNetUnfolderBase]: 53/2586 cut-off events. [2025-03-04 06:23:25,363 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2025-03-04 06:23:25,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 2586 events. 53/2586 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 7889 event pairs, 12 based on Foata normal form. 0/2470 useless extension candidates. Maximal degree in co-relation 2354. Up to 44 conditions per place. [2025-03-04 06:23:25,369 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 12 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2025-03-04 06:23:25,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 451 transitions, 1093 flow [2025-03-04 06:23:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-04 06:23:25,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-04 06:23:25,371 INFO L175 Difference]: Start difference. First operand has 462 places, 451 transitions, 1064 flow. Second operand 3 states and 1362 transitions. [2025-03-04 06:23:25,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 451 transitions, 1093 flow [2025-03-04 06:23:25,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 451 transitions, 1091 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:23:25,376 INFO L231 Difference]: Finished difference. Result has 462 places, 450 transitions, 1064 flow [2025-03-04 06:23:25,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1064, PETRI_PLACES=462, PETRI_TRANSITIONS=450} [2025-03-04 06:23:25,377 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 3 predicate places. [2025-03-04 06:23:25,377 INFO L471 AbstractCegarLoop]: Abstraction has has 462 places, 450 transitions, 1064 flow [2025-03-04 06:23:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:25,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:25,377 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] [2025-03-04 06:23:25,386 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-04 06:23:25,578 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-04 06:23:25,578 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-04 06:23:25,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1413094414, now seen corresponding path program 1 times [2025-03-04 06:23:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:25,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791293288] [2025-03-04 06:23:25,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:25,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:25,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-04 06:23:25,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-04 06:23:25,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:25,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 06:23:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791293288] [2025-03-04 06:23:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791293288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412895221] [2025-03-04 06:23:26,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:26,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:26,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:26,355 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-04 06:23:26,355 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-04 06:23:26,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 734 statements into 1 equivalence classes. [2025-03-04 06:23:26,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 734 of 734 statements. [2025-03-04 06:23:26,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:26,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:26,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 2232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:23:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 06:23:27,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:23:27,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2613 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-03-04 06:23:27,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412895221] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:23:27,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:23:27,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:23:27,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055981936] [2025-03-04 06:23:27,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:23:27,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:23:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:27,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:23:27,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:23:27,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-04 06:23:27,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 450 transitions, 1064 flow. Second operand has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:27,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:27,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-04 06:23:27,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:29,043 INFO L124 PetriNetUnfolderBase]: 122/4145 cut-off events. [2025-03-04 06:23:29,043 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2025-03-04 06:23:29,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4896 conditions, 4145 events. 122/4145 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11092 event pairs, 10 based on Foata normal form. 16/4028 useless extension candidates. Maximal degree in co-relation 4835. Up to 67 conditions per place. [2025-03-04 06:23:29,052 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 68 selfloop transitions, 45 changer transitions 0/530 dead transitions. [2025-03-04 06:23:29,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 530 transitions, 1734 flow [2025-03-04 06:23:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:23:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:23:29,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 20371 transitions. [2025-03-04 06:23:29,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9590866290018832 [2025-03-04 06:23:29,061 INFO L175 Difference]: Start difference. First operand has 462 places, 450 transitions, 1064 flow. Second operand 45 states and 20371 transitions. [2025-03-04 06:23:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 530 transitions, 1734 flow [2025-03-04 06:23:29,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 504 places, 530 transitions, 1730 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:23:29,068 INFO L231 Difference]: Finished difference. Result has 513 places, 475 transitions, 1362 flow [2025-03-04 06:23:29,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1362, PETRI_PLACES=513, PETRI_TRANSITIONS=475} [2025-03-04 06:23:29,069 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-04 06:23:29,069 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 475 transitions, 1362 flow [2025-03-04 06:23:29,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 452.05882352941177) internal successors, (15370), 34 states have internal predecessors, (15370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:29,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:29,072 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] [2025-03-04 06:23:29,082 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-04 06:23:29,272 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-04 06:23:29,272 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-04 06:23:29,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -397418418, now seen corresponding path program 2 times [2025-03-04 06:23:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440114463] [2025-03-04 06:23:29,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:23:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:29,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1334 statements into 2 equivalence classes. [2025-03-04 06:23:29,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 197 of 1334 statements. [2025-03-04 06:23:29,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:23:29,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-04 06:23:29,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:29,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440114463] [2025-03-04 06:23:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440114463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144934874] [2025-03-04 06:23:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:29,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:29,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:29,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:30,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 472 [2025-03-04 06:23:30,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 475 transitions, 1362 flow. Second operand has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:30,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:30,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 472 [2025-03-04 06:23:30,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:31,236 INFO L124 PetriNetUnfolderBase]: 466/4463 cut-off events. [2025-03-04 06:23:31,236 INFO L125 PetriNetUnfolderBase]: For 577/577 co-relation queries the response was YES. [2025-03-04 06:23:31,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6885 conditions, 4463 events. 466/4463 cut-off events. For 577/577 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15509 event pairs, 353 based on Foata normal form. 0/4371 useless extension candidates. Maximal degree in co-relation 5450. Up to 1085 conditions per place. [2025-03-04 06:23:31,253 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 64 selfloop transitions, 6 changer transitions 0/476 dead transitions. [2025-03-04 06:23:31,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 476 transitions, 1508 flow [2025-03-04 06:23:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2437 transitions. [2025-03-04 06:23:31,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8605225988700564 [2025-03-04 06:23:31,255 INFO L175 Difference]: Start difference. First operand has 513 places, 475 transitions, 1362 flow. Second operand 6 states and 2437 transitions. [2025-03-04 06:23:31,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 476 transitions, 1508 flow [2025-03-04 06:23:31,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 476 transitions, 1452 flow, removed 10 selfloop flow, removed 18 redundant places. [2025-03-04 06:23:31,271 INFO L231 Difference]: Finished difference. Result has 497 places, 472 transitions, 1312 flow [2025-03-04 06:23:31,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=492, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1312, PETRI_PLACES=497, PETRI_TRANSITIONS=472} [2025-03-04 06:23:31,271 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 38 predicate places. [2025-03-04 06:23:31,272 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 472 transitions, 1312 flow [2025-03-04 06:23:31,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 400.6666666666667) internal successors, (2404), 6 states have internal predecessors, (2404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:31,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:31,273 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] [2025-03-04 06:23:31,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 06:23:31,273 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-04 06:23:31,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1749416276, now seen corresponding path program 1 times [2025-03-04 06:23:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:31,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517700869] [2025-03-04 06:23:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:31,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-04 06:23:31,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-04 06:23:31,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:31,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12617 trivial. 0 not checked. [2025-03-04 06:23:32,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517700869] [2025-03-04 06:23:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517700869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783601245] [2025-03-04 06:23:32,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:32,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:32,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:32,083 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-04 06:23:32,084 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-04 06:23:32,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1338 statements into 1 equivalence classes. [2025-03-04 06:23:32,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1338 of 1338 statements. [2025-03-04 06:23:32,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:32,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:32,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 4154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 06:23:32,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 12618 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12618 trivial. 0 not checked. [2025-03-04 06:23:32,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 06:23:32,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783601245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:32,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 06:23:32,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 06:23:32,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311290413] [2025-03-04 06:23:32,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:32,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:23:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:32,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:23:32,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:32,899 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 472 [2025-03-04 06:23:32,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 472 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:32,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:32,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 472 [2025-03-04 06:23:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:33,751 INFO L124 PetriNetUnfolderBase]: 67/4060 cut-off events. [2025-03-04 06:23:33,751 INFO L125 PetriNetUnfolderBase]: For 530/530 co-relation queries the response was YES. [2025-03-04 06:23:33,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 4060 events. 67/4060 cut-off events. For 530/530 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 10157 event pairs, 10 based on Foata normal form. 0/3956 useless extension candidates. Maximal degree in co-relation 3825. Up to 60 conditions per place. [2025-03-04 06:23:33,765 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 9 selfloop transitions, 0 changer transitions 5/472 dead transitions. [2025-03-04 06:23:33,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 472 transitions, 1341 flow [2025-03-04 06:23:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:23:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:23:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2025-03-04 06:23:33,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961864406779661 [2025-03-04 06:23:33,767 INFO L175 Difference]: Start difference. First operand has 497 places, 472 transitions, 1312 flow. Second operand 3 states and 1362 transitions. [2025-03-04 06:23:33,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 472 transitions, 1341 flow [2025-03-04 06:23:33,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 472 transitions, 1329 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:33,775 INFO L231 Difference]: Finished difference. Result has 493 places, 467 transitions, 1290 flow [2025-03-04 06:23:33,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1290, PETRI_PLACES=493, PETRI_TRANSITIONS=467} [2025-03-04 06:23:33,775 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 34 predicate places. [2025-03-04 06:23:33,776 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 467 transitions, 1290 flow [2025-03-04 06:23:33,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:33,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:33,776 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] [2025-03-04 06:23:33,789 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-04 06:23:33,976 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-04 06:23:33,977 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-04 06:23:33,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:33,980 INFO L85 PathProgramCache]: Analyzing trace with hash -33364687, now seen corresponding path program 1 times [2025-03-04 06:23:33,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:33,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697061119] [2025-03-04 06:23:33,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:33,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:34,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-04 06:23:34,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-04 06:23:34,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:34,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-04 06:23:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697061119] [2025-03-04 06:23:37,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697061119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:23:37,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9369226] [2025-03-04 06:23:37,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:37,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:23:37,065 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:23:37,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 06:23:37,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1340 statements into 1 equivalence classes. [2025-03-04 06:23:37,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1340 of 1340 statements. [2025-03-04 06:23:37,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:37,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:37,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 4186 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:23:37,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:23:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-04 06:23:38,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:23:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 12617 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2025-03-04 06:23:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9369226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:23:39,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:23:39,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2025-03-04 06:23:39,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895624820] [2025-03-04 06:23:39,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:23:39,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 06:23:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:39,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 06:23:39,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 06:23:40,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 472 [2025-03-04 06:23:40,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 467 transitions, 1290 flow. Second operand has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:40,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:40,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 472 [2025-03-04 06:23:40,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:42,157 INFO L124 PetriNetUnfolderBase]: 150/5061 cut-off events. [2025-03-04 06:23:42,157 INFO L125 PetriNetUnfolderBase]: For 1840/1840 co-relation queries the response was YES. [2025-03-04 06:23:42,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6163 conditions, 5061 events. 150/5061 cut-off events. For 1840/1840 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 12589 event pairs, 10 based on Foata normal form. 10/4956 useless extension candidates. Maximal degree in co-relation 6137. Up to 87 conditions per place. [2025-03-04 06:23:42,167 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 88 selfloop transitions, 60 changer transitions 0/557 dead transitions. [2025-03-04 06:23:42,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 557 transitions, 2134 flow [2025-03-04 06:23:42,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 06:23:42,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-04 06:23:42,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 27153 transitions. [2025-03-04 06:23:42,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9587923728813559 [2025-03-04 06:23:42,182 INFO L175 Difference]: Start difference. First operand has 493 places, 467 transitions, 1290 flow. Second operand 60 states and 27153 transitions. [2025-03-04 06:23:42,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 557 transitions, 2134 flow [2025-03-04 06:23:42,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 557 transitions, 2134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:23:42,193 INFO L231 Difference]: Finished difference. Result has 554 places, 483 transitions, 1584 flow [2025-03-04 06:23:42,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=1584, PETRI_PLACES=554, PETRI_TRANSITIONS=483} [2025-03-04 06:23:42,194 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 95 predicate places. [2025-03-04 06:23:42,194 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 483 transitions, 1584 flow [2025-03-04 06:23:42,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 452.09302325581393) internal successors, (19440), 43 states have internal predecessors, (19440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:42,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:42,197 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:42,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 06:23:42,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:23:42,398 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:42,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:42,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1939764179, now seen corresponding path program 2 times [2025-03-04 06:23:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691931431] [2025-03-04 06:23:42,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:23:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:42,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1715 statements into 2 equivalence classes. [2025-03-04 06:23:42,518 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 180 of 1715 statements. [2025-03-04 06:23:42,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:23:42,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-04 06:23:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691931431] [2025-03-04 06:23:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691931431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:42,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:42,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:42,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906765440] [2025-03-04 06:23:42,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:42,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:42,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:42,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:42,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:43,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 472 [2025-03-04 06:23:43,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 483 transitions, 1584 flow. Second operand has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:43,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:43,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 472 [2025-03-04 06:23:43,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:44,839 INFO L124 PetriNetUnfolderBase]: 554/5455 cut-off events. [2025-03-04 06:23:44,839 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2025-03-04 06:23:44,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8578 conditions, 5455 events. 554/5455 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 18013 event pairs, 473 based on Foata normal form. 0/5349 useless extension candidates. Maximal degree in co-relation 8546. Up to 1437 conditions per place. [2025-03-04 06:23:44,857 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 59 selfloop transitions, 5 changer transitions 0/486 dead transitions. [2025-03-04 06:23:44,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 486 transitions, 1722 flow [2025-03-04 06:23:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2477 transitions. [2025-03-04 06:23:44,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746468926553672 [2025-03-04 06:23:44,859 INFO L175 Difference]: Start difference. First operand has 554 places, 483 transitions, 1584 flow. Second operand 6 states and 2477 transitions. [2025-03-04 06:23:44,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 486 transitions, 1722 flow [2025-03-04 06:23:44,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 486 transitions, 1624 flow, removed 7 selfloop flow, removed 42 redundant places. [2025-03-04 06:23:44,869 INFO L231 Difference]: Finished difference. Result has 516 places, 482 transitions, 1494 flow [2025-03-04 06:23:44,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1494, PETRI_PLACES=516, PETRI_TRANSITIONS=482} [2025-03-04 06:23:44,870 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 57 predicate places. [2025-03-04 06:23:44,870 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 482 transitions, 1494 flow [2025-03-04 06:23:44,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 408.8333333333333) internal successors, (2453), 6 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:44,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:44,871 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:44,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 06:23:44,871 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1933437851, now seen corresponding path program 1 times [2025-03-04 06:23:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473031638] [2025-03-04 06:23:44,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:45,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1724 statements into 1 equivalence classes. [2025-03-04 06:23:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1724 of 1724 statements. [2025-03-04 06:23:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-04 06:23:49,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:49,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473031638] [2025-03-04 06:23:49,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473031638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:49,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:49,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:49,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962770997] [2025-03-04 06:23:49,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:49,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:49,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:49,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:49,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:50,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 472 [2025-03-04 06:23:50,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 482 transitions, 1494 flow. Second operand has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:50,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:50,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 472 [2025-03-04 06:23:50,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:51,636 INFO L124 PetriNetUnfolderBase]: 518/5411 cut-off events. [2025-03-04 06:23:51,636 INFO L125 PetriNetUnfolderBase]: For 1087/1087 co-relation queries the response was YES. [2025-03-04 06:23:51,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8369 conditions, 5411 events. 518/5411 cut-off events. For 1087/1087 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 17501 event pairs, 437 based on Foata normal form. 0/5321 useless extension candidates. Maximal degree in co-relation 8336. Up to 1329 conditions per place. [2025-03-04 06:23:51,659 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 50 selfloop transitions, 5 changer transitions 0/485 dead transitions. [2025-03-04 06:23:51,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 485 transitions, 1614 flow [2025-03-04 06:23:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-03-04 06:23:51,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905367231638418 [2025-03-04 06:23:51,661 INFO L175 Difference]: Start difference. First operand has 516 places, 482 transitions, 1494 flow. Second operand 6 states and 2522 transitions. [2025-03-04 06:23:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 485 transitions, 1614 flow [2025-03-04 06:23:51,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 485 transitions, 1604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:51,671 INFO L231 Difference]: Finished difference. Result has 515 places, 481 transitions, 1492 flow [2025-03-04 06:23:51,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=515, PETRI_TRANSITIONS=481} [2025-03-04 06:23:51,672 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 56 predicate places. [2025-03-04 06:23:51,672 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 481 transitions, 1492 flow [2025-03-04 06:23:51,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.6666666666667) internal successors, (2506), 6 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:51,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:51,673 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:51,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 06:23:51,673 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:51,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash -557683693, now seen corresponding path program 1 times [2025-03-04 06:23:51,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:51,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518270481] [2025-03-04 06:23:51,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:51,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:51,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-03-04 06:23:51,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-03-04 06:23:51,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:51,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:23:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22681 trivial. 0 not checked. [2025-03-04 06:23:56,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:23:56,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518270481] [2025-03-04 06:23:56,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518270481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:23:56,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:23:56,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:23:56,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307433302] [2025-03-04 06:23:56,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:23:56,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:23:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:23:56,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:23:56,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:23:56,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 369 out of 472 [2025-03-04 06:23:56,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 481 transitions, 1492 flow. Second operand has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:56,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:23:56,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 369 of 472 [2025-03-04 06:23:56,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:23:58,371 INFO L124 PetriNetUnfolderBase]: 894/5779 cut-off events. [2025-03-04 06:23:58,371 INFO L125 PetriNetUnfolderBase]: For 1151/1151 co-relation queries the response was YES. [2025-03-04 06:23:58,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10513 conditions, 5779 events. 894/5779 cut-off events. For 1151/1151 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 22234 event pairs, 813 based on Foata normal form. 0/5689 useless extension candidates. Maximal degree in co-relation 10480. Up to 2465 conditions per place. [2025-03-04 06:23:58,396 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 92 selfloop transitions, 5 changer transitions 0/484 dead transitions. [2025-03-04 06:23:58,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 484 transitions, 1696 flow [2025-03-04 06:23:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:23:58,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:23:58,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2312 transitions. [2025-03-04 06:23:58,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8163841807909604 [2025-03-04 06:23:58,398 INFO L175 Difference]: Start difference. First operand has 515 places, 481 transitions, 1492 flow. Second operand 6 states and 2312 transitions. [2025-03-04 06:23:58,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 484 transitions, 1696 flow [2025-03-04 06:23:58,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 484 transitions, 1686 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:23:58,408 INFO L231 Difference]: Finished difference. Result has 514 places, 480 transitions, 1490 flow [2025-03-04 06:23:58,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=509, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=475, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=514, PETRI_TRANSITIONS=480} [2025-03-04 06:23:58,408 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 55 predicate places. [2025-03-04 06:23:58,408 INFO L471 AbstractCegarLoop]: Abstraction has has 514 places, 480 transitions, 1490 flow [2025-03-04 06:23:58,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 382.0) internal successors, (2292), 6 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:23:58,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:23:58,409 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:23:58,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 06:23:58,409 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting t2Err3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:23:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:23:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 214897700, now seen corresponding path program 1 times [2025-03-04 06:23:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:23:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127650025] [2025-03-04 06:23:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:23:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:23:58,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1750 statements into 1 equivalence classes. [2025-03-04 06:23:58,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1750 of 1750 statements. [2025-03-04 06:23:58,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:23:58,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:02,623 INFO L134 CoverageAnalysis]: Checked inductivity of 22686 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22686 trivial. 0 not checked. [2025-03-04 06:24:02,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:02,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127650025] [2025-03-04 06:24:02,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127650025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:02,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:02,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:02,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122749103] [2025-03-04 06:24:02,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:02,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:02,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:02,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:02,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-04 06:24:02,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 514 places, 480 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:02,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:02,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-04 06:24:02,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:04,909 INFO L124 PetriNetUnfolderBase]: 950/5827 cut-off events. [2025-03-04 06:24:04,909 INFO L125 PetriNetUnfolderBase]: For 1199/1199 co-relation queries the response was YES. [2025-03-04 06:24:04,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10737 conditions, 5827 events. 950/5827 cut-off events. For 1199/1199 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22735 event pairs, 869 based on Foata normal form. 0/5753 useless extension candidates. Maximal degree in co-relation 10704. Up to 2641 conditions per place. [2025-03-04 06:24:04,923 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-04 06:24:04,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 483 transitions, 1724 flow [2025-03-04 06:24:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:04,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2237 transitions. [2025-03-04 06:24:04,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7899011299435028 [2025-03-04 06:24:04,926 INFO L175 Difference]: Start difference. First operand has 514 places, 480 transitions, 1490 flow. Second operand 6 states and 2237 transitions. [2025-03-04 06:24:04,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 483 transitions, 1724 flow [2025-03-04 06:24:04,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 513 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:04,937 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1488 flow [2025-03-04 06:24:04,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1488, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-04 06:24:04,937 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-04 06:24:04,937 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1488 flow [2025-03-04 06:24:04,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.8333333333333) internal successors, (2207), 6 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:04,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:04,938 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:04,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 06:24:04,939 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t2Err4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:24:04,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:04,945 INFO L85 PathProgramCache]: Analyzing trace with hash 788877584, now seen corresponding path program 1 times [2025-03-04 06:24:04,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:04,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928901842] [2025-03-04 06:24:04,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:04,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:05,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1757 statements into 1 equivalence classes. [2025-03-04 06:24:05,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1757 of 1757 statements. [2025-03-04 06:24:05,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:05,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:24:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 22699 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22699 trivial. 0 not checked. [2025-03-04 06:24:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:24:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928901842] [2025-03-04 06:24:10,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928901842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:24:10,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:24:10,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:24:10,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313322498] [2025-03-04 06:24:10,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:24:10,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:24:10,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:24:10,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:24:10,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:24:10,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-04 06:24:10,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 479 transitions, 1488 flow. Second operand has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:10,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:24:10,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-04 06:24:10,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:24:12,411 INFO L124 PetriNetUnfolderBase]: 950/5843 cut-off events. [2025-03-04 06:24:12,412 INFO L125 PetriNetUnfolderBase]: For 1207/1207 co-relation queries the response was YES. [2025-03-04 06:24:12,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10753 conditions, 5843 events. 950/5843 cut-off events. For 1207/1207 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 22886 event pairs, 869 based on Foata normal form. 0/5769 useless extension candidates. Maximal degree in co-relation 10720. Up to 2641 conditions per place. [2025-03-04 06:24:12,433 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 107 selfloop transitions, 5 changer transitions 0/483 dead transitions. [2025-03-04 06:24:12,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 483 transitions, 1724 flow [2025-03-04 06:24:12,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:24:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:24:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2243 transitions. [2025-03-04 06:24:12,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7920197740112994 [2025-03-04 06:24:12,435 INFO L175 Difference]: Start difference. First operand has 513 places, 479 transitions, 1488 flow. Second operand 6 states and 2243 transitions. [2025-03-04 06:24:12,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 483 transitions, 1724 flow [2025-03-04 06:24:12,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 483 transitions, 1714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:24:12,444 INFO L231 Difference]: Finished difference. Result has 513 places, 479 transitions, 1492 flow [2025-03-04 06:24:12,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1492, PETRI_PLACES=513, PETRI_TRANSITIONS=479} [2025-03-04 06:24:12,445 INFO L279 CegarLoopForPetriNet]: 459 programPoint places, 54 predicate places. [2025-03-04 06:24:12,445 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 479 transitions, 1492 flow [2025-03-04 06:24:12,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 369.6666666666667) internal successors, (2218), 6 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:24:12,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:24:12,446 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:24:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 06:24:12,446 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2025-03-04 06:24:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:24:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1877902575, now seen corresponding path program 1 times [2025-03-04 06:24:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:24:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735979951] [2025-03-04 06:24:12,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:24:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:24:12,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1762 statements into 1 equivalence classes. [2025-03-04 06:24:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1762 of 1762 statements. [2025-03-04 06:24:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:24:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat