./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/ring_1w1r-2.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-divine/ring_1w1r-2.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 b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:43:57,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:43:57,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:43:57,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:43:57,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:43:57,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:43:57,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:43:57,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:43:57,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:43:57,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:43:57,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:43:57,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:43:57,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:43:57,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:43:57,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:43:57,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:43:57,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:43:57,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:43:57,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:43:57,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:43:57,587 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:43:57,588 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:43:57,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:43:57,588 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:43:57,588 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 -> b7e9feb6929ab81158cc9d6731414a71af210f92cb571da2954e02689fee6d2b [2025-03-04 06:43:57,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:43:57,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:43:57,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:43:57,819 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:43:57,819 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:43:57,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-04 06:43:58,963 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e824cf125/fdb53ae8be1b49fba03715b372001a75/FLAG63b49f334 [2025-03-04 06:43:59,243 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:43:59,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-04 06:43:59,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e824cf125/fdb53ae8be1b49fba03715b372001a75/FLAG63b49f334 [2025-03-04 06:43:59,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e824cf125/fdb53ae8be1b49fba03715b372001a75 [2025-03-04 06:43:59,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:43:59,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:43:59,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:43:59,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:43:59,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:43:59,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59, skipping insertion in model container [2025-03-04 06:43:59,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:43:59,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:43:59,826 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:43:59,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:43:59,911 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:43:59,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59 WrapperNode [2025-03-04 06:43:59,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:43:59,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:43:59,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:43:59,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:43:59,917 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:43:59" (1/1) ... [2025-03-04 06:43:59,927 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:43:59" (1/1) ... [2025-03-04 06:43:59,947 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-03-04 06:43:59,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:43:59,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:43:59,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:43:59,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:43:59,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:43:59,986 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:43:59,986 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:43:59,986 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:43:59,986 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (1/1) ... [2025-03-04 06:43:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:44:00,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:44:00,013 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:44:00,016 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:44:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-03-04 06:44:00,032 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-03-04 06:44:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 06:44:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 06:44:00,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:44:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:44:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:44:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:44:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:44:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:44:00,034 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:44:00,135 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:44:00,136 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:44:00,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-03-04 06:44:00,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-03-04 06:44:00,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-03-04 06:44:00,388 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-03-04 06:44:00,536 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:44:00,537 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:44:00,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:44:00,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:44:00,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:44:00 BoogieIcfgContainer [2025-03-04 06:44:00,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:44:00,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:44:00,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:44:00,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:44:00,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:43:59" (1/3) ... [2025-03-04 06:44:00,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a8018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:44:00, skipping insertion in model container [2025-03-04 06:44:00,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:43:59" (2/3) ... [2025-03-04 06:44:00,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@538a8018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:44:00, skipping insertion in model container [2025-03-04 06:44:00,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:44:00" (3/3) ... [2025-03-04 06:44:00,557 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-03-04 06:44:00,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:44:00,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ring_1w1r-2.i that has 2 procedures, 253 locations, 1 initial locations, 3 loop locations, and 16 error locations. [2025-03-04 06:44:00,569 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:44:00,687 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 06:44:00,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 263 transitions, 533 flow [2025-03-04 06:44:00,806 INFO L124 PetriNetUnfolderBase]: 11/262 cut-off events. [2025-03-04 06:44:00,810 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:44:00,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 262 events. 11/262 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 552 event pairs, 0 based on Foata normal form. 0/235 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2025-03-04 06:44:00,820 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 263 transitions, 533 flow [2025-03-04 06:44:00,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 256 transitions, 515 flow [2025-03-04 06:44:00,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:44:00,840 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;@5fff2b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:44:00,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:44:00,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:44:00,847 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-04 06:44:00,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:44:00,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:00,847 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] [2025-03-04 06:44:00,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:00,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -341371719, now seen corresponding path program 1 times [2025-03-04 06:44:00,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:00,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871699208] [2025-03-04 06:44:00,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:44:00,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:44:00,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:00,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:01,409 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:44:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871699208] [2025-03-04 06:44:01,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871699208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:01,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:01,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:01,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111948545] [2025-03-04 06:44:01,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:01,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:01,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:01,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:01,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-04 06:44:01,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 256 transitions, 515 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:44:01,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:01,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-04 06:44:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:02,287 INFO L124 PetriNetUnfolderBase]: 908/4252 cut-off events. [2025-03-04 06:44:02,287 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:44:02,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 4252 events. 908/4252 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33753 event pairs, 768 based on Foata normal form. 262/4107 useless extension candidates. Maximal degree in co-relation 5915. Up to 1713 conditions per place. [2025-03-04 06:44:02,312 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2025-03-04 06:44:02,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 245 transitions, 627 flow [2025-03-04 06:44:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2025-03-04 06:44:02,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7585551330798479 [2025-03-04 06:44:02,325 INFO L175 Difference]: Start difference. First operand has 249 places, 256 transitions, 515 flow. Second operand 6 states and 1197 transitions. [2025-03-04 06:44:02,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 245 transitions, 627 flow [2025-03-04 06:44:02,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:44:02,332 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 502 flow [2025-03-04 06:44:02,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=502, PETRI_PLACES=249, PETRI_TRANSITIONS=245} [2025-03-04 06:44:02,338 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 0 predicate places. [2025-03-04 06:44:02,338 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 502 flow [2025-03-04 06:44:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:44:02,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:02,339 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] [2025-03-04 06:44:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:44:02,340 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash 678699187, now seen corresponding path program 1 times [2025-03-04 06:44:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768634381] [2025-03-04 06:44:02,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:02,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 06:44:02,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 06:44:02,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:02,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:02,673 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:44:02,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:02,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768634381] [2025-03-04 06:44:02,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768634381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:02,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:02,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:02,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992821713] [2025-03-04 06:44:02,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:02,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:02,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:02,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:02,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:03,005 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-04 06:44:03,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 245 transitions, 502 flow. Second operand has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:44:03,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:03,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-04 06:44:03,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:03,319 INFO L124 PetriNetUnfolderBase]: 908/4251 cut-off events. [2025-03-04 06:44:03,319 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:44:03,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 4251 events. 908/4251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 33717 event pairs, 768 based on Foata normal form. 0/3845 useless extension candidates. Maximal degree in co-relation 5927. Up to 1713 conditions per place. [2025-03-04 06:44:03,333 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-03-04 06:44:03,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 634 flow [2025-03-04 06:44:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:03,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-03-04 06:44:03,336 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7541191381495564 [2025-03-04 06:44:03,336 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 502 flow. Second operand 6 states and 1190 transitions. [2025-03-04 06:44:03,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 634 flow [2025-03-04 06:44:03,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 624 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:44:03,341 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 500 flow [2025-03-04 06:44:03,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2025-03-04 06:44:03,342 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2025-03-04 06:44:03,342 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 500 flow [2025-03-04 06:44:03,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.33333333333334) internal successors, (1130), 6 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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:44:03,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:03,344 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] [2025-03-04 06:44:03,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:44:03,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:03,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:03,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1962668552, now seen corresponding path program 1 times [2025-03-04 06:44:03,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:03,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346865143] [2025-03-04 06:44:03,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:03,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:03,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 06:44:03,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 06:44:03,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:03,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:44:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346865143] [2025-03-04 06:44:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346865143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:03,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:03,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:03,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215516004] [2025-03-04 06:44:03,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:03,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:03,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:03,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:03,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:04,079 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-04 06:44:04,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:44:04,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:04,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-04 06:44:04,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:04,318 INFO L124 PetriNetUnfolderBase]: 321/2321 cut-off events. [2025-03-04 06:44:04,318 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:44:04,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 2321 events. 321/2321 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16673 event pairs, 80 based on Foata normal form. 0/2061 useless extension candidates. Maximal degree in co-relation 2871. Up to 487 conditions per place. [2025-03-04 06:44:04,329 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 37 selfloop transitions, 44 changer transitions 0/286 dead transitions. [2025-03-04 06:44:04,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 286 transitions, 746 flow [2025-03-04 06:44:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-04 06:44:04,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-04 06:44:04,333 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 500 flow. Second operand 6 states and 1379 transitions. [2025-03-04 06:44:04,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 286 transitions, 746 flow [2025-03-04 06:44:04,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 286 transitions, 736 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:44:04,340 INFO L231 Difference]: Finished difference. Result has 253 places, 286 transitions, 790 flow [2025-03-04 06:44:04,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=790, PETRI_PLACES=253, PETRI_TRANSITIONS=286} [2025-03-04 06:44:04,341 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2025-03-04 06:44:04,341 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 286 transitions, 790 flow [2025-03-04 06:44:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:44:04,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:04,342 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] [2025-03-04 06:44:04,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:44:04,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:04,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:04,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1851313497, now seen corresponding path program 1 times [2025-03-04 06:44:04,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:04,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-03-04 06:44:04,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:04,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:04,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 06:44:04,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 06:44:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:04,610 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:44:04,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:04,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778852094] [2025-03-04 06:44:04,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778852094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:04,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:04,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:04,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422127701] [2025-03-04 06:44:04,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:04,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:04,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:04,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:04,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:05,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2025-03-04 06:44:05,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 286 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:44:05,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:05,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2025-03-04 06:44:05,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:05,514 INFO L124 PetriNetUnfolderBase]: 506/4440 cut-off events. [2025-03-04 06:44:05,514 INFO L125 PetriNetUnfolderBase]: For 587/729 co-relation queries the response was YES. [2025-03-04 06:44:05,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 4440 events. 506/4440 cut-off events. For 587/729 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 37507 event pairs, 64 based on Foata normal form. 60/4126 useless extension candidates. Maximal degree in co-relation 6500. Up to 613 conditions per place. [2025-03-04 06:44:05,538 INFO L140 encePairwiseOnDemand]: 239/263 looper letters, 80 selfloop transitions, 41 changer transitions 0/332 dead transitions. [2025-03-04 06:44:05,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 332 transitions, 1160 flow [2025-03-04 06:44:05,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:05,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:05,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-04 06:44:05,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8593155893536122 [2025-03-04 06:44:05,542 INFO L175 Difference]: Start difference. First operand has 253 places, 286 transitions, 790 flow. Second operand 6 states and 1356 transitions. [2025-03-04 06:44:05,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 332 transitions, 1160 flow [2025-03-04 06:44:05,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 332 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:05,551 INFO L231 Difference]: Finished difference. Result has 263 places, 326 transitions, 1132 flow [2025-03-04 06:44:05,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1132, PETRI_PLACES=263, PETRI_TRANSITIONS=326} [2025-03-04 06:44:05,552 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2025-03-04 06:44:05,552 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 326 transitions, 1132 flow [2025-03-04 06:44:05,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states 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:44:05,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:05,553 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] [2025-03-04 06:44:05,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:44:05,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reader_fnErr6ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:05,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash -618509025, now seen corresponding path program 1 times [2025-03-04 06:44:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:05,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-03-04 06:44:05,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:05,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:05,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 06:44:05,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 06:44:05,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:05,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:44:05,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969585244] [2025-03-04 06:44:05,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969585244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:05,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:05,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:05,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507836081] [2025-03-04 06:44:05,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:05,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:05,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:05,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:06,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-04 06:44:06,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 326 transitions, 1132 flow. Second operand has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:44:06,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:06,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-04 06:44:06,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:06,673 INFO L124 PetriNetUnfolderBase]: 752/5256 cut-off events. [2025-03-04 06:44:06,673 INFO L125 PetriNetUnfolderBase]: For 2542/2941 co-relation queries the response was YES. [2025-03-04 06:44:06,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 5256 events. 752/5256 cut-off events. For 2542/2941 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 45521 event pairs, 80 based on Foata normal form. 106/4984 useless extension candidates. Maximal degree in co-relation 9479. Up to 1011 conditions per place. [2025-03-04 06:44:06,696 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 95 selfloop transitions, 86 changer transitions 0/408 dead transitions. [2025-03-04 06:44:06,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 408 transitions, 1966 flow [2025-03-04 06:44:06,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:06,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-04 06:44:06,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-04 06:44:06,700 INFO L175 Difference]: Start difference. First operand has 263 places, 326 transitions, 1132 flow. Second operand 6 states and 1379 transitions. [2025-03-04 06:44:06,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 408 transitions, 1966 flow [2025-03-04 06:44:06,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 408 transitions, 1966 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:06,713 INFO L231 Difference]: Finished difference. Result has 273 places, 408 transitions, 2008 flow [2025-03-04 06:44:06,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2008, PETRI_PLACES=273, PETRI_TRANSITIONS=408} [2025-03-04 06:44:06,716 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 24 predicate places. [2025-03-04 06:44:06,716 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 408 transitions, 2008 flow [2025-03-04 06:44:06,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 218.66666666666666) internal successors, (1312), 6 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states 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:44:06,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:06,717 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] [2025-03-04 06:44:06,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:44:06,717 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:06,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1969085332, now seen corresponding path program 1 times [2025-03-04 06:44:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:06,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-04 06:44:06,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:06,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:06,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 06:44:06,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 06:44:06,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:06,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:44:06,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:06,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-04 06:44:06,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725616325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:06,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:06,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810851862] [2025-03-04 06:44:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:06,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:06,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:06,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:06,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:07,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 263 [2025-03-04 06:44:07,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 408 transitions, 2008 flow. Second operand has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states 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:44:07,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:07,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 263 [2025-03-04 06:44:07,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:07,931 INFO L124 PetriNetUnfolderBase]: 811/5931 cut-off events. [2025-03-04 06:44:07,931 INFO L125 PetriNetUnfolderBase]: For 6401/7112 co-relation queries the response was YES. [2025-03-04 06:44:07,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11795 conditions, 5931 events. 811/5931 cut-off events. For 6401/7112 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54108 event pairs, 51 based on Foata normal form. 213/5762 useless extension candidates. Maximal degree in co-relation 11725. Up to 704 conditions per place. [2025-03-04 06:44:07,965 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 98 selfloop transitions, 62 changer transitions 0/469 dead transitions. [2025-03-04 06:44:07,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 469 transitions, 2684 flow [2025-03-04 06:44:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-04 06:44:07,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9036755386565273 [2025-03-04 06:44:07,968 INFO L175 Difference]: Start difference. First operand has 273 places, 408 transitions, 2008 flow. Second operand 6 states and 1426 transitions. [2025-03-04 06:44:07,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 469 transitions, 2684 flow [2025-03-04 06:44:07,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 469 transitions, 2684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:07,987 INFO L231 Difference]: Finished difference. Result has 283 places, 466 transitions, 2676 flow [2025-03-04 06:44:07,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2676, PETRI_PLACES=283, PETRI_TRANSITIONS=466} [2025-03-04 06:44:07,988 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2025-03-04 06:44:07,988 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 466 transitions, 2676 flow [2025-03-04 06:44:07,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 231.66666666666666) internal successors, (1390), 6 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states 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:44:07,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:07,989 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] [2025-03-04 06:44:07,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:44:07,989 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reader_fnErr5ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash -759013773, now seen corresponding path program 1 times [2025-03-04 06:44:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-04 06:44:07,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:08,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:44:08,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:44:08,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:08,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:44:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-04 06:44:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574348308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:08,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725219047] [2025-03-04 06:44:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:08,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:08,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:08,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:08,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-03-04 06:44:08,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 466 transitions, 2676 flow. Second operand has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states 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:44:08,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:08,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-03-04 06:44:08,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:09,215 INFO L124 PetriNetUnfolderBase]: 1054/7178 cut-off events. [2025-03-04 06:44:09,215 INFO L125 PetriNetUnfolderBase]: For 10492/11185 co-relation queries the response was YES. [2025-03-04 06:44:09,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15798 conditions, 7178 events. 1054/7178 cut-off events. For 10492/11185 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 69488 event pairs, 80 based on Foata normal form. 132/6932 useless extension candidates. Maximal degree in co-relation 15723. Up to 1305 conditions per place. [2025-03-04 06:44:09,245 INFO L140 encePairwiseOnDemand]: 242/263 looper letters, 215 selfloop transitions, 70 changer transitions 0/531 dead transitions. [2025-03-04 06:44:09,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 531 transitions, 3684 flow [2025-03-04 06:44:09,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:09,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2025-03-04 06:44:09,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2025-03-04 06:44:09,248 INFO L175 Difference]: Start difference. First operand has 283 places, 466 transitions, 2676 flow. Second operand 6 states and 1392 transitions. [2025-03-04 06:44:09,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 531 transitions, 3684 flow [2025-03-04 06:44:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 531 transitions, 3684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:09,268 INFO L231 Difference]: Finished difference. Result has 293 places, 528 transitions, 3450 flow [2025-03-04 06:44:09,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=2676, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3450, PETRI_PLACES=293, PETRI_TRANSITIONS=528} [2025-03-04 06:44:09,269 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 44 predicate places. [2025-03-04 06:44:09,269 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 528 transitions, 3450 flow [2025-03-04 06:44:09,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.66666666666666) internal successors, (1324), 6 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states 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:44:09,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:09,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:44:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:44:09,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:09,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:09,271 INFO L85 PathProgramCache]: Analyzing trace with hash 972241793, now seen corresponding path program 1 times [2025-03-04 06:44:09,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961556838] [2025-03-04 06:44:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:09,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 06:44:09,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 06:44:09,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:09,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:44:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961556838] [2025-03-04 06:44:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961556838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44376847] [2025-03-04 06:44:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:09,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:09,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:09,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2025-03-04 06:44:09,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 528 transitions, 3450 flow. Second operand has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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:44:09,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:09,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2025-03-04 06:44:09,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:11,728 INFO L124 PetriNetUnfolderBase]: 4604/15132 cut-off events. [2025-03-04 06:44:11,728 INFO L125 PetriNetUnfolderBase]: For 17830/17968 co-relation queries the response was YES. [2025-03-04 06:44:11,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40812 conditions, 15132 events. 4604/15132 cut-off events. For 17830/17968 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 138671 event pairs, 2055 based on Foata normal form. 40/14408 useless extension candidates. Maximal degree in co-relation 40732. Up to 8616 conditions per place. [2025-03-04 06:44:11,807 INFO L140 encePairwiseOnDemand]: 224/263 looper letters, 301 selfloop transitions, 208 changer transitions 0/693 dead transitions. [2025-03-04 06:44:11,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 693 transitions, 5294 flow [2025-03-04 06:44:11,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:11,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:11,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2025-03-04 06:44:11,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200253485424588 [2025-03-04 06:44:11,811 INFO L175 Difference]: Start difference. First operand has 293 places, 528 transitions, 3450 flow. Second operand 6 states and 1294 transitions. [2025-03-04 06:44:11,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 693 transitions, 5294 flow [2025-03-04 06:44:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 693 transitions, 5122 flow, removed 86 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:11,885 INFO L231 Difference]: Finished difference. Result has 303 places, 693 transitions, 5070 flow [2025-03-04 06:44:11,885 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=3290, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5070, PETRI_PLACES=303, PETRI_TRANSITIONS=693} [2025-03-04 06:44:11,886 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 54 predicate places. [2025-03-04 06:44:11,886 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 693 transitions, 5070 flow [2025-03-04 06:44:11,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.0) internal successors, (1116), 6 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states 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:44:11,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:11,888 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] [2025-03-04 06:44:11,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:44:11,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reader_fnErr4ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:11,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:11,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1764092554, now seen corresponding path program 1 times [2025-03-04 06:44:11,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:11,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099364374] [2025-03-04 06:44:11,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:11,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:11,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:44:11,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:44:11,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:11,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 06:44:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:12,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099364374] [2025-03-04 06:44:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099364374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:12,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:12,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:44:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913172556] [2025-03-04 06:44:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:12,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:44:12,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:12,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:44:12,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:44:12,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 263 [2025-03-04 06:44:12,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 693 transitions, 5070 flow. Second operand has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:44:12,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:12,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 263 [2025-03-04 06:44:12,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:13,533 INFO L124 PetriNetUnfolderBase]: 1706/9057 cut-off events. [2025-03-04 06:44:13,534 INFO L125 PetriNetUnfolderBase]: For 22025/23298 co-relation queries the response was YES. [2025-03-04 06:44:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24191 conditions, 9057 events. 1706/9057 cut-off events. For 22025/23298 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 88115 event pairs, 109 based on Foata normal form. 230/8893 useless extension candidates. Maximal degree in co-relation 24106. Up to 1674 conditions per place. [2025-03-04 06:44:13,579 INFO L140 encePairwiseOnDemand]: 248/263 looper letters, 311 selfloop transitions, 92 changer transitions 0/780 dead transitions. [2025-03-04 06:44:13,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 780 transitions, 6714 flow [2025-03-04 06:44:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:44:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:44:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-04 06:44:13,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922686945500634 [2025-03-04 06:44:13,582 INFO L175 Difference]: Start difference. First operand has 303 places, 693 transitions, 5070 flow. Second operand 6 states and 1408 transitions. [2025-03-04 06:44:13,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 780 transitions, 6714 flow [2025-03-04 06:44:13,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 780 transitions, 6526 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:13,642 INFO L231 Difference]: Finished difference. Result has 313 places, 780 transitions, 6150 flow [2025-03-04 06:44:13,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=4882, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6150, PETRI_PLACES=313, PETRI_TRANSITIONS=780} [2025-03-04 06:44:13,643 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 64 predicate places. [2025-03-04 06:44:13,644 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 780 transitions, 6150 flow [2025-03-04 06:44:13,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states 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:44:13,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:13,645 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] [2025-03-04 06:44:13,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:44:13,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:13,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1109589664, now seen corresponding path program 1 times [2025-03-04 06:44:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:13,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188252816] [2025-03-04 06:44:13,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:44:13,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 06:44:13,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:44:13,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:44:13,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:15,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:44:15,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:15,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188252816] [2025-03-04 06:44:15,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188252816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:15,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:15,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-04 06:44:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448953128] [2025-03-04 06:44:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 06:44:15,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:15,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 06:44:15,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-04 06:44:21,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2025-03-04 06:44:21,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 780 transitions, 6150 flow. Second operand has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states 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:44:21,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:21,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2025-03-04 06:44:21,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:30,678 INFO L124 PetriNetUnfolderBase]: 9859/35960 cut-off events. [2025-03-04 06:44:30,678 INFO L125 PetriNetUnfolderBase]: For 76926/78343 co-relation queries the response was YES. [2025-03-04 06:44:30,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111240 conditions, 35960 events. 9859/35960 cut-off events. For 76926/78343 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 390667 event pairs, 1232 based on Foata normal form. 413/35111 useless extension candidates. Maximal degree in co-relation 111141. Up to 7504 conditions per place. [2025-03-04 06:44:31,070 INFO L140 encePairwiseOnDemand]: 217/263 looper letters, 1904 selfloop transitions, 317 changer transitions 14/2528 dead transitions. [2025-03-04 06:44:31,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 2528 transitions, 25524 flow [2025-03-04 06:44:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 06:44:31,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-04 06:44:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 10182 transitions. [2025-03-04 06:44:31,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6913362303096143 [2025-03-04 06:44:31,085 INFO L175 Difference]: Start difference. First operand has 313 places, 780 transitions, 6150 flow. Second operand 56 states and 10182 transitions. [2025-03-04 06:44:31,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 2528 transitions, 25524 flow [2025-03-04 06:44:31,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 2528 transitions, 24884 flow, removed 320 selfloop flow, removed 0 redundant places. [2025-03-04 06:44:31,469 INFO L231 Difference]: Finished difference. Result has 408 places, 1157 transitions, 10066 flow [2025-03-04 06:44:31,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=5974, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=10066, PETRI_PLACES=408, PETRI_TRANSITIONS=1157} [2025-03-04 06:44:31,471 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 159 predicate places. [2025-03-04 06:44:31,471 INFO L471 AbstractCegarLoop]: Abstraction has has 408 places, 1157 transitions, 10066 flow [2025-03-04 06:44:31,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 170.8846153846154) internal successors, (4443), 26 states have internal predecessors, (4443), 0 states have call successors, (0), 0 states 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:44:31,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:31,473 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] [2025-03-04 06:44:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:44:31,473 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1971524706, now seen corresponding path program 2 times [2025-03-04 06:44:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-03-04 06:44:31,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:44:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:31,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:44:31,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:44:31,503 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 06:44:31,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:44:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728669154] [2025-03-04 06:44:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728669154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 06:44:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210899385] [2025-03-04 06:44:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 06:44:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:33,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 06:44:33,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-03-04 06:44:39,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 263 [2025-03-04 06:44:39,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 1157 transitions, 10066 flow. Second operand has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states 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:44:39,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:44:39,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 263 [2025-03-04 06:44:39,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:44:51,153 INFO L124 PetriNetUnfolderBase]: 11567/45941 cut-off events. [2025-03-04 06:44:51,154 INFO L125 PetriNetUnfolderBase]: For 200988/204716 co-relation queries the response was YES. [2025-03-04 06:44:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160867 conditions, 45941 events. 11567/45941 cut-off events. For 200988/204716 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 537255 event pairs, 1035 based on Foata normal form. 813/45536 useless extension candidates. Maximal degree in co-relation 160720. Up to 12382 conditions per place. [2025-03-04 06:44:51,795 INFO L140 encePairwiseOnDemand]: 211/263 looper letters, 1340 selfloop transitions, 387 changer transitions 8/2154 dead transitions. [2025-03-04 06:44:51,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2154 transitions, 22015 flow [2025-03-04 06:44:51,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 06:44:51,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-04 06:44:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 6774 transitions. [2025-03-04 06:44:51,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7359043997827268 [2025-03-04 06:44:51,802 INFO L175 Difference]: Start difference. First operand has 408 places, 1157 transitions, 10066 flow. Second operand 35 states and 6774 transitions. [2025-03-04 06:44:51,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2154 transitions, 22015 flow [2025-03-04 06:44:53,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2154 transitions, 21980 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 06:44:53,310 INFO L231 Difference]: Finished difference. Result has 464 places, 1488 transitions, 15291 flow [2025-03-04 06:44:53,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=10035, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=15291, PETRI_PLACES=464, PETRI_TRANSITIONS=1488} [2025-03-04 06:44:53,311 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 215 predicate places. [2025-03-04 06:44:53,311 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 1488 transitions, 15291 flow [2025-03-04 06:44:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 179.79166666666666) internal successors, (4315), 24 states have internal predecessors, (4315), 0 states have call successors, (0), 0 states 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:44:53,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:44:53,312 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] [2025-03-04 06:44:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:44:53,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reader_fnErr7ASSERT_VIOLATIONDATA_RACE === [reader_fnErr7ASSERT_VIOLATIONDATA_RACE, reader_fnErr1ASSERT_VIOLATIONDATA_RACE, reader_fnErr6ASSERT_VIOLATIONDATA_RACE, reader_fnErr0ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2025-03-04 06:44:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:44:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash 64492048, now seen corresponding path program 3 times [2025-03-04 06:44:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:44:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493782826] [2025-03-04 06:44:53,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:44:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:44:53,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 2 equivalence classes. [2025-03-04 06:44:53,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 06:44:53,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 06:44:53,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:44:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 06:44:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:44:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493782826] [2025-03-04 06:44:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493782826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:44:56,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:44:56,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2025-03-04 06:44:56,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682859299] [2025-03-04 06:44:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:44:56,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 06:44:56,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:44:56,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 06:44:56,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 06:45:06,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 263 [2025-03-04 06:45:06,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 1488 transitions, 15291 flow. Second operand has 33 states, 33 states have (on average 127.78787878787878) internal successors, (4217), 33 states have internal predecessors, (4217), 0 states have call successors, (0), 0 states 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:45:06,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:45:06,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 263 [2025-03-04 06:45:06,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand