/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:49:13,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:49:13,146 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:49:13,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:49:13,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:49:13,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:49:13,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:49:13,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:49:13,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:49:13,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:49:13,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:49:13,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:49:13,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:49:13,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:49:13,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:49:13,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:13,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:49:13,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:13,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:49:13,169 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:49:13,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:49:13,393 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:49:13,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:49:13,396 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:49:13,397 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:49:13,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-13 23:49:14,696 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b18228/e02d832f47044625b8b85662311cab64/FLAG3a648343a [2025-04-13 23:49:14,908 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:49:14,908 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-13 23:49:14,917 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b18228/e02d832f47044625b8b85662311cab64/FLAG3a648343a [2025-04-13 23:49:15,697 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1b18228/e02d832f47044625b8b85662311cab64 [2025-04-13 23:49:15,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:49:15,700 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:49:15,701 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:15,701 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:49:15,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:49:15,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:15" (1/1) ... [2025-04-13 23:49:15,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544e9cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:15, skipping insertion in model container [2025-04-13 23:49:15,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:49:15" (1/1) ... [2025-04-13 23:49:15,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:49:15,935 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-04-13 23:49:15,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:15,948 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:49:15,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i[31244,31257] [2025-04-13 23:49:16,000 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:49:16,022 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:49:16,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16 WrapperNode [2025-04-13 23:49:16,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:49:16,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:16,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:49:16,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:49:16,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,051 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-04-13 23:49:16,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:49:16,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:49:16,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:49:16,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:49:16,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,070 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:49:16,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,073 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:49:16,090 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:49:16,090 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:49:16,090 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:49:16,091 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (1/1) ... [2025-04-13 23:49:16,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:49:16,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:16,119 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-04-13 23:49:16,122 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-04-13 23:49:16,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:49:16,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:49:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-04-13 23:49:16,139 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-04-13 23:49:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:49:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:49:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:49:16,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:49:16,139 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-13 23:49:16,139 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-13 23:49:16,140 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:49:16,235 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:49:16,237 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:49:16,362 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:49:16,363 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:49:16,363 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:49:16,462 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:49:16,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:16 BoogieIcfgContainer [2025-04-13 23:49:16,462 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:49:16,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:49:16,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:49:16,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:49:16,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:49:15" (1/3) ... [2025-04-13 23:49:16,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d0b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:16, skipping insertion in model container [2025-04-13 23:49:16,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:49:16" (2/3) ... [2025-04-13 23:49:16,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d0b81b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:49:16, skipping insertion in model container [2025-04-13 23:49:16,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:49:16" (3/3) ... [2025-04-13 23:49:16,469 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-04-13 23:49:16,477 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:49:16,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG read_write_lock-2.i that has 3 procedures, 33 locations, 30 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 23:49:16,478 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:49:16,525 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 23:49:16,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 128 flow [2025-04-13 23:49:16,568 INFO L116 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-04-13 23:49:16,570 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 23:49:16,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 46 events. 0/46 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-13 23:49:16,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 50 transitions, 128 flow [2025-04-13 23:49:16,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 109 flow [2025-04-13 23:49:16,578 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:49:16,586 INFO L340 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;@376316a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:49:16,586 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 23:49:16,593 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:49:16,593 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-13 23:49:16,593 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:49:16,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:16,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:16,594 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:16,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:16,599 INFO L85 PathProgramCache]: Analyzing trace with hash 709975422, now seen corresponding path program 1 times [2025-04-13 23:49:16,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:16,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721994654] [2025-04-13 23:49:16,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:16,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:16,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:49:16,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:49:16,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:16,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:16,868 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721994654] [2025-04-13 23:49:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721994654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:16,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350659822] [2025-04-13 23:49:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:16,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:49:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:16,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:49:16,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:49:16,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:16,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:16,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:16,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:16,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:20,407 INFO L116 PetriNetUnfolderBase]: 54331/73613 cut-off events. [2025-04-13 23:49:20,407 INFO L117 PetriNetUnfolderBase]: For 5905/5905 co-relation queries the response was YES. [2025-04-13 23:49:20,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150269 conditions, 73613 events. 54331/73613 cut-off events. For 5905/5905 co-relation queries the response was YES. Maximal size of possible extension queue 2112. Compared 455442 event pairs, 6788 based on Foata normal form. 0/70832 useless extension candidates. Maximal degree in co-relation 135097. Up to 20361 conditions per place. [2025-04-13 23:49:20,708 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 240 selfloop transitions, 37 changer transitions 24/303 dead transitions. [2025-04-13 23:49:20,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 303 transitions, 1316 flow [2025-04-13 23:49:20,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:49:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 23:49:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 382 transitions. [2025-04-13 23:49:20,718 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5876923076923077 [2025-04-13 23:49:20,719 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 109 flow. Second operand 13 states and 382 transitions. [2025-04-13 23:49:20,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 303 transitions, 1316 flow [2025-04-13 23:49:20,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 303 transitions, 1252 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-13 23:49:20,800 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 339 flow [2025-04-13 23:49:20,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=339, PETRI_PLACES=70, PETRI_TRANSITIONS=83} [2025-04-13 23:49:20,805 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-04-13 23:49:20,805 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 339 flow [2025-04-13 23:49:20,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:20,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:20,805 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:20,805 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:49:20,805 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:20,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash -70084031, now seen corresponding path program 1 times [2025-04-13 23:49:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:20,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673242744] [2025-04-13 23:49:20,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:20,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:20,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:49:20,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:49:20,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:20,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:20,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673242744] [2025-04-13 23:49:20,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673242744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:20,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:20,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:49:20,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834498259] [2025-04-13 23:49:20,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:20,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:49:20,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:20,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:49:20,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:49:20,886 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:20,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:20,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:20,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:20,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:23,394 INFO L116 PetriNetUnfolderBase]: 42229/58837 cut-off events. [2025-04-13 23:49:23,394 INFO L117 PetriNetUnfolderBase]: For 26392/26392 co-relation queries the response was YES. [2025-04-13 23:49:23,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144977 conditions, 58837 events. 42229/58837 cut-off events. For 26392/26392 co-relation queries the response was YES. Maximal size of possible extension queue 1678. Compared 362396 event pairs, 15090 based on Foata normal form. 3314/60661 useless extension candidates. Maximal degree in co-relation 125531. Up to 31638 conditions per place. [2025-04-13 23:49:23,598 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 125 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2025-04-13 23:49:23,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 131 transitions, 781 flow [2025-04-13 23:49:23,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:49:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:49:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2025-04-13 23:49:23,599 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2025-04-13 23:49:23,599 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 339 flow. Second operand 3 states and 95 transitions. [2025-04-13 23:49:23,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 131 transitions, 781 flow [2025-04-13 23:49:24,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 131 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 23:49:24,244 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 355 flow [2025-04-13 23:49:24,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=355, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2025-04-13 23:49:24,245 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-04-13 23:49:24,245 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 355 flow [2025-04-13 23:49:24,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:24,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:24,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:24,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:49:24,245 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:24,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1814945441, now seen corresponding path program 2 times [2025-04-13 23:49:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:24,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120505106] [2025-04-13 23:49:24,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:49:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:24,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 23:49:24,257 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 23:49:24,257 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:49:24,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:24,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:24,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:24,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120505106] [2025-04-13 23:49:24,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120505106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:24,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:24,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:49:24,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974655880] [2025-04-13 23:49:24,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:24,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:49:24,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:24,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:49:24,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:49:24,307 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:24,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:24,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:24,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:24,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:25,507 INFO L116 PetriNetUnfolderBase]: 21509/31541 cut-off events. [2025-04-13 23:49:25,507 INFO L117 PetriNetUnfolderBase]: For 24210/24217 co-relation queries the response was YES. [2025-04-13 23:49:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79197 conditions, 31541 events. 21509/31541 cut-off events. For 24210/24217 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 200404 event pairs, 5795 based on Foata normal form. 2274/33083 useless extension candidates. Maximal degree in co-relation 70997. Up to 12835 conditions per place. [2025-04-13 23:49:25,869 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 123 selfloop transitions, 7 changer transitions 39/171 dead transitions. [2025-04-13 23:49:25,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 171 transitions, 1021 flow [2025-04-13 23:49:25,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:49:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:49:25,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2025-04-13 23:49:25,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.69 [2025-04-13 23:49:25,871 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 355 flow. Second operand 4 states and 138 transitions. [2025-04-13 23:49:25,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 171 transitions, 1021 flow [2025-04-13 23:49:26,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 171 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 23:49:26,092 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 357 flow [2025-04-13 23:49:26,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=357, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2025-04-13 23:49:26,094 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-04-13 23:49:26,094 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 357 flow [2025-04-13 23:49:26,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:26,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:26,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:26,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:49:26,095 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:26,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:26,095 INFO L85 PathProgramCache]: Analyzing trace with hash -209130431, now seen corresponding path program 1 times [2025-04-13 23:49:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:26,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648855758] [2025-04-13 23:49:26,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:49:26,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:49:26,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:26,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:26,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:26,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648855758] [2025-04-13 23:49:26,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648855758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:26,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:26,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:26,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000184488] [2025-04-13 23:49:26,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:26,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:49:26,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:26,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:49:26,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:49:26,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:26,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:26,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:26,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:26,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:27,966 INFO L116 PetriNetUnfolderBase]: 22042/32684 cut-off events. [2025-04-13 23:49:27,966 INFO L117 PetriNetUnfolderBase]: For 26099/26099 co-relation queries the response was YES. [2025-04-13 23:49:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86197 conditions, 32684 events. 22042/32684 cut-off events. For 26099/26099 co-relation queries the response was YES. Maximal size of possible extension queue 1124. Compared 212277 event pairs, 3526 based on Foata normal form. 0/32415 useless extension candidates. Maximal degree in co-relation 79644. Up to 8032 conditions per place. [2025-04-13 23:49:28,140 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 220 selfloop transitions, 49 changer transitions 86/357 dead transitions. [2025-04-13 23:49:28,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 357 transitions, 2297 flow [2025-04-13 23:49:28,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:49:28,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 23:49:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 360 transitions. [2025-04-13 23:49:28,145 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2025-04-13 23:49:28,145 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 357 flow. Second operand 13 states and 360 transitions. [2025-04-13 23:49:28,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 357 transitions, 2297 flow [2025-04-13 23:49:28,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 357 transitions, 2243 flow, removed 14 selfloop flow, removed 1 redundant places. [2025-04-13 23:49:28,486 INFO L231 Difference]: Finished difference. Result has 98 places, 116 transitions, 747 flow [2025-04-13 23:49:28,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=747, PETRI_PLACES=98, PETRI_TRANSITIONS=116} [2025-04-13 23:49:28,487 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 41 predicate places. [2025-04-13 23:49:28,487 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 747 flow [2025-04-13 23:49:28,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:28,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:28,487 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:28,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:49:28,487 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:28,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 93774458, now seen corresponding path program 1 times [2025-04-13 23:49:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:28,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442909570] [2025-04-13 23:49:28,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:28,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:28,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:49:28,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:49:28,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:28,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:28,548 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442909570] [2025-04-13 23:49:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442909570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:28,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513240352] [2025-04-13 23:49:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:28,548 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:49:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:28,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:49:28,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:49:28,549 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:28,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 116 transitions, 747 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:28,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:28,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:28,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:30,506 INFO L116 PetriNetUnfolderBase]: 20593/30809 cut-off events. [2025-04-13 23:49:30,506 INFO L117 PetriNetUnfolderBase]: For 34585/34585 co-relation queries the response was YES. [2025-04-13 23:49:30,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92247 conditions, 30809 events. 20593/30809 cut-off events. For 34585/34585 co-relation queries the response was YES. Maximal size of possible extension queue 1111. Compared 203229 event pairs, 3616 based on Foata normal form. 255/31061 useless extension candidates. Maximal degree in co-relation 87116. Up to 7317 conditions per place. [2025-04-13 23:49:30,677 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 189 selfloop transitions, 56 changer transitions 54/301 dead transitions. [2025-04-13 23:49:30,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 301 transitions, 2181 flow [2025-04-13 23:49:30,678 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:49:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 23:49:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2025-04-13 23:49:30,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47384615384615386 [2025-04-13 23:49:30,679 INFO L175 Difference]: Start difference. First operand has 98 places, 116 transitions, 747 flow. Second operand 13 states and 308 transitions. [2025-04-13 23:49:30,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 301 transitions, 2181 flow [2025-04-13 23:49:31,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 301 transitions, 2157 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 23:49:31,244 INFO L231 Difference]: Finished difference. Result has 114 places, 130 transitions, 986 flow [2025-04-13 23:49:31,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=986, PETRI_PLACES=114, PETRI_TRANSITIONS=130} [2025-04-13 23:49:31,245 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 57 predicate places. [2025-04-13 23:49:31,245 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 130 transitions, 986 flow [2025-04-13 23:49:31,245 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:31,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:31,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:49:31,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:49:31,245 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:31,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:31,246 INFO L85 PathProgramCache]: Analyzing trace with hash 380672711, now seen corresponding path program 1 times [2025-04-13 23:49:31,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:31,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937724928] [2025-04-13 23:49:31,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:31,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:31,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:49:31,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:49:31,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:31,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:31,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937724928] [2025-04-13 23:49:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937724928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629076870] [2025-04-13 23:49:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:31,312 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:49:31,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:31,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:49:31,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:49:31,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:31,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 130 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:31,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:31,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:31,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:33,440 INFO L116 PetriNetUnfolderBase]: 18310/27603 cut-off events. [2025-04-13 23:49:33,441 INFO L117 PetriNetUnfolderBase]: For 38916/38916 co-relation queries the response was YES. [2025-04-13 23:49:33,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85803 conditions, 27603 events. 18310/27603 cut-off events. For 38916/38916 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 181905 event pairs, 3843 based on Foata normal form. 266/27866 useless extension candidates. Maximal degree in co-relation 84721. Up to 7784 conditions per place. [2025-04-13 23:49:33,629 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 197 selfloop transitions, 59 changer transitions 59/317 dead transitions. [2025-04-13 23:49:33,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 317 transitions, 2489 flow [2025-04-13 23:49:33,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:49:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 23:49:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 308 transitions. [2025-04-13 23:49:33,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47384615384615386 [2025-04-13 23:49:33,631 INFO L175 Difference]: Start difference. First operand has 114 places, 130 transitions, 986 flow. Second operand 13 states and 308 transitions. [2025-04-13 23:49:33,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 317 transitions, 2489 flow [2025-04-13 23:49:33,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 317 transitions, 2449 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 23:49:33,985 INFO L231 Difference]: Finished difference. Result has 127 places, 144 transitions, 1223 flow [2025-04-13 23:49:33,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1223, PETRI_PLACES=127, PETRI_TRANSITIONS=144} [2025-04-13 23:49:33,986 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 70 predicate places. [2025-04-13 23:49:33,986 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 144 transitions, 1223 flow [2025-04-13 23:49:33,986 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:33,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:33,987 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-04-13 23:49:33,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:49:33,987 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:33,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1355294516, now seen corresponding path program 1 times [2025-04-13 23:49:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:33,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045168090] [2025-04-13 23:49:33,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:49:33,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:33,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:49:34,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:49:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:34,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:34,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045168090] [2025-04-13 23:49:34,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045168090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:49:34,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:49:34,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:49:34,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007148216] [2025-04-13 23:49:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:49:34,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:49:34,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:34,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:49:34,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:49:34,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 50 [2025-04-13 23:49:34,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 144 transitions, 1223 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:34,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:34,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 50 [2025-04-13 23:49:34,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:35,852 INFO L116 PetriNetUnfolderBase]: 16632/25176 cut-off events. [2025-04-13 23:49:35,853 INFO L117 PetriNetUnfolderBase]: For 46008/46016 co-relation queries the response was YES. [2025-04-13 23:49:35,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81400 conditions, 25176 events. 16632/25176 cut-off events. For 46008/46016 co-relation queries the response was YES. Maximal size of possible extension queue 936. Compared 165237 event pairs, 4456 based on Foata normal form. 379/25552 useless extension candidates. Maximal degree in co-relation 80247. Up to 10270 conditions per place. [2025-04-13 23:49:36,017 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 170 selfloop transitions, 11 changer transitions 58/241 dead transitions. [2025-04-13 23:49:36,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 241 transitions, 2188 flow [2025-04-13 23:49:36,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:49:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 23:49:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 180 transitions. [2025-04-13 23:49:36,018 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-04-13 23:49:36,018 INFO L175 Difference]: Start difference. First operand has 127 places, 144 transitions, 1223 flow. Second operand 7 states and 180 transitions. [2025-04-13 23:49:36,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 241 transitions, 2188 flow [2025-04-13 23:49:36,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 241 transitions, 2135 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-04-13 23:49:36,445 INFO L231 Difference]: Finished difference. Result has 130 places, 129 transitions, 1053 flow [2025-04-13 23:49:36,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1087, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1053, PETRI_PLACES=130, PETRI_TRANSITIONS=129} [2025-04-13 23:49:36,445 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 73 predicate places. [2025-04-13 23:49:36,446 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 1053 flow [2025-04-13 23:49:36,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:49:36,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:36,446 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-04-13 23:49:36,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:49:36,446 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:36,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1928781810, now seen corresponding path program 2 times [2025-04-13 23:49:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:36,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149555320] [2025-04-13 23:49:36,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:49:36,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:36,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:49:36,455 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:49:36,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:49:36,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:36,455 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:49:36,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:49:36,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:49:36,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:49:36,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:49:36,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:49:36,487 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:49:36,488 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 23:49:36,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 23:49:36,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 23:49:36,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 23:49:36,489 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 23:49:36,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 23:49:36,491 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 23:49:36,491 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 23:49:36,494 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2025-04-13 23:49:36,550 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:49:36,550 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:49:36,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:49:36 BasicIcfg [2025-04-13 23:49:36,555 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:49:36,556 INFO L158 Benchmark]: Toolchain (without parser) took 20855.48ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 98.1MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-13 23:49:36,556 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:36,556 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.52ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 75.2MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:49:36,556 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.19ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:49:36,556 INFO L158 Benchmark]: Boogie Preprocessor took 37.78ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:49:36,557 INFO L158 Benchmark]: IcfgBuilder took 372.12ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 49.3MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:49:36,557 INFO L158 Benchmark]: TraceAbstraction took 20091.86ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 48.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-13 23:49:36,558 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.52ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 75.2MB in the end (delta: 22.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.19ms. Allocated memory is still 142.6MB. Free memory was 75.2MB in the beginning and 73.1MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.78ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 71.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 372.12ms. Allocated memory is still 142.6MB. Free memory was 71.0MB in the beginning and 49.3MB in the end (delta: 21.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 20091.86ms. Allocated memory was 142.6MB in the beginning and 3.9GB in the end (delta: 3.7GB). Free memory was 48.6MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 738]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [r=0, t1=-2, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [r=0, t1=-2, t2=-1, w=0, x=0, y=0] [L724] 2 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [r=0, t1=-2, t2=-1, t3=0, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=0, t1=-2, t2=-1, t3=0, t4=1, w=0, x=0, y=0] [L724] 4 int l; VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=0, x=0, y=0] [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L738] COND FALSE 2 !(!(ly == lx)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L730] 4 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L733] 4 int ly = y; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=0, x=0, y=0] [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L716] 1 x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] [L738] COND TRUE 4 !(ly == lx) [L738] 4 reach_error() VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=3, y=0] - UnprovableResult [Line: 750]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 751]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 73 locations, 74 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 999 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 999 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2801 IncrementalHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 0 mSDtfsCounter, 2801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1223occurred in iteration=6, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 23:49:36,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...