/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-wmm/safe035_power.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:56,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:56,881 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-14 00:10:56,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:56,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:56,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:56,912 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:56,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:56,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:56,912 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:56,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:56,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:56,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:56,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:56,913 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:56,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:56,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:56,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:56,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:56,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:56,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:56,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:56,916 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-14 00:10:57,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:57,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:57,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:57,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:57,200 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:57,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe035_power.i [2025-04-14 00:10:58,564 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ce30593/89aaf45aa2c74cf28b828697482c08d7/FLAGd48de879a [2025-04-14 00:10:58,793 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:58,794 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe035_power.i [2025-04-14 00:10:58,809 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ce30593/89aaf45aa2c74cf28b828697482c08d7/FLAGd48de879a [2025-04-14 00:10:59,615 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28ce30593/89aaf45aa2c74cf28b828697482c08d7 [2025-04-14 00:10:59,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:59,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:59,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:59,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:59,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:59,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:59" (1/1) ... [2025-04-14 00:10:59,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51346b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:59, skipping insertion in model container [2025-04-14 00:10:59,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:59" (1/1) ... [2025-04-14 00:10:59,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:59,804 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-wmm/safe035_power.i[947,960] [2025-04-14 00:10:59,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:59,971 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:59,985 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-wmm/safe035_power.i[947,960] [2025-04-14 00:11:00,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:00,082 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:00,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00 WrapperNode [2025-04-14 00:11:00,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:00,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:00,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:00,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:00,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,130 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2025-04-14 00:11:00,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:00,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:00,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:00,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:00,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,162 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-14 00:11:00,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:00,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:00,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:00,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:00,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (1/1) ... [2025-04-14 00:11:00,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:00,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:00,220 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-14 00:11:00,223 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-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:11:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:11:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:11:00,239 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:11:00,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:11:00,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:00,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:00,240 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:11:00,361 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:00,363 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:00,774 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:00,775 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:00,775 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:01,117 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:01,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:01 BoogieIcfgContainer [2025-04-14 00:11:01,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:01,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:01,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:01,124 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:01,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:59" (1/3) ... [2025-04-14 00:11:01,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fec8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:01, skipping insertion in model container [2025-04-14 00:11:01,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:00" (2/3) ... [2025-04-14 00:11:01,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fec8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:01, skipping insertion in model container [2025-04-14 00:11:01,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:01" (3/3) ... [2025-04-14 00:11:01,125 INFO L128 eAbstractionObserver]: Analyzing ICFG safe035_power.i [2025-04-14 00:11:01,135 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:01,137 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe035_power.i that has 4 procedures, 39 locations, 35 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:11:01,137 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:01,188 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:11:01,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 38 transitions, 88 flow [2025-04-14 00:11:01,273 INFO L116 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-04-14 00:11:01,275 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:01,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:11:01,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 38 transitions, 88 flow [2025-04-14 00:11:01,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2025-04-14 00:11:01,286 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:01,299 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;@428d5f89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:01,299 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:11:01,308 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:01,308 INFO L116 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-04-14 00:11:01,308 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:01,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:01,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:01,309 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:01,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:01,314 INFO L85 PathProgramCache]: Analyzing trace with hash 555992934, now seen corresponding path program 1 times [2025-04-14 00:11:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:01,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654781332] [2025-04-14 00:11:01,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:01,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:01,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:11:01,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:11:01,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:01,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:01,732 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-14 00:11:01,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:01,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654781332] [2025-04-14 00:11:01,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654781332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:01,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:01,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:11:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163849153] [2025-04-14 00:11:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:01,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:01,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:01,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:01,757 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:01,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-14 00:11:01,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:01,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:01,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,004 INFO L116 PetriNetUnfolderBase]: 6894/9762 cut-off events. [2025-04-14 00:11:03,004 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-14 00:11:03,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19632 conditions, 9762 events. 6894/9762 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 50631 event pairs, 804 based on Foata normal form. 0/9406 useless extension candidates. Maximal degree in co-relation 19621. Up to 8443 conditions per place. [2025-04-14 00:11:03,063 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 46 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2025-04-14 00:11:03,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 215 flow [2025-04-14 00:11:03,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-04-14 00:11:03,073 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6052631578947368 [2025-04-14 00:11:03,075 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 69 transitions. [2025-04-14 00:11:03,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 215 flow [2025-04-14 00:11:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 212 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:03,081 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2025-04-14 00:11:03,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-04-14 00:11:03,087 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2025-04-14 00:11:03,087 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2025-04-14 00:11:03,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-14 00:11:03,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:03,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:03,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:03,088 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:03,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2092850488, now seen corresponding path program 1 times [2025-04-14 00:11:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:03,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409137287] [2025-04-14 00:11:03,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:03,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:11:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:11:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:03,447 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-14 00:11:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:03,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409137287] [2025-04-14 00:11:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409137287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601386161] [2025-04-14 00:11:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:03,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:03,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:03,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:03,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:03,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:11:03,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:03,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:03,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:04,566 INFO L116 PetriNetUnfolderBase]: 5900/8474 cut-off events. [2025-04-14 00:11:04,566 INFO L117 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2025-04-14 00:11:04,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17349 conditions, 8474 events. 5900/8474 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 43971 event pairs, 2078 based on Foata normal form. 343/8804 useless extension candidates. Maximal degree in co-relation 17339. Up to 4803 conditions per place. [2025-04-14 00:11:04,600 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 44 selfloop transitions, 2 changer transitions 31/80 dead transitions. [2025-04-14 00:11:04,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 326 flow [2025-04-14 00:11:04,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-14 00:11:04,602 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5736842105263158 [2025-04-14 00:11:04,602 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 5 states and 109 transitions. [2025-04-14 00:11:04,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 326 flow [2025-04-14 00:11:04,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 80 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:04,607 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 84 flow [2025-04-14 00:11:04,607 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2025-04-14 00:11:04,608 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2025-04-14 00:11:04,608 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 84 flow [2025-04-14 00:11:04,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-14 00:11:04,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:04,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:04,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:04,608 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:04,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:04,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1312810017, now seen corresponding path program 1 times [2025-04-14 00:11:04,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:04,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483693525] [2025-04-14 00:11:04,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:04,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:11:04,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:11:04,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:04,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:05,781 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-14 00:11:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:05,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483693525] [2025-04-14 00:11:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483693525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032808499] [2025-04-14 00:11:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:05,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:11:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:05,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:11:05,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:11:05,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:05,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-14 00:11:05,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:05,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:05,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:06,743 INFO L116 PetriNetUnfolderBase]: 5916/8498 cut-off events. [2025-04-14 00:11:06,743 INFO L117 PetriNetUnfolderBase]: For 990/990 co-relation queries the response was YES. [2025-04-14 00:11:06,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18273 conditions, 8498 events. 5916/8498 cut-off events. For 990/990 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 43390 event pairs, 3559 based on Foata normal form. 196/8691 useless extension candidates. Maximal degree in co-relation 18260. Up to 7433 conditions per place. [2025-04-14 00:11:06,781 INFO L140 encePairwiseOnDemand]: 30/38 looper letters, 56 selfloop transitions, 10 changer transitions 25/94 dead transitions. [2025-04-14 00:11:06,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 397 flow [2025-04-14 00:11:06,782 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:06,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:06,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2025-04-14 00:11:06,783 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5075187969924813 [2025-04-14 00:11:06,783 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 84 flow. Second operand 7 states and 135 transitions. [2025-04-14 00:11:06,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 397 flow [2025-04-14 00:11:06,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 94 transitions, 387 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:06,830 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 148 flow [2025-04-14 00:11:06,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-04-14 00:11:06,831 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2025-04-14 00:11:06,831 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 148 flow [2025-04-14 00:11:06,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 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-14 00:11:06,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:06,831 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:06,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:06,832 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:06,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2087135865, now seen corresponding path program 2 times [2025-04-14 00:11:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:06,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769062428] [2025-04-14 00:11:06,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:06,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:06,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-14 00:11:06,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 00:11:06,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:06,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:07,751 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-14 00:11:07,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:07,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769062428] [2025-04-14 00:11:07,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769062428] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:07,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:07,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:07,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450355594] [2025-04-14 00:11:07,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:07,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:07,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:07,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:07,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:07,755 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:07,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-14 00:11:07,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:07,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:07,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:08,692 INFO L116 PetriNetUnfolderBase]: 5823/8370 cut-off events. [2025-04-14 00:11:08,692 INFO L117 PetriNetUnfolderBase]: For 3806/3806 co-relation queries the response was YES. [2025-04-14 00:11:08,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20546 conditions, 8370 events. 5823/8370 cut-off events. For 3806/3806 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 42418 event pairs, 3361 based on Foata normal form. 196/8563 useless extension candidates. Maximal degree in co-relation 20530. Up to 6770 conditions per place. [2025-04-14 00:11:08,727 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 65 selfloop transitions, 17 changer transitions 25/110 dead transitions. [2025-04-14 00:11:08,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 110 transitions, 551 flow [2025-04-14 00:11:08,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-04-14 00:11:08,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5338345864661654 [2025-04-14 00:11:08,730 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 148 flow. Second operand 7 states and 142 transitions. [2025-04-14 00:11:08,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 110 transitions, 551 flow [2025-04-14 00:11:08,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 547 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:08,744 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 255 flow [2025-04-14 00:11:08,745 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2025-04-14 00:11:08,745 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2025-04-14 00:11:08,745 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 255 flow [2025-04-14 00:11:08,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 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-14 00:11:08,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:08,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:08,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:08,746 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:08,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:08,746 INFO L85 PathProgramCache]: Analyzing trace with hash -120923344, now seen corresponding path program 1 times [2025-04-14 00:11:08,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:08,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261698971] [2025-04-14 00:11:08,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:08,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:11:08,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:11:08,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:08,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:09,572 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-14 00:11:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:09,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261698971] [2025-04-14 00:11:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261698971] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:09,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:09,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:09,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686886009] [2025-04-14 00:11:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:09,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:09,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:09,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:09,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:09,574 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:09,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 255 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-14 00:11:09,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:09,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:09,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:10,685 INFO L116 PetriNetUnfolderBase]: 7452/10647 cut-off events. [2025-04-14 00:11:10,685 INFO L117 PetriNetUnfolderBase]: For 9100/9100 co-relation queries the response was YES. [2025-04-14 00:11:10,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29890 conditions, 10647 events. 7452/10647 cut-off events. For 9100/9100 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 55694 event pairs, 754 based on Foata normal form. 168/10802 useless extension candidates. Maximal degree in co-relation 29869. Up to 7315 conditions per place. [2025-04-14 00:11:10,735 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 83 selfloop transitions, 33 changer transitions 15/134 dead transitions. [2025-04-14 00:11:10,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 134 transitions, 803 flow [2025-04-14 00:11:10,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 155 transitions. [2025-04-14 00:11:10,737 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5827067669172933 [2025-04-14 00:11:10,737 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 255 flow. Second operand 7 states and 155 transitions. [2025-04-14 00:11:10,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 134 transitions, 803 flow [2025-04-14 00:11:10,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 134 transitions, 745 flow, removed 19 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:10,758 INFO L231 Difference]: Finished difference. Result has 63 places, 78 transitions, 481 flow [2025-04-14 00:11:10,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=481, PETRI_PLACES=63, PETRI_TRANSITIONS=78} [2025-04-14 00:11:10,759 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2025-04-14 00:11:10,759 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 78 transitions, 481 flow [2025-04-14 00:11:10,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-14 00:11:10,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:10,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:10,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:10,759 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:10,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:10,760 INFO L85 PathProgramCache]: Analyzing trace with hash -951338618, now seen corresponding path program 2 times [2025-04-14 00:11:10,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:10,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958953086] [2025-04-14 00:11:10,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:10,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:10,772 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:11:10,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:11:10,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:10,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:11,621 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-14 00:11:11,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:11,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958953086] [2025-04-14 00:11:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958953086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:11,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:11,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-14 00:11:11,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036398099] [2025-04-14 00:11:11,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:11,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-14 00:11:11,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-14 00:11:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-14 00:11:11,623 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:11,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 78 transitions, 481 flow. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-14 00:11:11,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:11,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:11,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:13,155 INFO L116 PetriNetUnfolderBase]: 10297/14659 cut-off events. [2025-04-14 00:11:13,156 INFO L117 PetriNetUnfolderBase]: For 16151/16151 co-relation queries the response was YES. [2025-04-14 00:11:13,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46259 conditions, 14659 events. 10297/14659 cut-off events. For 16151/16151 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 80186 event pairs, 1868 based on Foata normal form. 168/14824 useless extension candidates. Maximal degree in co-relation 46236. Up to 8207 conditions per place. [2025-04-14 00:11:13,215 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 129 selfloop transitions, 25 changer transitions 23/180 dead transitions. [2025-04-14 00:11:13,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 180 transitions, 1271 flow [2025-04-14 00:11:13,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:11:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:11:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2025-04-14 00:11:13,219 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.569078947368421 [2025-04-14 00:11:13,219 INFO L175 Difference]: Start difference. First operand has 63 places, 78 transitions, 481 flow. Second operand 8 states and 173 transitions. [2025-04-14 00:11:13,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 180 transitions, 1271 flow [2025-04-14 00:11:13,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 180 transitions, 1245 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-04-14 00:11:13,245 INFO L231 Difference]: Finished difference. Result has 72 places, 89 transitions, 644 flow [2025-04-14 00:11:13,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=72, PETRI_TRANSITIONS=89} [2025-04-14 00:11:13,247 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2025-04-14 00:11:13,247 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 89 transitions, 644 flow [2025-04-14 00:11:13,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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-14 00:11:13,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:13,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:13,247 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:11:13,247 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:13,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -807015522, now seen corresponding path program 3 times [2025-04-14 00:11:13,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:13,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473635521] [2025-04-14 00:11:13,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:13,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 1 equivalence classes. [2025-04-14 00:11:13,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 00:11:13,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:13,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:13,388 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-14 00:11:13,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:13,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473635521] [2025-04-14 00:11:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473635521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:13,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:13,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312938300] [2025-04-14 00:11:13,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:13,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:13,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:13,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:13,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:13,389 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:13,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 89 transitions, 644 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 00:11:13,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:13,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:13,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:14,262 INFO L116 PetriNetUnfolderBase]: 6207/9098 cut-off events. [2025-04-14 00:11:14,263 INFO L117 PetriNetUnfolderBase]: For 18683/18689 co-relation queries the response was YES. [2025-04-14 00:11:14,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31151 conditions, 9098 events. 6207/9098 cut-off events. For 18683/18689 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 49643 event pairs, 877 based on Foata normal form. 521/9606 useless extension candidates. Maximal degree in co-relation 31123. Up to 3974 conditions per place. [2025-04-14 00:11:14,313 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 182 selfloop transitions, 5 changer transitions 1/191 dead transitions. [2025-04-14 00:11:14,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 191 transitions, 1703 flow [2025-04-14 00:11:14,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:11:14,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:11:14,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-14 00:11:14,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-04-14 00:11:14,314 INFO L175 Difference]: Start difference. First operand has 72 places, 89 transitions, 644 flow. Second operand 4 states and 95 transitions. [2025-04-14 00:11:14,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 191 transitions, 1703 flow [2025-04-14 00:11:14,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 191 transitions, 1550 flow, removed 31 selfloop flow, removed 6 redundant places. [2025-04-14 00:11:14,338 INFO L231 Difference]: Finished difference. Result has 70 places, 89 transitions, 560 flow [2025-04-14 00:11:14,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=560, PETRI_PLACES=70, PETRI_TRANSITIONS=89} [2025-04-14 00:11:14,339 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2025-04-14 00:11:14,339 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 89 transitions, 560 flow [2025-04-14 00:11:14,339 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-14 00:11:14,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:14,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:14,340 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:11:14,340 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:14,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash 2065330441, now seen corresponding path program 1 times [2025-04-14 00:11:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:14,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133244126] [2025-04-14 00:11:14,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:14,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 00:11:14,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 00:11:14,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:14,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:14,518 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-14 00:11:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:14,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133244126] [2025-04-14 00:11:14,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133244126] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092289647] [2025-04-14 00:11:14,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:14,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:14,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:14,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:14,519 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:14,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 89 transitions, 560 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:11:14,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:14,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:14,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:15,131 INFO L116 PetriNetUnfolderBase]: 3726/5570 cut-off events. [2025-04-14 00:11:15,131 INFO L117 PetriNetUnfolderBase]: For 9460/9466 co-relation queries the response was YES. [2025-04-14 00:11:15,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19064 conditions, 5570 events. 3726/5570 cut-off events. For 9460/9466 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 28392 event pairs, 566 based on Foata normal form. 312/5869 useless extension candidates. Maximal degree in co-relation 19037. Up to 2292 conditions per place. [2025-04-14 00:11:15,161 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 172 selfloop transitions, 8 changer transitions 1/184 dead transitions. [2025-04-14 00:11:15,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 184 transitions, 1470 flow [2025-04-14 00:11:15,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:15,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2025-04-14 00:11:15,163 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6421052631578947 [2025-04-14 00:11:15,163 INFO L175 Difference]: Start difference. First operand has 70 places, 89 transitions, 560 flow. Second operand 5 states and 122 transitions. [2025-04-14 00:11:15,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 184 transitions, 1470 flow [2025-04-14 00:11:15,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 184 transitions, 1458 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:15,178 INFO L231 Difference]: Finished difference. Result has 74 places, 89 transitions, 582 flow [2025-04-14 00:11:15,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=582, PETRI_PLACES=74, PETRI_TRANSITIONS=89} [2025-04-14 00:11:15,179 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2025-04-14 00:11:15,179 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 89 transitions, 582 flow [2025-04-14 00:11:15,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-14 00:11:15,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:15,179 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] [2025-04-14 00:11:15,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:11:15,179 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:15,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:15,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2036353259, now seen corresponding path program 1 times [2025-04-14 00:11:15,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:15,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421859421] [2025-04-14 00:11:15,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:15,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:15,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:15,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:15,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:15,887 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-14 00:11:15,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:15,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421859421] [2025-04-14 00:11:15,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421859421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:15,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:15,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 00:11:15,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673136529] [2025-04-14 00:11:15,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:15,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-14 00:11:15,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:15,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-14 00:11:15,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-14 00:11:15,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:15,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 89 transitions, 582 flow. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-14 00:11:15,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:15,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:16,777 INFO L116 PetriNetUnfolderBase]: 4569/6863 cut-off events. [2025-04-14 00:11:16,778 INFO L117 PetriNetUnfolderBase]: For 11535/11541 co-relation queries the response was YES. [2025-04-14 00:11:16,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23994 conditions, 6863 events. 4569/6863 cut-off events. For 11535/11541 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 35734 event pairs, 787 based on Foata normal form. 52/6902 useless extension candidates. Maximal degree in co-relation 23965. Up to 3143 conditions per place. [2025-04-14 00:11:16,814 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 110 selfloop transitions, 40 changer transitions 29/182 dead transitions. [2025-04-14 00:11:16,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 182 transitions, 1450 flow [2025-04-14 00:11:16,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:11:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:11:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2025-04-14 00:11:16,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5953947368421053 [2025-04-14 00:11:16,816 INFO L175 Difference]: Start difference. First operand has 74 places, 89 transitions, 582 flow. Second operand 8 states and 181 transitions. [2025-04-14 00:11:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 182 transitions, 1450 flow [2025-04-14 00:11:16,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 182 transitions, 1348 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:16,845 INFO L231 Difference]: Finished difference. Result has 82 places, 95 transitions, 772 flow [2025-04-14 00:11:16,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=772, PETRI_PLACES=82, PETRI_TRANSITIONS=95} [2025-04-14 00:11:16,845 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2025-04-14 00:11:16,845 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 95 transitions, 772 flow [2025-04-14 00:11:16,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 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-14 00:11:16,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:16,846 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] [2025-04-14 00:11:16,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:11:16,846 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:16,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1046275129, now seen corresponding path program 2 times [2025-04-14 00:11:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:16,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377434928] [2025-04-14 00:11:16,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:16,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:16,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:16,891 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:16,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:18,282 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-14 00:11:18,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:18,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377434928] [2025-04-14 00:11:18,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377434928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:18,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:18,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:11:18,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516436102] [2025-04-14 00:11:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:18,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:11:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:18,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:11:18,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:11:18,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:18,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 95 transitions, 772 flow. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 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-14 00:11:18,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:18,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:18,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:19,631 INFO L116 PetriNetUnfolderBase]: 6722/10153 cut-off events. [2025-04-14 00:11:19,631 INFO L117 PetriNetUnfolderBase]: For 19635/19635 co-relation queries the response was YES. [2025-04-14 00:11:19,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36673 conditions, 10153 events. 6722/10153 cut-off events. For 19635/19635 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 57541 event pairs, 1428 based on Foata normal form. 48/10198 useless extension candidates. Maximal degree in co-relation 36640. Up to 5157 conditions per place. [2025-04-14 00:11:19,665 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 125 selfloop transitions, 32 changer transitions 60/220 dead transitions. [2025-04-14 00:11:19,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 220 transitions, 1936 flow [2025-04-14 00:11:19,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:11:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:11:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2025-04-14 00:11:19,666 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.564327485380117 [2025-04-14 00:11:19,666 INFO L175 Difference]: Start difference. First operand has 82 places, 95 transitions, 772 flow. Second operand 9 states and 193 transitions. [2025-04-14 00:11:19,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 220 transitions, 1936 flow [2025-04-14 00:11:19,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 220 transitions, 1876 flow, removed 27 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:19,742 INFO L231 Difference]: Finished difference. Result has 92 places, 102 transitions, 945 flow [2025-04-14 00:11:19,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=945, PETRI_PLACES=92, PETRI_TRANSITIONS=102} [2025-04-14 00:11:19,743 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2025-04-14 00:11:19,743 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 102 transitions, 945 flow [2025-04-14 00:11:19,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 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-14 00:11:19,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:19,743 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] [2025-04-14 00:11:19,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 00:11:19,743 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:19,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -751391521, now seen corresponding path program 3 times [2025-04-14 00:11:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:19,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722357304] [2025-04-14 00:11:19,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:19,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:19,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:19,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:19,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:20,870 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-14 00:11:20,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:20,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722357304] [2025-04-14 00:11:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722357304] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:11:20,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698680807] [2025-04-14 00:11:20,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:20,871 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:11:20,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:20,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:11:20,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:11:20,872 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:20,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 102 transitions, 945 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-14 00:11:20,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:20,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:22,444 INFO L116 PetriNetUnfolderBase]: 8136/12278 cut-off events. [2025-04-14 00:11:22,445 INFO L117 PetriNetUnfolderBase]: For 31554/31560 co-relation queries the response was YES. [2025-04-14 00:11:22,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45425 conditions, 12278 events. 8136/12278 cut-off events. For 31554/31560 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 72151 event pairs, 1090 based on Foata normal form. 64/12329 useless extension candidates. Maximal degree in co-relation 45387. Up to 4086 conditions per place. [2025-04-14 00:11:22,526 INFO L140 encePairwiseOnDemand]: 24/38 looper letters, 131 selfloop transitions, 72 changer transitions 36/242 dead transitions. [2025-04-14 00:11:22,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 242 transitions, 2214 flow [2025-04-14 00:11:22,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 00:11:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 00:11:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 218 transitions. [2025-04-14 00:11:22,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5736842105263158 [2025-04-14 00:11:22,529 INFO L175 Difference]: Start difference. First operand has 92 places, 102 transitions, 945 flow. Second operand 10 states and 218 transitions. [2025-04-14 00:11:22,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 242 transitions, 2214 flow [2025-04-14 00:11:22,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 242 transitions, 2089 flow, removed 23 selfloop flow, removed 6 redundant places. [2025-04-14 00:11:22,620 INFO L231 Difference]: Finished difference. Result has 99 places, 132 transitions, 1378 flow [2025-04-14 00:11:22,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1378, PETRI_PLACES=99, PETRI_TRANSITIONS=132} [2025-04-14 00:11:22,621 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2025-04-14 00:11:22,621 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 132 transitions, 1378 flow [2025-04-14 00:11:22,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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-14 00:11:22,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:22,621 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] [2025-04-14 00:11:22,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 00:11:22,621 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:22,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:22,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1210455177, now seen corresponding path program 4 times [2025-04-14 00:11:22,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:22,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463256093] [2025-04-14 00:11:22,622 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:11:22,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:22,629 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-14 00:11:22,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:22,659 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:11:22,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,935 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-14 00:11:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463256093] [2025-04-14 00:11:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463256093] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:11:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322189829] [2025-04-14 00:11:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:11:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:11:23,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:11:23,937 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:23,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 132 transitions, 1378 flow. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 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-14 00:11:23,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:23,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:25,819 INFO L116 PetriNetUnfolderBase]: 11156/16822 cut-off events. [2025-04-14 00:11:25,819 INFO L117 PetriNetUnfolderBase]: For 61824/61830 co-relation queries the response was YES. [2025-04-14 00:11:25,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68582 conditions, 16822 events. 11156/16822 cut-off events. For 61824/61830 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 103843 event pairs, 2726 based on Foata normal form. 52/16861 useless extension candidates. Maximal degree in co-relation 68541. Up to 8635 conditions per place. [2025-04-14 00:11:25,882 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 128 selfloop transitions, 39 changer transitions 57/227 dead transitions. [2025-04-14 00:11:25,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 227 transitions, 2501 flow [2025-04-14 00:11:25,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-04-14 00:11:25,883 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5921052631578947 [2025-04-14 00:11:25,883 INFO L175 Difference]: Start difference. First operand has 99 places, 132 transitions, 1378 flow. Second operand 6 states and 135 transitions. [2025-04-14 00:11:25,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 227 transitions, 2501 flow [2025-04-14 00:11:26,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 227 transitions, 2298 flow, removed 60 selfloop flow, removed 6 redundant places. [2025-04-14 00:11:26,082 INFO L231 Difference]: Finished difference. Result has 99 places, 133 transitions, 1378 flow [2025-04-14 00:11:26,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1378, PETRI_PLACES=99, PETRI_TRANSITIONS=133} [2025-04-14 00:11:26,083 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2025-04-14 00:11:26,083 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 133 transitions, 1378 flow [2025-04-14 00:11:26,083 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 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-14 00:11:26,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:26,084 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] [2025-04-14 00:11:26,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 00:11:26,084 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:26,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:26,084 INFO L85 PathProgramCache]: Analyzing trace with hash 954607175, now seen corresponding path program 5 times [2025-04-14 00:11:26,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:26,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333016870] [2025-04-14 00:11:26,084 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 00:11:26,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:26,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 1 equivalence classes. [2025-04-14 00:11:26,144 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 00:11:26,144 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:26,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:26,266 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-14 00:11:26,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:26,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333016870] [2025-04-14 00:11:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333016870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:26,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429041887] [2025-04-14 00:11:26,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:26,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:26,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:26,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:26,267 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:26,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 133 transitions, 1378 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:11:26,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:26,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:26,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:27,160 INFO L116 PetriNetUnfolderBase]: 4796/7382 cut-off events. [2025-04-14 00:11:27,161 INFO L117 PetriNetUnfolderBase]: For 32834/32840 co-relation queries the response was YES. [2025-04-14 00:11:27,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30533 conditions, 7382 events. 4796/7382 cut-off events. For 32834/32840 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 42248 event pairs, 738 based on Foata normal form. 232/7601 useless extension candidates. Maximal degree in co-relation 30491. Up to 2984 conditions per place. [2025-04-14 00:11:27,195 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 215 selfloop transitions, 11 changer transitions 34/263 dead transitions. [2025-04-14 00:11:27,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 263 transitions, 3198 flow [2025-04-14 00:11:27,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-04-14 00:11:27,196 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2025-04-14 00:11:27,196 INFO L175 Difference]: Start difference. First operand has 99 places, 133 transitions, 1378 flow. Second operand 6 states and 117 transitions. [2025-04-14 00:11:27,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 263 transitions, 3198 flow [2025-04-14 00:11:27,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 263 transitions, 2818 flow, removed 58 selfloop flow, removed 11 redundant places. [2025-04-14 00:11:27,236 INFO L231 Difference]: Finished difference. Result has 94 places, 131 transitions, 1187 flow [2025-04-14 00:11:27,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1187, PETRI_PLACES=94, PETRI_TRANSITIONS=131} [2025-04-14 00:11:27,237 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2025-04-14 00:11:27,237 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 131 transitions, 1187 flow [2025-04-14 00:11:27,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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-14 00:11:27,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:27,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:27,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 00:11:27,238 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:27,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash 681614400, now seen corresponding path program 1 times [2025-04-14 00:11:27,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:27,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818719526] [2025-04-14 00:11:27,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:27,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:27,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:27,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:27,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:27,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:27,473 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-14 00:11:27,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:27,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818719526] [2025-04-14 00:11:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818719526] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293863825] [2025-04-14 00:11:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:27,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:27,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:27,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 131 transitions, 1187 flow. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:28,442 INFO L116 PetriNetUnfolderBase]: 6168/9526 cut-off events. [2025-04-14 00:11:28,442 INFO L117 PetriNetUnfolderBase]: For 33106/33109 co-relation queries the response was YES. [2025-04-14 00:11:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38374 conditions, 9526 events. 6168/9526 cut-off events. For 33106/33109 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 56295 event pairs, 1155 based on Foata normal form. 8/9526 useless extension candidates. Maximal degree in co-relation 38337. Up to 5729 conditions per place. [2025-04-14 00:11:28,482 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 88 selfloop transitions, 1 changer transitions 131/223 dead transitions. [2025-04-14 00:11:28,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 223 transitions, 2340 flow [2025-04-14 00:11:28,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-14 00:11:28,484 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-04-14 00:11:28,484 INFO L175 Difference]: Start difference. First operand has 94 places, 131 transitions, 1187 flow. Second operand 5 states and 100 transitions. [2025-04-14 00:11:28,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 223 transitions, 2340 flow [2025-04-14 00:11:28,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 223 transitions, 2211 flow, removed 22 selfloop flow, removed 8 redundant places. [2025-04-14 00:11:28,592 INFO L231 Difference]: Finished difference. Result has 93 places, 76 transitions, 540 flow [2025-04-14 00:11:28,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=540, PETRI_PLACES=93, PETRI_TRANSITIONS=76} [2025-04-14 00:11:28,593 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2025-04-14 00:11:28,593 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 76 transitions, 540 flow [2025-04-14 00:11:28,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-14 00:11:28,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:28,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:28,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 00:11:28,593 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:28,594 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash 902937314, now seen corresponding path program 2 times [2025-04-14 00:11:28,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:28,594 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242833358] [2025-04-14 00:11:28,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:28,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:28,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:28,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:28,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:30,083 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-14 00:11:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:30,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242833358] [2025-04-14 00:11:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242833358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:30,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-14 00:11:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90835067] [2025-04-14 00:11:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:30,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 00:11:30,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:30,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 00:11:30,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-14 00:11:30,085 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:30,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 76 transitions, 540 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-14 00:11:30,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:30,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:30,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:30,931 INFO L116 PetriNetUnfolderBase]: 3291/5242 cut-off events. [2025-04-14 00:11:30,931 INFO L117 PetriNetUnfolderBase]: For 9456/9456 co-relation queries the response was YES. [2025-04-14 00:11:30,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18073 conditions, 5242 events. 3291/5242 cut-off events. For 9456/9456 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 29150 event pairs, 663 based on Foata normal form. 8/5247 useless extension candidates. Maximal degree in co-relation 18038. Up to 2393 conditions per place. [2025-04-14 00:11:30,950 INFO L140 encePairwiseOnDemand]: 26/38 looper letters, 67 selfloop transitions, 19 changer transitions 106/195 dead transitions. [2025-04-14 00:11:30,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 195 transitions, 1525 flow [2025-04-14 00:11:30,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 00:11:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 00:11:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 214 transitions. [2025-04-14 00:11:30,951 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40225563909774437 [2025-04-14 00:11:30,951 INFO L175 Difference]: Start difference. First operand has 93 places, 76 transitions, 540 flow. Second operand 14 states and 214 transitions. [2025-04-14 00:11:30,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 195 transitions, 1525 flow [2025-04-14 00:11:30,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 195 transitions, 1445 flow, removed 17 selfloop flow, removed 14 redundant places. [2025-04-14 00:11:30,973 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 484 flow [2025-04-14 00:11:30,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=484, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2025-04-14 00:11:30,973 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2025-04-14 00:11:30,973 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 484 flow [2025-04-14 00:11:30,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 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-14 00:11:30,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:30,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:30,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 00:11:30,974 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:30,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:30,974 INFO L85 PathProgramCache]: Analyzing trace with hash 329128522, now seen corresponding path program 3 times [2025-04-14 00:11:30,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:30,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584592399] [2025-04-14 00:11:30,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:30,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:30,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 1 equivalence classes. [2025-04-14 00:11:31,014 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 00:11:31,014 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:31,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:32,427 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-14 00:11:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:32,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584592399] [2025-04-14 00:11:32,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584592399] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:32,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:32,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-14 00:11:32,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778317366] [2025-04-14 00:11:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:32,428 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-14 00:11:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:32,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-14 00:11:32,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-14 00:11:32,429 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 38 [2025-04-14 00:11:32,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 65 transitions, 484 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 00:11:32,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:32,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 38 [2025-04-14 00:11:32,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:32,964 INFO L116 PetriNetUnfolderBase]: 1637/2608 cut-off events. [2025-04-14 00:11:32,964 INFO L117 PetriNetUnfolderBase]: For 9258/9258 co-relation queries the response was YES. [2025-04-14 00:11:32,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10336 conditions, 2608 events. 1637/2608 cut-off events. For 9258/9258 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12577 event pairs, 177 based on Foata normal form. 8/2606 useless extension candidates. Maximal degree in co-relation 10310. Up to 962 conditions per place. [2025-04-14 00:11:32,971 INFO L140 encePairwiseOnDemand]: 28/38 looper letters, 0 selfloop transitions, 0 changer transitions 106/106 dead transitions. [2025-04-14 00:11:32,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 106 transitions, 912 flow [2025-04-14 00:11:32,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 00:11:32,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 00:11:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2025-04-14 00:11:32,972 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40225563909774437 [2025-04-14 00:11:32,972 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 484 flow. Second operand 7 states and 107 transitions. [2025-04-14 00:11:32,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 106 transitions, 912 flow [2025-04-14 00:11:32,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 106 transitions, 811 flow, removed 31 selfloop flow, removed 11 redundant places. [2025-04-14 00:11:32,981 INFO L231 Difference]: Finished difference. Result has 85 places, 0 transitions, 0 flow [2025-04-14 00:11:32,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=85, PETRI_TRANSITIONS=0} [2025-04-14 00:11:32,981 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2025-04-14 00:11:32,981 INFO L485 AbstractCegarLoop]: Abstraction has has 85 places, 0 transitions, 0 flow [2025-04-14 00:11:32,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:11:32,984 INFO L790 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:11:32,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 00:11:32,984 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 1, 1, 1] [2025-04-14 00:11:32,989 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:32,990 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:32,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:32 BasicIcfg [2025-04-14 00:11:32,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:32,995 INFO L158 Benchmark]: Toolchain (without parser) took 33375.97ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 97.6MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 255.7MB. Max. memory is 8.0GB. [2025-04-14 00:11:32,995 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:32,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.85ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 66.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:11:32,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.87ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 63.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:32,997 INFO L158 Benchmark]: Boogie Preprocessor took 64.27ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 57.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-14 00:11:32,997 INFO L158 Benchmark]: IcfgBuilder took 923.47ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 89.2MB in the end (delta: -32.0MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. [2025-04-14 00:11:32,997 INFO L158 Benchmark]: TraceAbstraction took 31874.27ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 88.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 245.3MB. Max. memory is 8.0GB. [2025-04-14 00:11:32,998 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.85ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 66.3MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.87ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 63.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 64.27ms. Allocated memory is still 142.6MB. Free memory was 63.0MB in the beginning and 57.2MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * IcfgBuilder took 923.47ms. Allocated memory is still 142.6MB. Free memory was 57.2MB in the beginning and 89.2MB in the end (delta: -32.0MB). Peak memory consumption was 41.5MB. Max. memory is 8.0GB. * TraceAbstraction took 31874.27ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 88.3MB in the beginning and 1.8GB in the end (delta: -1.7GB). Peak memory consumption was 245.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 67 locations, 63 edges, 6 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: 31.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 18.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1149 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1149 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 312 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4288 IncrementalHoareTripleChecker+Invalid, 4600 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 312 mSolverCounterUnsat, 0 mSDtfsCounter, 4288 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1378occurred in iteration=11, InterpolantAutomatonStates: 111, 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.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 336 NumberOfCodeBlocks, 336 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 3327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 00:11:33,012 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...