./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 8fc3dc66 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-?-8fc3dc6-m [2025-03-17 11:02:53,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:02:53,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:02:53,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:02:53,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:02:53,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:02:53,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:02:53,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:02:53,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:02:53,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:02:53,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:02:53,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:02:53,451 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:02:53,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:02:53,452 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:02:53,453 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:02:53,453 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:02:53,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:02:53,454 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:02:53,454 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-17 11:02:53,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:02:53,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:02:53,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:02:53,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:02:53,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:02:53,710 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-17 11:02:54,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831b770b2/01724d71078b4ccd9b69fbab055933a9/FLAG6d6831a3c [2025-03-17 11:02:55,155 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:02:55,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_1w1r-2.i [2025-03-17 11:02:55,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831b770b2/01724d71078b4ccd9b69fbab055933a9/FLAG6d6831a3c [2025-03-17 11:02:55,175 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/831b770b2/01724d71078b4ccd9b69fbab055933a9 [2025-03-17 11:02:55,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:02:55,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:02:55,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:02:55,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:02:55,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:02:55,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456d88f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55, skipping insertion in model container [2025-03-17 11:02:55,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:02:55,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:02:55,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:02:55,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:02:55,617 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:02:55,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55 WrapperNode [2025-03-17 11:02:55,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:02:55,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:02:55,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:02:55,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:02:55,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,655 INFO L138 Inliner]: procedures = 223, calls = 39, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 215 [2025-03-17 11:02:55,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:02:55,656 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:02:55,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:02:55,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:02:55,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:02:55,689 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:02:55,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:02:55,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:02:55,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (1/1) ... [2025-03-17 11:02:55,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:02:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:02:55,721 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-17 11:02:55,726 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-17 11:02:55,739 INFO L130 BoogieDeclarations]: Found specification of procedure reader_fn [2025-03-17 11:02:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_fn [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:02:55,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:02:55,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:02:55,741 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:02:55,844 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:02:55,846 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:02:56,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc ring_empty_#t~mem15#1; [2025-03-17 11:02:56,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-1: havoc ring_empty_#t~mem14#1; [2025-03-17 11:02:56,044 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-18: havoc ring_empty_#t~mem15#1; [2025-03-17 11:02:56,045 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L820-19: havoc ring_empty_#t~mem14#1; [2025-03-17 11:02:56,201 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:02:56,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:02:56,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:02:56,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:02:56,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:02:56 BoogieIcfgContainer [2025-03-17 11:02:56,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:02:56,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:02:56,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:02:56,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:02:56,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:02:55" (1/3) ... [2025-03-17 11:02:56,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c0c22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:02:56, skipping insertion in model container [2025-03-17 11:02:56,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:02:55" (2/3) ... [2025-03-17 11:02:56,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c0c22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:02:56, skipping insertion in model container [2025-03-17 11:02:56,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:02:56" (3/3) ... [2025-03-17 11:02:56,225 INFO L128 eAbstractionObserver]: Analyzing ICFG ring_1w1r-2.i [2025-03-17 11:02:56,237 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:02:56,239 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-17 11:02:56,239 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:02:56,356 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 11:02:56,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 263 transitions, 533 flow [2025-03-17 11:02:56,468 INFO L124 PetriNetUnfolderBase]: 11/262 cut-off events. [2025-03-17 11:02:56,470 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:02:56,479 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 554 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-17 11:02:56,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 263 transitions, 533 flow [2025-03-17 11:02:56,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 256 transitions, 515 flow [2025-03-17 11:02:56,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:02:56,504 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;@606d3388, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:02:56,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-17 11:02:56,513 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:02:56,513 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-17 11:02:56,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:02:56,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:56,514 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-17 11:02:56,515 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-17 11:02:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 708157744, now seen corresponding path program 1 times [2025-03-17 11:02:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:56,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305254184] [2025-03-17 11:02:56,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:56,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:56,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 11:02:56,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 11:02:56,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:56,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:02:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305254184] [2025-03-17 11:02:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305254184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:57,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:02:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482143067] [2025-03-17 11:02:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:57,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:02:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:57,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:02:57,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:02:57,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-17 11:02:57,515 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-17 11:02:57,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:57,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-17 11:02:57,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:58,124 INFO L124 PetriNetUnfolderBase]: 908/4227 cut-off events. [2025-03-17 11:02:58,124 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:02:58,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5949 conditions, 4227 events. 908/4227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 33430 event pairs, 768 based on Foata normal form. 260/4081 useless extension candidates. Maximal degree in co-relation 5890. Up to 1713 conditions per place. [2025-03-17 11:02:58,147 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/245 dead transitions. [2025-03-17 11:02:58,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 245 transitions, 627 flow [2025-03-17 11:02:58,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:02:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:02:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2025-03-17 11:02:58,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7585551330798479 [2025-03-17 11:02:58,166 INFO L175 Difference]: Start difference. First operand has 249 places, 256 transitions, 515 flow. Second operand 6 states and 1197 transitions. [2025-03-17 11:02:58,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 245 transitions, 627 flow [2025-03-17 11:02:58,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 245 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:02:58,175 INFO L231 Difference]: Finished difference. Result has 249 places, 245 transitions, 502 flow [2025-03-17 11:02:58,177 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-17 11:02:58,181 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 0 predicate places. [2025-03-17 11:02:58,182 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 245 transitions, 502 flow [2025-03-17 11:02:58,183 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-17 11:02:58,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:58,183 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-17 11:02:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:02:58,183 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-17 11:02:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1254274933, now seen corresponding path program 1 times [2025-03-17 11:02:58,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096519584] [2025-03-17 11:02:58,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:58,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:58,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:02:58,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:02:58,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:58,462 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-17 11:02:58,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:58,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096519584] [2025-03-17 11:02:58,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096519584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:58,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:58,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:02:58,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761947164] [2025-03-17 11:02:58,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:58,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:02:58,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:58,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:02:58,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:02:58,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 263 [2025-03-17 11:02:58,797 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-17 11:02:58,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:58,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 263 [2025-03-17 11:02:58,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:02:59,089 INFO L124 PetriNetUnfolderBase]: 908/4226 cut-off events. [2025-03-17 11:02:59,090 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:02:59,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 4226 events. 908/4226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 33425 event pairs, 768 based on Foata normal form. 0/3821 useless extension candidates. Maximal degree in co-relation 5902. Up to 1713 conditions per place. [2025-03-17 11:02:59,104 INFO L140 encePairwiseOnDemand]: 257/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/244 dead transitions. [2025-03-17 11:02:59,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 634 flow [2025-03-17 11:02:59,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:02:59,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:02:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1190 transitions. [2025-03-17 11:02:59,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7541191381495564 [2025-03-17 11:02:59,107 INFO L175 Difference]: Start difference. First operand has 249 places, 245 transitions, 502 flow. Second operand 6 states and 1190 transitions. [2025-03-17 11:02:59,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 634 flow [2025-03-17 11:02:59,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 624 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:02:59,111 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 500 flow [2025-03-17 11:02:59,114 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-17 11:02:59,114 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, -1 predicate places. [2025-03-17 11:02:59,115 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 500 flow [2025-03-17 11:02:59,115 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-17 11:02:59,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:02:59,116 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-17 11:02:59,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:02:59,116 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-17 11:02:59,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:02:59,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1484548332, now seen corresponding path program 1 times [2025-03-17 11:02:59,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:02:59,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497117891] [2025-03-17 11:02:59,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:02:59,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:02:59,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:02:59,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:02:59,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:02:59,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:02:59,399 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-17 11:02:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:02:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497117891] [2025-03-17 11:02:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497117891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:02:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:02:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:02:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868280324] [2025-03-17 11:02:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:02:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:02:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:02:59,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:02:59,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:02:59,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-17 11:02:59,892 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-17 11:02:59,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:02:59,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-17 11:02:59,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:00,096 INFO L124 PetriNetUnfolderBase]: 321/2321 cut-off events. [2025-03-17 11:03:00,096 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:03:00,100 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 16628 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-17 11:03:00,106 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 37 selfloop transitions, 44 changer transitions 0/286 dead transitions. [2025-03-17 11:03:00,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 286 transitions, 746 flow [2025-03-17 11:03:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-17 11:03:00,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-17 11:03:00,111 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 500 flow. Second operand 6 states and 1379 transitions. [2025-03-17 11:03:00,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 286 transitions, 746 flow [2025-03-17 11:03:00,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 286 transitions, 736 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:03:00,117 INFO L231 Difference]: Finished difference. Result has 253 places, 286 transitions, 790 flow [2025-03-17 11:03:00,118 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-17 11:03:00,119 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 4 predicate places. [2025-03-17 11:03:00,119 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 286 transitions, 790 flow [2025-03-17 11:03:00,120 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-17 11:03:00,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:00,120 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-17 11:03:00,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:03:00,120 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-17 11:03:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2138772080, now seen corresponding path program 1 times [2025-03-17 11:03:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178882710] [2025-03-17 11:03:00,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:00,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:00,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-17 11:03:00,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-17 11:03:00,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:00,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:00,347 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-17 11:03:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178882710] [2025-03-17 11:03:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178882710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:00,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:00,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693319061] [2025-03-17 11:03:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:00,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:00,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:00,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:00,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:00,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2025-03-17 11:03:00,850 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-17 11:03:00,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:00,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2025-03-17 11:03:00,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:01,245 INFO L124 PetriNetUnfolderBase]: 506/4440 cut-off events. [2025-03-17 11:03:01,246 INFO L125 PetriNetUnfolderBase]: For 587/729 co-relation queries the response was YES. [2025-03-17 11:03:01,254 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 64. Compared 37431 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-17 11:03:01,263 INFO L140 encePairwiseOnDemand]: 239/263 looper letters, 80 selfloop transitions, 41 changer transitions 0/332 dead transitions. [2025-03-17 11:03:01,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 332 transitions, 1160 flow [2025-03-17 11:03:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1356 transitions. [2025-03-17 11:03:01,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8593155893536122 [2025-03-17 11:03:01,267 INFO L175 Difference]: Start difference. First operand has 253 places, 286 transitions, 790 flow. Second operand 6 states and 1356 transitions. [2025-03-17 11:03:01,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 332 transitions, 1160 flow [2025-03-17 11:03:01,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 332 transitions, 1160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:01,275 INFO L231 Difference]: Finished difference. Result has 263 places, 326 transitions, 1132 flow [2025-03-17 11:03:01,276 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-17 11:03:01,276 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2025-03-17 11:03:01,276 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 326 transitions, 1132 flow [2025-03-17 11:03:01,277 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-17 11:03:01,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:01,277 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-17 11:03:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:03:01,277 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-17 11:03:01,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 123261011, now seen corresponding path program 1 times [2025-03-17 11:03:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670779453] [2025-03-17 11:03:01,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:01,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 11:03:01,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 11:03:01,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:01,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:01,484 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-17 11:03:01,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670779453] [2025-03-17 11:03:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670779453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:01,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:01,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292602953] [2025-03-17 11:03:01,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:01,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:01,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:01,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:01,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 263 [2025-03-17 11:03:01,906 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-17 11:03:01,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:01,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 263 [2025-03-17 11:03:01,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:02,489 INFO L124 PetriNetUnfolderBase]: 758/5262 cut-off events. [2025-03-17 11:03:02,490 INFO L125 PetriNetUnfolderBase]: For 2542/2941 co-relation queries the response was YES. [2025-03-17 11:03:02,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9556 conditions, 5262 events. 758/5262 cut-off events. For 2542/2941 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 45557 event pairs, 80 based on Foata normal form. 106/4990 useless extension candidates. Maximal degree in co-relation 9491. Up to 1011 conditions per place. [2025-03-17 11:03:02,531 INFO L140 encePairwiseOnDemand]: 241/263 looper letters, 95 selfloop transitions, 86 changer transitions 0/408 dead transitions. [2025-03-17 11:03:02,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 408 transitions, 1966 flow [2025-03-17 11:03:02,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1379 transitions. [2025-03-17 11:03:02,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8738910012674271 [2025-03-17 11:03:02,534 INFO L175 Difference]: Start difference. First operand has 263 places, 326 transitions, 1132 flow. Second operand 6 states and 1379 transitions. [2025-03-17 11:03:02,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 408 transitions, 1966 flow [2025-03-17 11:03:02,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 408 transitions, 1966 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:02,547 INFO L231 Difference]: Finished difference. Result has 273 places, 408 transitions, 2008 flow [2025-03-17 11:03:02,548 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-17 11:03:02,548 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 24 predicate places. [2025-03-17 11:03:02,548 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 408 transitions, 2008 flow [2025-03-17 11:03:02,549 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-17 11:03:02,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:02,549 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-17 11:03:02,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:03:02,549 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-17 11:03:02,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:02,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1893096711, now seen corresponding path program 1 times [2025-03-17 11:03:02,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:02,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998668642] [2025-03-17 11:03:02,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:02,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:02,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-17 11:03:02,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-17 11:03:02,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:02,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:02,774 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-17 11:03:02,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:02,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998668642] [2025-03-17 11:03:02,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998668642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:02,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:02,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:02,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887926281] [2025-03-17 11:03:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:02,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:02,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:02,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:03,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 263 [2025-03-17 11:03:03,242 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-17 11:03:03,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:03,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 263 [2025-03-17 11:03:03,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:03,722 INFO L124 PetriNetUnfolderBase]: 817/5937 cut-off events. [2025-03-17 11:03:03,722 INFO L125 PetriNetUnfolderBase]: For 6401/7112 co-relation queries the response was YES. [2025-03-17 11:03:03,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11807 conditions, 5937 events. 817/5937 cut-off events. For 6401/7112 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 54126 event pairs, 51 based on Foata normal form. 213/5768 useless extension candidates. Maximal degree in co-relation 11737. Up to 704 conditions per place. [2025-03-17 11:03:03,752 INFO L140 encePairwiseOnDemand]: 252/263 looper letters, 98 selfloop transitions, 62 changer transitions 0/469 dead transitions. [2025-03-17 11:03:03,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 469 transitions, 2684 flow [2025-03-17 11:03:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:03,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:03,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1426 transitions. [2025-03-17 11:03:03,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9036755386565273 [2025-03-17 11:03:03,755 INFO L175 Difference]: Start difference. First operand has 273 places, 408 transitions, 2008 flow. Second operand 6 states and 1426 transitions. [2025-03-17 11:03:03,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 469 transitions, 2684 flow [2025-03-17 11:03:03,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 469 transitions, 2684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:03,771 INFO L231 Difference]: Finished difference. Result has 283 places, 466 transitions, 2676 flow [2025-03-17 11:03:03,772 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-17 11:03:03,774 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2025-03-17 11:03:03,774 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 466 transitions, 2676 flow [2025-03-17 11:03:03,775 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-17 11:03:03,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:03,775 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:03:03,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:03:03,776 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-17 11:03:03,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -894944665, now seen corresponding path program 1 times [2025-03-17 11:03:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:03,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880135945] [2025-03-17 11:03:03,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:03,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:03:03,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:03:03,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:03,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:04,036 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-17 11:03:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880135945] [2025-03-17 11:03:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880135945] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834039472] [2025-03-17 11:03:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:04,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:04,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 263 [2025-03-17 11:03:04,442 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-17 11:03:04,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:04,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 263 [2025-03-17 11:03:04,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:05,049 INFO L124 PetriNetUnfolderBase]: 1070/7203 cut-off events. [2025-03-17 11:03:05,049 INFO L125 PetriNetUnfolderBase]: For 10189/10929 co-relation queries the response was YES. [2025-03-17 11:03:05,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15851 conditions, 7203 events. 1070/7203 cut-off events. For 10189/10929 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 69668 event pairs, 80 based on Foata normal form. 144/6969 useless extension candidates. Maximal degree in co-relation 15776. Up to 1306 conditions per place. [2025-03-17 11:03:05,084 INFO L140 encePairwiseOnDemand]: 242/263 looper letters, 215 selfloop transitions, 70 changer transitions 0/531 dead transitions. [2025-03-17 11:03:05,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 531 transitions, 3684 flow [2025-03-17 11:03:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:05,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1392 transitions. [2025-03-17 11:03:05,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821292775665399 [2025-03-17 11:03:05,087 INFO L175 Difference]: Start difference. First operand has 283 places, 466 transitions, 2676 flow. Second operand 6 states and 1392 transitions. [2025-03-17 11:03:05,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 531 transitions, 3684 flow [2025-03-17 11:03:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 531 transitions, 3684 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:05,109 INFO L231 Difference]: Finished difference. Result has 293 places, 528 transitions, 3450 flow [2025-03-17 11:03:05,112 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-17 11:03:05,113 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 44 predicate places. [2025-03-17 11:03:05,113 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 528 transitions, 3450 flow [2025-03-17 11:03:05,114 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-17 11:03:05,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:05,114 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-17 11:03:05,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:03:05,114 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-17 11:03:05,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash -239679258, now seen corresponding path program 1 times [2025-03-17 11:03:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064221016] [2025-03-17 11:03:05,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:05,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 11:03:05,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 11:03:05,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:05,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:05,427 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-17 11:03:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064221016] [2025-03-17 11:03:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064221016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:05,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:05,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929028738] [2025-03-17 11:03:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:05,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:05,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:05,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:05,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:05,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 263 [2025-03-17 11:03:05,757 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-17 11:03:05,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:05,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 263 [2025-03-17 11:03:05,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:07,494 INFO L124 PetriNetUnfolderBase]: 4592/15067 cut-off events. [2025-03-17 11:03:07,494 INFO L125 PetriNetUnfolderBase]: For 17746/17884 co-relation queries the response was YES. [2025-03-17 11:03:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40695 conditions, 15067 events. 4592/15067 cut-off events. For 17746/17884 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 137779 event pairs, 2055 based on Foata normal form. 40/14355 useless extension candidates. Maximal degree in co-relation 40615. Up to 8605 conditions per place. [2025-03-17 11:03:07,578 INFO L140 encePairwiseOnDemand]: 224/263 looper letters, 301 selfloop transitions, 208 changer transitions 0/693 dead transitions. [2025-03-17 11:03:07,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 693 transitions, 5294 flow [2025-03-17 11:03:07,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:07,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1294 transitions. [2025-03-17 11:03:07,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8200253485424588 [2025-03-17 11:03:07,581 INFO L175 Difference]: Start difference. First operand has 293 places, 528 transitions, 3450 flow. Second operand 6 states and 1294 transitions. [2025-03-17 11:03:07,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 693 transitions, 5294 flow [2025-03-17 11:03:07,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 693 transitions, 5122 flow, removed 86 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:07,641 INFO L231 Difference]: Finished difference. Result has 303 places, 693 transitions, 5070 flow [2025-03-17 11:03:07,643 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-17 11:03:07,643 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 54 predicate places. [2025-03-17 11:03:07,644 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 693 transitions, 5070 flow [2025-03-17 11:03:07,645 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-17 11:03:07,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:07,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] [2025-03-17 11:03:07,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:03:07,645 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-17 11:03:07,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1416013398, now seen corresponding path program 1 times [2025-03-17 11:03:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:07,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433808454] [2025-03-17 11:03:07,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:07,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 11:03:07,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:03:07,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:07,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:07,945 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-17 11:03:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:07,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433808454] [2025-03-17 11:03:07,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433808454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:07,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:07,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:03:07,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611547337] [2025-03-17 11:03:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:07,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:03:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:07,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:03:07,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:03:08,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 263 [2025-03-17 11:03:08,424 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-17 11:03:08,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:08,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 263 [2025-03-17 11:03:08,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:09,594 INFO L124 PetriNetUnfolderBase]: 1696/9054 cut-off events. [2025-03-17 11:03:09,594 INFO L125 PetriNetUnfolderBase]: For 21467/22754 co-relation queries the response was YES. [2025-03-17 11:03:09,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24196 conditions, 9054 events. 1696/9054 cut-off events. For 21467/22754 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 88214 event pairs, 109 based on Foata normal form. 225/8885 useless extension candidates. Maximal degree in co-relation 24111. Up to 1677 conditions per place. [2025-03-17 11:03:09,630 INFO L140 encePairwiseOnDemand]: 248/263 looper letters, 311 selfloop transitions, 92 changer transitions 0/780 dead transitions. [2025-03-17 11:03:09,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 780 transitions, 6714 flow [2025-03-17 11:03:09,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:03:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:03:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1408 transitions. [2025-03-17 11:03:09,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8922686945500634 [2025-03-17 11:03:09,633 INFO L175 Difference]: Start difference. First operand has 303 places, 693 transitions, 5070 flow. Second operand 6 states and 1408 transitions. [2025-03-17 11:03:09,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 780 transitions, 6714 flow [2025-03-17 11:03:09,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 780 transitions, 6526 flow, removed 94 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:09,688 INFO L231 Difference]: Finished difference. Result has 313 places, 780 transitions, 6150 flow [2025-03-17 11:03:09,688 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-17 11:03:09,689 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 64 predicate places. [2025-03-17 11:03:09,689 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 780 transitions, 6150 flow [2025-03-17 11:03:09,689 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-17 11:03:09,689 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:09,690 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-17 11:03:09,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:03:09,690 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-17 11:03:09,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:09,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1013115264, now seen corresponding path program 1 times [2025-03-17 11:03:09,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:09,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101372612] [2025-03-17 11:03:09,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:03:09,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:09,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 11:03:09,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:03:09,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:03:09,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:11,114 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-17 11:03:11,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101372612] [2025-03-17 11:03:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101372612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-17 11:03:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144402410] [2025-03-17 11:03:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:11,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:03:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:03:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:03:17,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 263 [2025-03-17 11:03:17,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 780 transitions, 6150 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-17 11:03:17,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:17,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 263 [2025-03-17 11:03:17,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:23,305 INFO L124 PetriNetUnfolderBase]: 5655/23873 cut-off events. [2025-03-17 11:03:23,306 INFO L125 PetriNetUnfolderBase]: For 44225/45393 co-relation queries the response was YES. [2025-03-17 11:03:23,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68131 conditions, 23873 events. 5655/23873 cut-off events. For 44225/45393 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 264531 event pairs, 500 based on Foata normal form. 380/23337 useless extension candidates. Maximal degree in co-relation 68032. Up to 5336 conditions per place. [2025-03-17 11:03:23,479 INFO L140 encePairwiseOnDemand]: 211/263 looper letters, 978 selfloop transitions, 249 changer transitions 12/1576 dead transitions. [2025-03-17 11:03:23,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1576 transitions, 14494 flow [2025-03-17 11:03:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 11:03:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-17 11:03:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6521 transitions. [2025-03-17 11:03:23,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7292552001789309 [2025-03-17 11:03:23,489 INFO L175 Difference]: Start difference. First operand has 313 places, 780 transitions, 6150 flow. Second operand 34 states and 6521 transitions. [2025-03-17 11:03:23,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1576 transitions, 14494 flow [2025-03-17 11:03:23,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1576 transitions, 14174 flow, removed 160 selfloop flow, removed 0 redundant places. [2025-03-17 11:03:23,684 INFO L231 Difference]: Finished difference. Result has 373 places, 1019 transitions, 9099 flow [2025-03-17 11:03:23,685 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=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9099, PETRI_PLACES=373, PETRI_TRANSITIONS=1019} [2025-03-17 11:03:23,686 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 124 predicate places. [2025-03-17 11:03:23,686 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 1019 transitions, 9099 flow [2025-03-17 11:03:23,687 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-17 11:03:23,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:03:23,687 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-17 11:03:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:03:23,687 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-17 11:03:23,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:03:23,688 INFO L85 PathProgramCache]: Analyzing trace with hash 247227362, now seen corresponding path program 2 times [2025-03-17 11:03:23,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:03:23,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316713930] [2025-03-17 11:03:23,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:03:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:03:23,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-03-17 11:03:23,725 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:03:23,725 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:03:23,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:03:26,884 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-17 11:03:26,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:03:26,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316713930] [2025-03-17 11:03:26,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316713930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:03:26,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:03:26,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-17 11:03:26,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620640891] [2025-03-17 11:03:26,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:03:26,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:03:26,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:03:26,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:03:26,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2025-03-17 11:03:34,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 263 [2025-03-17 11:03:34,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 1019 transitions, 9099 flow. Second operand has 32 states, 32 states have (on average 132.84375) internal successors, (4251), 32 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:03:34,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:03:34,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 263 [2025-03-17 11:03:34,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:03:58,226 INFO L124 PetriNetUnfolderBase]: 29631/72354 cut-off events. [2025-03-17 11:03:58,226 INFO L125 PetriNetUnfolderBase]: For 224251/225482 co-relation queries the response was YES. [2025-03-17 11:03:58,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268769 conditions, 72354 events. 29631/72354 cut-off events. For 224251/225482 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 758214 event pairs, 5245 based on Foata normal form. 300/71282 useless extension candidates. Maximal degree in co-relation 268634. Up to 19190 conditions per place. [2025-03-17 11:03:59,103 INFO L140 encePairwiseOnDemand]: 209/263 looper letters, 3076 selfloop transitions, 512 changer transitions 40/3755 dead transitions. [2025-03-17 11:03:59,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3755 transitions, 39075 flow [2025-03-17 11:03:59,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-17 11:03:59,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-17 11:03:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 8682 transitions. [2025-03-17 11:03:59,109 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5894894079304726 [2025-03-17 11:03:59,109 INFO L175 Difference]: Start difference. First operand has 373 places, 1019 transitions, 9099 flow. Second operand 56 states and 8682 transitions. [2025-03-17 11:03:59,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3755 transitions, 39075 flow [2025-03-17 11:04:00,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 3755 transitions, 39064 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-17 11:04:00,285 INFO L231 Difference]: Finished difference. Result has 468 places, 1508 transitions, 16949 flow [2025-03-17 11:04:00,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=9088, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=16949, PETRI_PLACES=468, PETRI_TRANSITIONS=1508} [2025-03-17 11:04:00,287 INFO L279 CegarLoopForPetriNet]: 249 programPoint places, 219 predicate places. [2025-03-17 11:04:00,287 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 1508 transitions, 16949 flow [2025-03-17 11:04:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 132.84375) internal successors, (4251), 32 states have internal predecessors, (4251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:04:00,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:04:00,288 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-17 11:04:00,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:04:00,288 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-17 11:04:00,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:04:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 978182146, now seen corresponding path program 3 times [2025-03-17 11:04:00,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:04:00,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073207726] [2025-03-17 11:04:00,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:04:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:04:00,300 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 95 statements into 2 equivalence classes. [2025-03-17 11:04:00,319 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 11:04:00,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-17 11:04:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:04:01,716 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-17 11:04:01,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:04:01,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073207726] [2025-03-17 11:04:01,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073207726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:04:01,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:04:01,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-17 11:04:01,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512156701] [2025-03-17 11:04:01,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:04:01,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-17 11:04:01,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:04:01,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-17 11:04:01,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-03-17 11:04:08,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 263 [2025-03-17 11:04:08,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 1508 transitions, 16949 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-17 11:04:08,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:04:08,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 263 [2025-03-17 11:04:08,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand