/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -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 19:15:47,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:15:47,465 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 19:15:47,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:15:47,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:15:47,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:15:47,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:15:47,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:15:47,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:15:47,493 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:15:47,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:15:47,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:15:47,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:15:47,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:15:47,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:15:47,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:15:47,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:47,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:15:47,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:47,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:15:47,496 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:15:47,496 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 [2025-04-13 19:15:47,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:15:47,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:15:47,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:15:47,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:15:47,706 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:15:47,707 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 19:15:49,012 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5357756c4/c3c8b5fdf4d74e4ea58a3107a712da6f/FLAGd60bd587a [2025-04-13 19:15:49,298 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:15:49,299 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-2.i [2025-04-13 19:15:49,311 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5357756c4/c3c8b5fdf4d74e4ea58a3107a712da6f/FLAGd60bd587a [2025-04-13 19:15:51,113 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5357756c4/c3c8b5fdf4d74e4ea58a3107a712da6f [2025-04-13 19:15:51,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:15:51,116 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:15:51,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:15:51,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:15:51,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:15:51,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,122 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ee10fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51, skipping insertion in model container [2025-04-13 19:15:51,122 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,147 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:15:51,356 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 19:15:51,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:15:51,370 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:15:51,410 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 19:15:51,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:15:51,436 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:15:51,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51 WrapperNode [2025-04-13 19:15:51,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:15:51,437 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:15:51,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:15:51,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:15:51,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,474 INFO L138 Inliner]: procedures = 172, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 94 [2025-04-13 19:15:51,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:15:51,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:15:51,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:15:51,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:15:51,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,496 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 19:15:51,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,500 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,500 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:15:51,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:15:51,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:15:51,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:15:51,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (1/1) ... [2025-04-13 19:15:51,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:15:51,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:15:51,530 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 19:15:51,532 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 19:15:51,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-04-13 19:15:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:15:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:15:51,549 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-13 19:15:51,549 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-13 19:15:51,550 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:15:51,632 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:15:51,633 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:15:51,726 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:15:51,727 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:15:51,727 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:15:51,833 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:15:51,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:15:51 BoogieIcfgContainer [2025-04-13 19:15:51,834 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:15:51,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:15:51,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:15:51,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:15:51,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:15:51" (1/3) ... [2025-04-13 19:15:51,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f150ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:15:51, skipping insertion in model container [2025-04-13 19:15:51,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:15:51" (2/3) ... [2025-04-13 19:15:51,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f150ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:15:51, skipping insertion in model container [2025-04-13 19:15:51,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:15:51" (3/3) ... [2025-04-13 19:15:51,842 INFO L128 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2025-04-13 19:15:51,853 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:15:51,855 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 19:15:51,855 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:15:51,908 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 19:15:51,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 50 transitions, 128 flow [2025-04-13 19:15:51,967 INFO L116 PetriNetUnfolderBase]: 0/46 cut-off events. [2025-04-13 19:15:51,968 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-13 19:15:51,969 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 87 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 19:15:51,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 50 transitions, 128 flow [2025-04-13 19:15:51,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 109 flow [2025-04-13 19:15:51,981 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:15:51,992 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;@3df31a14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:15:51,992 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 19:15:51,999 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:15:51,999 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-13 19:15:51,999 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 19:15:51,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:52,000 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:52,000 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 19:15:52,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:52,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2011406647, now seen corresponding path program 1 times [2025-04-13 19:15:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:52,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551759560] [2025-04-13 19:15:52,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:52,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:52,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 19:15:52,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 19:15:52,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:52,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:52,256 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 19:15:52,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:52,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551759560] [2025-04-13 19:15:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551759560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:52,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062696549] [2025-04-13 19:15:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:52,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:52,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:52,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:52,332 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-13 19:15:52,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 109 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 19:15:52,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:52,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-13 19:15:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:54,257 INFO L116 PetriNetUnfolderBase]: 16925/26374 cut-off events. [2025-04-13 19:15:54,258 INFO L117 PetriNetUnfolderBase]: For 2464/2464 co-relation queries the response was YES. [2025-04-13 19:15:54,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51288 conditions, 26374 events. 16925/26374 cut-off events. For 2464/2464 co-relation queries the response was YES. Maximal size of possible extension queue 1209. Compared 199655 event pairs, 1911 based on Foata normal form. 0/24788 useless extension candidates. Maximal degree in co-relation 45049. Up to 7302 conditions per place. [2025-04-13 19:15:54,403 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 175 selfloop transitions, 37 changer transitions 12/234 dead transitions. [2025-04-13 19:15:54,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 234 transitions, 1024 flow [2025-04-13 19:15:54,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:15:54,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:15:54,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 409 transitions. [2025-04-13 19:15:54,415 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6292307692307693 [2025-04-13 19:15:54,416 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 109 flow. Second operand 13 states and 409 transitions. [2025-04-13 19:15:54,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 234 transitions, 1024 flow [2025-04-13 19:15:54,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 234 transitions, 960 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-13 19:15:54,446 INFO L231 Difference]: Finished difference. Result has 70 places, 83 transitions, 339 flow [2025-04-13 19:15:54,447 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 19:15:54,450 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-04-13 19:15:54,450 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 83 transitions, 339 flow [2025-04-13 19:15:54,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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 19:15:54,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:54,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:54,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:15:54,451 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 19:15:54,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1173152695, now seen corresponding path program 1 times [2025-04-13 19:15:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:54,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918431954] [2025-04-13 19:15:54,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:54,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:15:54,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:15:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:54,532 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 19:15:54,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:54,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918431954] [2025-04-13 19:15:54,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918431954] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:54,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:15:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683812005] [2025-04-13 19:15:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:54,534 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:15:54,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:54,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:15:54,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:15:54,537 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-04-13 19:15:54,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 83 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 19:15:54,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:54,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-04-13 19:15:54,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:55,744 INFO L116 PetriNetUnfolderBase]: 11847/19784 cut-off events. [2025-04-13 19:15:55,745 INFO L117 PetriNetUnfolderBase]: For 11315/11875 co-relation queries the response was YES. [2025-04-13 19:15:55,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45176 conditions, 19784 events. 11847/19784 cut-off events. For 11315/11875 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 162399 event pairs, 4501 based on Foata normal form. 1270/19329 useless extension candidates. Maximal degree in co-relation 36122. Up to 8299 conditions per place. [2025-04-13 19:15:55,860 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 47 selfloop transitions, 4 changer transitions 0/104 dead transitions. [2025-04-13 19:15:55,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 506 flow [2025-04-13 19:15:55,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:15:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:15:55,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-04-13 19:15:55,861 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.74 [2025-04-13 19:15:55,861 INFO L175 Difference]: Start difference. First operand has 70 places, 83 transitions, 339 flow. Second operand 3 states and 111 transitions. [2025-04-13 19:15:55,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 506 flow [2025-04-13 19:15:56,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 104 transitions, 506 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:15:56,012 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 355 flow [2025-04-13 19:15:56,012 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 19:15:56,013 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-04-13 19:15:56,013 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 355 flow [2025-04-13 19:15:56,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 19:15:56,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:56,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:56,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:15:56,013 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 19:15:56,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1923488155, now seen corresponding path program 2 times [2025-04-13 19:15:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:56,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990652883] [2025-04-13 19:15:56,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:15:56,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:56,027 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:15:56,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:15:56,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:15:56,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:56,081 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 19:15:56,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:56,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990652883] [2025-04-13 19:15:56,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990652883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:56,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:56,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:15:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995595287] [2025-04-13 19:15:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:56,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:15:56,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:56,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:15:56,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:15:56,090 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2025-04-13 19:15:56,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 19:15:56,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:56,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2025-04-13 19:15:56,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:56,859 INFO L116 PetriNetUnfolderBase]: 8333/14662 cut-off events. [2025-04-13 19:15:56,859 INFO L117 PetriNetUnfolderBase]: For 9581/9848 co-relation queries the response was YES. [2025-04-13 19:15:56,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33420 conditions, 14662 events. 8333/14662 cut-off events. For 9581/9848 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 119764 event pairs, 2136 based on Foata normal form. 740/14360 useless extension candidates. Maximal degree in co-relation 29031. Up to 4848 conditions per place. [2025-04-13 19:15:56,920 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 66 selfloop transitions, 9 changer transitions 3/131 dead transitions. [2025-04-13 19:15:56,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 131 transitions, 659 flow [2025-04-13 19:15:56,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:15:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:15:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-04-13 19:15:56,922 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.78 [2025-04-13 19:15:56,922 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 355 flow. Second operand 4 states and 156 transitions. [2025-04-13 19:15:56,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 131 transitions, 659 flow [2025-04-13 19:15:56,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 131 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:15:56,980 INFO L231 Difference]: Finished difference. Result has 77 places, 89 transitions, 413 flow [2025-04-13 19:15:56,980 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=413, PETRI_PLACES=77, PETRI_TRANSITIONS=89} [2025-04-13 19:15:56,980 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-04-13 19:15:56,980 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 89 transitions, 413 flow [2025-04-13 19:15:56,981 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 19:15:56,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:56,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:15:56,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:15:56,981 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 19:15:56,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:56,981 INFO L85 PathProgramCache]: Analyzing trace with hash 104411275, now seen corresponding path program 1 times [2025-04-13 19:15:56,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:56,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024149770] [2025-04-13 19:15:56,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:56,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:56,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:15:56,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:15:56,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:56,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:57,061 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 19:15:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:57,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024149770] [2025-04-13 19:15:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024149770] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:57,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:57,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948182695] [2025-04-13 19:15:57,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:57,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:57,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:57,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-13 19:15:57,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 89 transitions, 413 flow. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 19:15:57,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:57,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-13 19:15:57,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:15:58,582 INFO L116 PetriNetUnfolderBase]: 14579/23699 cut-off events. [2025-04-13 19:15:58,582 INFO L117 PetriNetUnfolderBase]: For 23837/24440 co-relation queries the response was YES. [2025-04-13 19:15:58,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60807 conditions, 23699 events. 14579/23699 cut-off events. For 23837/24440 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 180974 event pairs, 2196 based on Foata normal form. 549/23917 useless extension candidates. Maximal degree in co-relation 54512. Up to 5653 conditions per place. [2025-04-13 19:15:58,725 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 167 selfloop transitions, 50 changer transitions 70/303 dead transitions. [2025-04-13 19:15:58,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 303 transitions, 1884 flow [2025-04-13 19:15:58,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:15:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:15:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 395 transitions. [2025-04-13 19:15:58,727 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6076923076923076 [2025-04-13 19:15:58,727 INFO L175 Difference]: Start difference. First operand has 77 places, 89 transitions, 413 flow. Second operand 13 states and 395 transitions. [2025-04-13 19:15:58,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 303 transitions, 1884 flow [2025-04-13 19:15:58,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 303 transitions, 1884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:15:58,986 INFO L231 Difference]: Finished difference. Result has 99 places, 118 transitions, 776 flow [2025-04-13 19:15:58,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=776, PETRI_PLACES=99, PETRI_TRANSITIONS=118} [2025-04-13 19:15:58,986 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 42 predicate places. [2025-04-13 19:15:58,986 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 118 transitions, 776 flow [2025-04-13 19:15:58,987 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 states have internal predecessors, (99), 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 19:15:58,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:15:58,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] [2025-04-13 19:15:58,987 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:15:58,987 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 19:15:58,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:15:58,987 INFO L85 PathProgramCache]: Analyzing trace with hash -143389088, now seen corresponding path program 1 times [2025-04-13 19:15:58,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:15:58,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255430735] [2025-04-13 19:15:58,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:15:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:15:59,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:15:59,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:15:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:15:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:15:59,097 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 19:15:59,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:15:59,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255430735] [2025-04-13 19:15:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255430735] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:15:59,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:15:59,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:15:59,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188347387] [2025-04-13 19:15:59,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:15:59,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:15:59,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:15:59,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:15:59,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:15:59,131 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-13 19:15:59,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 118 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 19:15:59,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:15:59,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-13 19:15:59,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:00,469 INFO L116 PetriNetUnfolderBase]: 12629/21227 cut-off events. [2025-04-13 19:16:00,470 INFO L117 PetriNetUnfolderBase]: For 30870/31182 co-relation queries the response was YES. [2025-04-13 19:16:00,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63066 conditions, 21227 events. 12629/21227 cut-off events. For 30870/31182 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 166162 event pairs, 2665 based on Foata normal form. 482/21539 useless extension candidates. Maximal degree in co-relation 59643. Up to 5490 conditions per place. [2025-04-13 19:16:00,657 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 170 selfloop transitions, 63 changer transitions 19/268 dead transitions. [2025-04-13 19:16:00,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 268 transitions, 1949 flow [2025-04-13 19:16:00,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:16:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:16:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 368 transitions. [2025-04-13 19:16:00,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5661538461538461 [2025-04-13 19:16:00,659 INFO L175 Difference]: Start difference. First operand has 99 places, 118 transitions, 776 flow. Second operand 13 states and 368 transitions. [2025-04-13 19:16:00,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 268 transitions, 1949 flow [2025-04-13 19:16:01,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 268 transitions, 1895 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-04-13 19:16:01,023 INFO L231 Difference]: Finished difference. Result has 113 places, 139 transitions, 1076 flow [2025-04-13 19:16:01,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1076, PETRI_PLACES=113, PETRI_TRANSITIONS=139} [2025-04-13 19:16:01,023 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2025-04-13 19:16:01,023 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 1076 flow [2025-04-13 19:16:01,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 19:16:01,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:01,024 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 19:16:01,024 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:16:01,024 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 19:16:01,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1343383839, now seen corresponding path program 1 times [2025-04-13 19:16:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:01,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559307474] [2025-04-13 19:16:01,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:01,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:01,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:16:01,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:16:01,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:01,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:16:01,095 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 19:16:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:16:01,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559307474] [2025-04-13 19:16:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559307474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:16:01,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:16:01,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:16:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394903350] [2025-04-13 19:16:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:16:01,096 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:16:01,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:16:01,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:16:01,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:16:01,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 50 [2025-04-13 19:16:01,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 1076 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 19:16:01,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:16:01,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 50 [2025-04-13 19:16:01,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:16:02,425 INFO L116 PetriNetUnfolderBase]: 12952/21560 cut-off events. [2025-04-13 19:16:02,426 INFO L117 PetriNetUnfolderBase]: For 39903/40510 co-relation queries the response was YES. [2025-04-13 19:16:02,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67159 conditions, 21560 events. 12952/21560 cut-off events. For 39903/40510 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 167450 event pairs, 2806 based on Foata normal form. 705/22069 useless extension candidates. Maximal degree in co-relation 63770. Up to 5895 conditions per place. [2025-04-13 19:16:02,570 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 168 selfloop transitions, 66 changer transitions 37/294 dead transitions. [2025-04-13 19:16:02,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 294 transitions, 2304 flow [2025-04-13 19:16:02,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 19:16:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 19:16:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 370 transitions. [2025-04-13 19:16:02,572 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5692307692307692 [2025-04-13 19:16:02,572 INFO L175 Difference]: Start difference. First operand has 113 places, 139 transitions, 1076 flow. Second operand 13 states and 370 transitions. [2025-04-13 19:16:02,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 294 transitions, 2304 flow [2025-04-13 19:16:02,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 294 transitions, 2290 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-13 19:16:02,883 INFO L231 Difference]: Finished difference. Result has 128 places, 156 transitions, 1386 flow [2025-04-13 19:16:02,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1062, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1386, PETRI_PLACES=128, PETRI_TRANSITIONS=156} [2025-04-13 19:16:02,884 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 71 predicate places. [2025-04-13 19:16:02,884 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 156 transitions, 1386 flow [2025-04-13 19:16:02,884 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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 19:16:02,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:16:02,884 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 19:16:02,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:16:02,884 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 19:16:02,885 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:16:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1851083039, now seen corresponding path program 1 times [2025-04-13 19:16:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:16:02,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775950112] [2025-04-13 19:16:02,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:16:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:16:02,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:16:02,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:16:02,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:02,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:02,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:16:02,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:16:02,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:16:02,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:16:02,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:16:02,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:16:02,919 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:16:02,919 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2025-04-13 19:16:02,922 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 19:16:02,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:16:02,923 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-04-13 19:16:02,968 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:16:02,968 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:16:02,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:16:02 BasicIcfg [2025-04-13 19:16:02,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:16:02,974 INFO L158 Benchmark]: Toolchain (without parser) took 11857.70ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 99.2MB in the beginning and 247.5MB in the end (delta: -148.3MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 19:16:02,974 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:16:02,974 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.0MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:16:02,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.76ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:16:02,975 INFO L158 Benchmark]: Boogie Preprocessor took 27.64ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:16:02,975 INFO L158 Benchmark]: RCFGBuilder took 328.06ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 50.8MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 19:16:02,975 INFO L158 Benchmark]: TraceAbstraction took 11138.01ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 50.8MB in the beginning and 247.5MB in the end (delta: -196.6MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2025-04-13 19:16:02,976 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.17ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 319.71ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 76.0MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.76ms. Allocated memory is still 142.6MB. Free memory was 76.0MB in the beginning and 74.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.64ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 72.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 328.06ms. Allocated memory is still 142.6MB. Free memory was 72.6MB in the beginning and 50.8MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11138.01ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 50.8MB in the beginning and 247.5MB in the end (delta: -196.6MB). Peak memory consumption was 1.1GB. 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] [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] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [r=1, 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}, 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] [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() [L730] 4 y = l VAL [\at(arg, Pre)={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, 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=0, w=1, x=0, y=0] [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: 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. - 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: 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: 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. - 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: 11.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 775 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 720 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1909 IncrementalHoareTripleChecker+Invalid, 1928 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 78 mSDtfsCounter, 1909 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1386occurred in iteration=6, InterpolantAutomatonStates: 59, 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.5s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 19:16:02,988 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...