/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-theta/exponential-64.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:46:17,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:46:17,653 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 01:46:17,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:46:17,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:46:17,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:46:17,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:46:17,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:46:17,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:46:17,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:46:17,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:46:17,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:46:17,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:46:17,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:17,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:46:17,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:17,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:46:17,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:46:17,684 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 01:46:17,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:46:17,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:46:17,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:46:17,927 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:46:17,928 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:46:17,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/exponential-64.i [2025-04-14 01:46:19,134 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8a168e1/cdc193760dc34634a3d7cb30679b9eb2/FLAG06800d327 [2025-04-14 01:46:19,356 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:46:19,357 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-64.i [2025-04-14 01:46:19,368 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8a168e1/cdc193760dc34634a3d7cb30679b9eb2/FLAG06800d327 [2025-04-14 01:46:20,184 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a8a168e1/cdc193760dc34634a3d7cb30679b9eb2 [2025-04-14 01:46:20,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:46:20,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:46:20,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:20,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:46:20,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:46:20,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49732e1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20, skipping insertion in model container [2025-04-14 01:46:20,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:46:20,445 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-theta/exponential-64.i[33030,33043] [2025-04-14 01:46:20,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:20,462 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:46:20,523 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-theta/exponential-64.i[33030,33043] [2025-04-14 01:46:20,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:46:20,553 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:46:20,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20 WrapperNode [2025-04-14 01:46:20,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:46:20,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:20,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:46:20,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:46:20,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,592 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-04-14 01:46:20,593 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:46:20,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:46:20,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:46:20,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:46:20,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,608 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 01:46:20,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,608 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,611 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:46:20,617 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:46:20,617 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:46:20,617 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:46:20,618 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (1/1) ... [2025-04-14 01:46:20,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:46:20,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:20,640 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 01:46:20,642 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 01:46:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:46:20,657 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 01:46:20,658 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 01:46:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 01:46:20,658 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 01:46:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:46:20,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:46:20,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:46:20,659 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 01:46:20,758 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:46:20,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:46:20,881 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:46:20,883 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:46:20,883 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:46:20,988 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:46:20,997 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:46:20,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:20 BoogieIcfgContainer [2025-04-14 01:46:20,997 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:46:20,999 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:46:20,999 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:46:21,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:46:21,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:46:20" (1/3) ... [2025-04-14 01:46:21,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f501580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:21, skipping insertion in model container [2025-04-14 01:46:21,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:46:20" (2/3) ... [2025-04-14 01:46:21,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f501580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:46:21, skipping insertion in model container [2025-04-14 01:46:21,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:46:20" (3/3) ... [2025-04-14 01:46:21,006 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2025-04-14 01:46:21,015 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:46:21,016 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-64.i that has 3 procedures, 16 locations, 16 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 01:46:21,016 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:46:21,051 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:46:21,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 44 flow [2025-04-14 01:46:21,101 INFO L116 PetriNetUnfolderBase]: 2/20 cut-off events. [2025-04-14 01:46:21,103 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:21,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 20 events. 2/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2025-04-14 01:46:21,105 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 18 transitions, 44 flow [2025-04-14 01:46:21,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 39 flow [2025-04-14 01:46:21,114 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:21,124 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;@6d845830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:21,124 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:46:21,129 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:21,129 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-14 01:46:21,129 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:21,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:21,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-14 01:46:21,130 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:21,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 5610, now seen corresponding path program 1 times [2025-04-14 01:46:21,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:21,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121676901] [2025-04-14 01:46:21,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:21,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 01:46:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 01:46:21,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:21,267 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 01:46:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:21,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121676901] [2025-04-14 01:46:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121676901] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:46:21,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732708237] [2025-04-14 01:46:21,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:21,275 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:46:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:21,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:46:21,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:46:21,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-14 01:46:21,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 16 transitions, 39 flow. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 01:46:21,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:21,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-14 01:46:21,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:21,341 INFO L116 PetriNetUnfolderBase]: 53/103 cut-off events. [2025-04-14 01:46:21,342 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-14 01:46:21,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 103 events. 53/103 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 340 event pairs, 44 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 197. Up to 97 conditions per place. [2025-04-14 01:46:21,343 INFO L140 encePairwiseOnDemand]: 17/18 looper letters, 12 selfloop transitions, 0 changer transitions 0/15 dead transitions. [2025-04-14 01:46:21,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 61 flow [2025-04-14 01:46:21,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:46:21,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:46:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 21 transitions. [2025-04-14 01:46:21,352 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-04-14 01:46:21,353 INFO L175 Difference]: Start difference. First operand has 20 places, 16 transitions, 39 flow. Second operand 2 states and 21 transitions. [2025-04-14 01:46:21,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 61 flow [2025-04-14 01:46:21,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 15 transitions, 60 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:21,357 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 36 flow [2025-04-14 01:46:21,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=36, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2025-04-14 01:46:21,362 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 0 predicate places. [2025-04-14 01:46:21,362 INFO L485 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 36 flow [2025-04-14 01:46:21,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 01:46:21,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:21,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:21,362 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:46:21,363 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:21,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 933369540, now seen corresponding path program 1 times [2025-04-14 01:46:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:21,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-14 01:46:21,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:21,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:21,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:21,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:21,458 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 01:46:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:21,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040175254] [2025-04-14 01:46:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040175254] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205042437] [2025-04-14 01:46:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:21,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:21,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:21,460 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 18 [2025-04-14 01:46:21,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:46:21,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:21,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 18 [2025-04-14 01:46:21,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:21,520 INFO L116 PetriNetUnfolderBase]: 65/124 cut-off events. [2025-04-14 01:46:21,520 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:21,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 124 events. 65/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 436 event pairs, 44 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 249. Up to 96 conditions per place. [2025-04-14 01:46:21,523 INFO L140 encePairwiseOnDemand]: 14/18 looper letters, 14 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2025-04-14 01:46:21,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 20 transitions, 80 flow [2025-04-14 01:46:21,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:21,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:21,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2025-04-14 01:46:21,525 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-04-14 01:46:21,525 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 36 flow. Second operand 4 states and 34 transitions. [2025-04-14 01:46:21,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 20 transitions, 80 flow [2025-04-14 01:46:21,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:46:21,526 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 50 flow [2025-04-14 01:46:21,526 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2025-04-14 01:46:21,527 INFO L279 CegarLoopForPetriNet]: 20 programPoint places, 4 predicate places. [2025-04-14 01:46:21,527 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 50 flow [2025-04-14 01:46:21,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 01:46:21,527 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:21,527 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:21,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:46:21,527 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:21,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash 933369585, now seen corresponding path program 1 times [2025-04-14 01:46:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:21,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28552347] [2025-04-14 01:46:21,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:21,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:21,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:21,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:21,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:21,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:46:21,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:21,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:21,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:21,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:46:21,569 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:46:21,570 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 01:46:21,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 01:46:21,571 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:46:21,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:46:21,572 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 01:46:21,574 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:46:21,574 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 01:46:21,593 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:46:21,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 72 flow [2025-04-14 01:46:21,599 INFO L116 PetriNetUnfolderBase]: 3/34 cut-off events. [2025-04-14 01:46:21,599 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:46:21,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2025-04-14 01:46:21,599 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 26 transitions, 72 flow [2025-04-14 01:46:21,599 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 24 transitions, 66 flow [2025-04-14 01:46:21,600 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:21,601 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;@6d845830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:21,601 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:46:21,605 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:21,605 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-14 01:46:21,605 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:21,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:21,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-14 01:46:21,606 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:21,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:21,606 INFO L85 PathProgramCache]: Analyzing trace with hash 6442, now seen corresponding path program 1 times [2025-04-14 01:46:21,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:21,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699928822] [2025-04-14 01:46:21,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:21,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 01:46:21,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 01:46:21,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:21,646 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 01:46:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:21,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699928822] [2025-04-14 01:46:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699928822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:46:21,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396986733] [2025-04-14 01:46:21,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:21,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:46:21,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:21,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:46:21,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:46:21,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 01:46:21,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 66 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 01:46:21,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:21,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 01:46:21,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:21,809 INFO L116 PetriNetUnfolderBase]: 1034/1518 cut-off events. [2025-04-14 01:46:21,809 INFO L117 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2025-04-14 01:46:21,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 1518 events. 1034/1518 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7345 event pairs, 944 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 841. Up to 1456 conditions per place. [2025-04-14 01:46:21,822 INFO L140 encePairwiseOnDemand]: 25/26 looper letters, 18 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2025-04-14 01:46:21,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 100 flow [2025-04-14 01:46:21,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:46:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:46:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 31 transitions. [2025-04-14 01:46:21,824 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2025-04-14 01:46:21,824 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 66 flow. Second operand 2 states and 31 transitions. [2025-04-14 01:46:21,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 100 flow [2025-04-14 01:46:21,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:21,826 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 63 flow [2025-04-14 01:46:21,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=63, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-04-14 01:46:21,827 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2025-04-14 01:46:21,827 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 63 flow [2025-04-14 01:46:21,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 01:46:21,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:21,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:21,827 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:46:21,827 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:21,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1709009809, now seen corresponding path program 1 times [2025-04-14 01:46:21,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:21,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860362349] [2025-04-14 01:46:21,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:21,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:21,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:21,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:21,902 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 01:46:21,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:21,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860362349] [2025-04-14 01:46:21,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860362349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:21,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:21,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:21,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878710352] [2025-04-14 01:46:21,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:21,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:21,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:21,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:21,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:21,904 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 01:46:21,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 01:46:21,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:21,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 01:46:21,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:22,044 INFO L116 PetriNetUnfolderBase]: 1262/1836 cut-off events. [2025-04-14 01:46:22,045 INFO L117 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-04-14 01:46:22,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 1836 events. 1262/1836 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 8874 event pairs, 818 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 3725. Up to 1455 conditions per place. [2025-04-14 01:46:22,056 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-14 01:46:22,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 135 flow [2025-04-14 01:46:22,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:22,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-14 01:46:22,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:46:22,059 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 63 flow. Second operand 4 states and 52 transitions. [2025-04-14 01:46:22,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 135 flow [2025-04-14 01:46:22,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:46:22,060 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 77 flow [2025-04-14 01:46:22,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=77, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-14 01:46:22,060 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2025-04-14 01:46:22,061 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 77 flow [2025-04-14 01:46:22,061 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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 01:46:22,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:22,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:22,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:46:22,061 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:22,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:22,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1439696676, now seen corresponding path program 1 times [2025-04-14 01:46:22,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:22,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-14 01:46:22,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:22,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:22,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:46:22,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:46:22,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:22,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:46:22,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:22,109 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421890097] [2025-04-14 01:46:22,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421890097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:22,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604224390] [2025-04-14 01:46:22,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:22,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:46:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:22,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:46:22,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:46:22,110 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2025-04-14 01:46:22,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 77 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 01:46:22,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:22,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2025-04-14 01:46:22,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:22,242 INFO L116 PetriNetUnfolderBase]: 1217/1761 cut-off events. [2025-04-14 01:46:22,242 INFO L117 PetriNetUnfolderBase]: For 375/375 co-relation queries the response was YES. [2025-04-14 01:46:22,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 1761 events. 1217/1761 cut-off events. For 375/375 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 8228 event pairs, 818 based on Foata normal form. 9/1685 useless extension candidates. Maximal degree in co-relation 3984. Up to 1678 conditions per place. [2025-04-14 01:46:22,251 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 23 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-04-14 01:46:22,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 139 flow [2025-04-14 01:46:22,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:46:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:46:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-04-14 01:46:22,252 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2025-04-14 01:46:22,252 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 77 flow. Second operand 3 states and 43 transitions. [2025-04-14 01:46:22,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 139 flow [2025-04-14 01:46:22,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 133 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:46:22,254 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 83 flow [2025-04-14 01:46:22,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2025-04-14 01:46:22,256 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2025-04-14 01:46:22,256 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 83 flow [2025-04-14 01:46:22,256 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 01:46:22,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:22,256 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:22,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:46:22,256 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:22,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash 511397358, now seen corresponding path program 1 times [2025-04-14 01:46:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:22,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177962385] [2025-04-14 01:46:22,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:22,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:22,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:46:22,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:22,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:22,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:22,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:46:22,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:46:22,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:46:22,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:22,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:22,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:46:22,285 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:46:22,285 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 01:46:22,285 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 01:46:22,285 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:46:22,285 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:46:22,285 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 01:46:22,286 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:46:22,286 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 01:46:22,304 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:46:22,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 34 transitions, 104 flow [2025-04-14 01:46:22,309 INFO L116 PetriNetUnfolderBase]: 4/48 cut-off events. [2025-04-14 01:46:22,309 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-14 01:46:22,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 48 events. 4/48 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 55. Up to 8 conditions per place. [2025-04-14 01:46:22,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 34 transitions, 104 flow [2025-04-14 01:46:22,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 32 transitions, 97 flow [2025-04-14 01:46:22,310 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:22,311 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;@6d845830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:22,311 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:46:22,311 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:22,311 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-14 01:46:22,311 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:22,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:22,311 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-14 01:46:22,311 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:22,312 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:22,312 INFO L85 PathProgramCache]: Analyzing trace with hash 7530, now seen corresponding path program 1 times [2025-04-14 01:46:22,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:22,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129098704] [2025-04-14 01:46:22,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:22,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:22,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 01:46:22,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 01:46:22,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:22,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:22,331 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 01:46:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:22,336 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129098704] [2025-04-14 01:46:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129098704] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:22,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:22,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:46:22,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106982409] [2025-04-14 01:46:22,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:22,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:46:22,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:22,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:46:22,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:46:22,337 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:46:22,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 97 flow. Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 01:46:22,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:22,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:46:22,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:23,404 INFO L116 PetriNetUnfolderBase]: 14399/18789 cut-off events. [2025-04-14 01:46:23,405 INFO L117 PetriNetUnfolderBase]: For 2557/2557 co-relation queries the response was YES. [2025-04-14 01:46:23,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38431 conditions, 18789 events. 14399/18789 cut-off events. For 2557/2557 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 99289 event pairs, 13580 based on Foata normal form. 0/16727 useless extension candidates. Maximal degree in co-relation 11107. Up to 18223 conditions per place. [2025-04-14 01:46:23,504 INFO L140 encePairwiseOnDemand]: 33/34 looper letters, 24 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2025-04-14 01:46:23,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 143 flow [2025-04-14 01:46:23,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:46:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:46:23,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 41 transitions. [2025-04-14 01:46:23,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6029411764705882 [2025-04-14 01:46:23,506 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 97 flow. Second operand 2 states and 41 transitions. [2025-04-14 01:46:23,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 143 flow [2025-04-14 01:46:23,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 138 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:23,521 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 90 flow [2025-04-14 01:46:23,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=90, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2025-04-14 01:46:23,522 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-04-14 01:46:23,522 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 90 flow [2025-04-14 01:46:23,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 01:46:23,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:23,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:23,522 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:46:23,522 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:23,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1573649570, now seen corresponding path program 1 times [2025-04-14 01:46:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:23,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344327072] [2025-04-14 01:46:23,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:23,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:23,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:23,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:23,565 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 01:46:23,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:23,566 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344327072] [2025-04-14 01:46:23,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344327072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:23,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:23,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:23,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757748030] [2025-04-14 01:46:23,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:23,566 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:23,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:23,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:46:23,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 01:46:23,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:23,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:46:23,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:24,871 INFO L116 PetriNetUnfolderBase]: 17543/22752 cut-off events. [2025-04-14 01:46:24,871 INFO L117 PetriNetUnfolderBase]: For 1351/1351 co-relation queries the response was YES. [2025-04-14 01:46:24,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46033 conditions, 22752 events. 17543/22752 cut-off events. For 1351/1351 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 121799 event pairs, 13580 based on Foata normal form. 0/20870 useless extension candidates. Maximal degree in co-relation 46025. Up to 18222 conditions per place. [2025-04-14 01:46:24,965 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 34 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-04-14 01:46:24,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 190 flow [2025-04-14 01:46:24,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:24,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2025-04-14 01:46:24,966 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2025-04-14 01:46:24,966 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 90 flow. Second operand 4 states and 70 transitions. [2025-04-14 01:46:24,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 190 flow [2025-04-14 01:46:24,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 44 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:46:24,968 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 104 flow [2025-04-14 01:46:24,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2025-04-14 01:46:24,969 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-04-14 01:46:24,969 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 104 flow [2025-04-14 01:46:24,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 01:46:24,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:24,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:24,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:46:24,969 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:24,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:24,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1538496231, now seen corresponding path program 1 times [2025-04-14 01:46:24,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:24,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37089509] [2025-04-14 01:46:24,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:24,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:24,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:46:24,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:46:24,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:24,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:46:25,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:25,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37089509] [2025-04-14 01:46:25,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37089509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:25,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:25,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:25,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720817476] [2025-04-14 01:46:25,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:25,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:46:25,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:25,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:46:25,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:46:25,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:46:25,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:25,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:25,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:46:25,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:25,961 INFO L116 PetriNetUnfolderBase]: 17498/22683 cut-off events. [2025-04-14 01:46:25,961 INFO L117 PetriNetUnfolderBase]: For 4308/4308 co-relation queries the response was YES. [2025-04-14 01:46:25,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49945 conditions, 22683 events. 17498/22683 cut-off events. For 4308/4308 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 119351 event pairs, 10556 based on Foata normal form. 9/21467 useless extension candidates. Maximal degree in co-relation 49935. Up to 22090 conditions per place. [2025-04-14 01:46:26,073 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 29 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-04-14 01:46:26,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 178 flow [2025-04-14 01:46:26,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:46:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:46:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-04-14 01:46:26,074 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5392156862745098 [2025-04-14 01:46:26,074 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 104 flow. Second operand 3 states and 55 transitions. [2025-04-14 01:46:26,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 178 flow [2025-04-14 01:46:26,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 172 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:46:26,123 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 110 flow [2025-04-14 01:46:26,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2025-04-14 01:46:26,123 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2025-04-14 01:46:26,123 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 110 flow [2025-04-14 01:46:26,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:26,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:26,124 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:26,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:46:26,124 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:26,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -774674269, now seen corresponding path program 1 times [2025-04-14 01:46:26,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:26,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882424539] [2025-04-14 01:46:26,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:26,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:26,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:46:26,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:46:26,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:26,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:46:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:26,181 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882424539] [2025-04-14 01:46:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882424539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:46:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57367725] [2025-04-14 01:46:26,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:26,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:26,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:26,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:26,183 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2025-04-14 01:46:26,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 01:46:26,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:26,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2025-04-14 01:46:26,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:27,133 INFO L116 PetriNetUnfolderBase]: 16769/21732 cut-off events. [2025-04-14 01:46:27,133 INFO L117 PetriNetUnfolderBase]: For 4163/4163 co-relation queries the response was YES. [2025-04-14 01:46:27,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47717 conditions, 21732 events. 16769/21732 cut-off events. For 4163/4163 co-relation queries the response was YES. Maximal size of possible extension queue 974. Compared 112659 event pairs, 4706 based on Foata normal form. 81/20999 useless extension candidates. Maximal degree in co-relation 47706. Up to 20710 conditions per place. [2025-04-14 01:46:27,252 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions. [2025-04-14 01:46:27,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 224 flow [2025-04-14 01:46:27,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:27,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2025-04-14 01:46:27,253 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5367647058823529 [2025-04-14 01:46:27,253 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 110 flow. Second operand 4 states and 73 transitions. [2025-04-14 01:46:27,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 224 flow [2025-04-14 01:46:27,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:27,277 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 124 flow [2025-04-14 01:46:27,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-04-14 01:46:27,277 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2025-04-14 01:46:27,277 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 124 flow [2025-04-14 01:46:27,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 01:46:27,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:27,277 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:27,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-14 01:46:27,278 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:27,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1403297209, now seen corresponding path program 1 times [2025-04-14 01:46:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:27,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240958163] [2025-04-14 01:46:27,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:27,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:46:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:46:27,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:27,287 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:46:27,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 01:46:27,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 01:46:27,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:46:27,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:46:27,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:46:27,294 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 01:46:27,294 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 01:46:27,295 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:46:27,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:46:27,295 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-14 01:46:27,295 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:46:27,295 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-14 01:46:27,448 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:46:27,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 140 flow [2025-04-14 01:46:27,452 INFO L116 PetriNetUnfolderBase]: 5/62 cut-off events. [2025-04-14 01:46:27,452 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-14 01:46:27,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 62 events. 5/62 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 79. Up to 10 conditions per place. [2025-04-14 01:46:27,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 42 transitions, 140 flow [2025-04-14 01:46:27,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 40 transitions, 132 flow [2025-04-14 01:46:27,453 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:46:27,455 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;@6d845830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:46:27,455 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:46:27,456 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:46:27,456 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-14 01:46:27,456 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:46:27,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:27,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-14 01:46:27,456 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:27,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash 8874, now seen corresponding path program 1 times [2025-04-14 01:46:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:27,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979240941] [2025-04-14 01:46:27,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:27,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 01:46:27,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 01:46:27,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:27,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46: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 01:46:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:27,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979240941] [2025-04-14 01:46:27,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979240941] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:27,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:27,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:46:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858446987] [2025-04-14 01:46:27,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:27,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:46:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:46:27,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:46:27,474 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-04-14 01:46:27,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 132 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 01:46:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-04-14 01:46:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:37,543 INFO L116 PetriNetUnfolderBase]: 175508/215052 cut-off events. [2025-04-14 01:46:37,543 INFO L117 PetriNetUnfolderBase]: For 43061/43061 co-relation queries the response was YES. [2025-04-14 01:46:38,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 441003 conditions, 215052 events. 175508/215052 cut-off events. For 43061/43061 co-relation queries the response was YES. Maximal size of possible extension queue 6974. Compared 1201305 event pairs, 168128 based on Foata normal form. 0/196465 useless extension candidates. Maximal degree in co-relation 131689. Up to 209950 conditions per place. [2025-04-14 01:46:38,886 INFO L140 encePairwiseOnDemand]: 41/42 looper letters, 30 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2025-04-14 01:46:38,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 39 transitions, 190 flow [2025-04-14 01:46:38,886 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:46:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:46:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 51 transitions. [2025-04-14 01:46:38,887 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2025-04-14 01:46:38,887 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 132 flow. Second operand 2 states and 51 transitions. [2025-04-14 01:46:38,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 39 transitions, 190 flow [2025-04-14 01:46:39,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 39 transitions, 177 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:39,264 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 117 flow [2025-04-14 01:46:39,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=117, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2025-04-14 01:46:39,264 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2025-04-14 01:46:39,264 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 117 flow [2025-04-14 01:46:39,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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 01:46:39,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:39,265 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 01:46:39,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-14 01:46:39,265 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:39,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:39,265 INFO L85 PathProgramCache]: Analyzing trace with hash -324674005, now seen corresponding path program 1 times [2025-04-14 01:46:39,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:39,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993506394] [2025-04-14 01:46:39,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:39,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:39,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 01:46:39,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 01:46:39,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:39,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:39,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:39,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993506394] [2025-04-14 01:46:39,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993506394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:39,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:39,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125458196] [2025-04-14 01:46:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:39,305 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:46:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:39,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:46:39,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:46:39,306 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-04-14 01:46:39,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 01:46:39,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:39,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-04-14 01:46:39,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:46:51,450 INFO L116 PetriNetUnfolderBase]: 213644/260568 cut-off events. [2025-04-14 01:46:51,452 INFO L117 PetriNetUnfolderBase]: For 21011/21011 co-relation queries the response was YES. [2025-04-14 01:46:52,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525879 conditions, 260568 events. 213644/260568 cut-off events. For 21011/21011 co-relation queries the response was YES. Maximal size of possible extension queue 8204. Compared 1463809 event pairs, 168128 based on Foata normal form. 0/243621 useless extension candidates. Maximal degree in co-relation 525869. Up to 209949 conditions per place. [2025-04-14 01:46:52,980 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-14 01:46:52,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 245 flow [2025-04-14 01:46:52,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:46:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:46:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-04-14 01:46:52,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-14 01:46:52,983 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 117 flow. Second operand 4 states and 88 transitions. [2025-04-14 01:46:52,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 245 flow [2025-04-14 01:46:53,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 245 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:46:53,040 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 131 flow [2025-04-14 01:46:53,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-04-14 01:46:53,041 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2025-04-14 01:46:53,041 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 131 flow [2025-04-14 01:46:53,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 01:46:53,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:53,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:53,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 01:46:53,041 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:46:53,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1474959338, now seen corresponding path program 1 times [2025-04-14 01:46:53,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:53,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122907405] [2025-04-14 01:46:53,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:46:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:53,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:46:53,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:46:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:46:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:46:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:46:53,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122907405] [2025-04-14 01:46:53,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122907405] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:46:53,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:46:53,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:46:53,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323362872] [2025-04-14 01:46:53,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:46:53,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:46:53,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:46:53,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:46:53,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:46:53,070 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-04-14 01:46:53,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:53,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:46:53,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-04-14 01:46:53,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:04,601 INFO L116 PetriNetUnfolderBase]: 213599/260499 cut-off events. [2025-04-14 01:47:04,601 INFO L117 PetriNetUnfolderBase]: For 48021/48021 co-relation queries the response was YES. [2025-04-14 01:47:05,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562596 conditions, 260499 events. 213599/260499 cut-off events. For 48021/48021 co-relation queries the response was YES. Maximal size of possible extension queue 8059. Compared 1441088 event pairs, 150524 based on Foata normal form. 9/249311 useless extension candidates. Maximal degree in co-relation 562584. Up to 255370 conditions per place. [2025-04-14 01:47:06,481 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 35 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-14 01:47:06,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 46 transitions, 217 flow [2025-04-14 01:47:06,481 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:47:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:47:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-04-14 01:47:06,482 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2025-04-14 01:47:06,482 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 131 flow. Second operand 3 states and 67 transitions. [2025-04-14 01:47:06,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 46 transitions, 217 flow [2025-04-14 01:47:10,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 211 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:10,491 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 137 flow [2025-04-14 01:47:10,491 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2025-04-14 01:47:10,491 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2025-04-14 01:47:10,491 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 137 flow [2025-04-14 01:47:10,491 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:10,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:10,492 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:10,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 01:47:10,492 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:10,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:10,492 INFO L85 PathProgramCache]: Analyzing trace with hash -761036237, now seen corresponding path program 1 times [2025-04-14 01:47:10,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:10,492 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657485694] [2025-04-14 01:47:10,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:10,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:10,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:47:10,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:47:10,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:10,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:47:10,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:10,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657485694] [2025-04-14 01:47:10,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657485694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:10,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:10,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:47:10,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740634883] [2025-04-14 01:47:10,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:10,522 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:47:10,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:10,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:47:10,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:47:10,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-04-14 01:47:10,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:10,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:10,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-04-14 01:47:10,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:22,577 INFO L116 PetriNetUnfolderBase]: 212870/259554 cut-off events. [2025-04-14 01:47:22,578 INFO L117 PetriNetUnfolderBase]: For 49256/49256 co-relation queries the response was YES. [2025-04-14 01:47:23,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560374 conditions, 259554 events. 212870/259554 cut-off events. For 49256/49256 co-relation queries the response was YES. Maximal size of possible extension queue 8040. Compared 1429182 event pairs, 95012 based on Foata normal form. 81/248528 useless extension candidates. Maximal degree in co-relation 560361. Up to 253990 conditions per place. [2025-04-14 01:47:24,205 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 44 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-04-14 01:47:24,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 263 flow [2025-04-14 01:47:24,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:47:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:47:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-14 01:47:24,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5178571428571429 [2025-04-14 01:47:24,206 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 137 flow. Second operand 4 states and 87 transitions. [2025-04-14 01:47:24,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 263 flow [2025-04-14 01:47:26,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 56 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:47:26,085 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 151 flow [2025-04-14 01:47:26,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=151, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-04-14 01:47:26,086 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2025-04-14 01:47:26,086 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 151 flow [2025-04-14 01:47:26,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:26,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:26,086 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:26,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 01:47:26,086 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:26,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:26,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1814172366, now seen corresponding path program 1 times [2025-04-14 01:47:26,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:26,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80299764] [2025-04-14 01:47:26,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:26,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:47:26,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:47:26,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:26,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:47:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:26,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80299764] [2025-04-14 01:47:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80299764] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:26,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:26,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:47:26,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579991480] [2025-04-14 01:47:26,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:26,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:47:26,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:26,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:47:26,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:47:26,142 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2025-04-14 01:47:26,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 01:47:26,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:26,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2025-04-14 01:47:26,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:37,177 INFO L116 PetriNetUnfolderBase]: 203393/247647 cut-off events. [2025-04-14 01:47:37,178 INFO L117 PetriNetUnfolderBase]: For 80905/80905 co-relation queries the response was YES. [2025-04-14 01:47:37,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547902 conditions, 247647 events. 203393/247647 cut-off events. For 80905/80905 co-relation queries the response was YES. Maximal size of possible extension queue 7967. Compared 1344917 event pairs, 66338 based on Foata normal form. 729/240023 useless extension candidates. Maximal degree in co-relation 547888. Up to 236926 conditions per place. [2025-04-14 01:47:38,752 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 57 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-04-14 01:47:38,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 333 flow [2025-04-14 01:47:38,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:47:38,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:47:38,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-04-14 01:47:38,753 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2025-04-14 01:47:38,753 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 151 flow. Second operand 5 states and 111 transitions. [2025-04-14 01:47:38,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 333 flow [2025-04-14 01:47:40,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 70 transitions, 327 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 01:47:40,304 INFO L231 Difference]: Finished difference. Result has 67 places, 43 transitions, 165 flow [2025-04-14 01:47:40,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=165, PETRI_PLACES=67, PETRI_TRANSITIONS=43} [2025-04-14 01:47:40,305 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 11 predicate places. [2025-04-14 01:47:40,305 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 43 transitions, 165 flow [2025-04-14 01:47:40,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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 01:47:40,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:40,305 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:47:40,305 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-14 01:47:40,305 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:40,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:40,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1793491588, now seen corresponding path program 1 times [2025-04-14 01:47:40,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:40,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914755617] [2025-04-14 01:47:40,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:40,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:40,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:47:40,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:40,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:40,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:40,312 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 01:47:40,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:47:40,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:47:40,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:40,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 01:47:40,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 01:47:40,322 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 01:47:40,322 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 01:47:40,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 01:47:40,322 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:47:40,322 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 01:47:40,322 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-14 01:47:40,323 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 01:47:40,323 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-14 01:47:40,344 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 01:47:40,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 50 transitions, 180 flow [2025-04-14 01:47:40,349 INFO L116 PetriNetUnfolderBase]: 6/76 cut-off events. [2025-04-14 01:47:40,349 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-14 01:47:40,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 76 events. 6/76 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 139 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 105. Up to 12 conditions per place. [2025-04-14 01:47:40,349 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 50 transitions, 180 flow [2025-04-14 01:47:40,349 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 48 transitions, 171 flow [2025-04-14 01:47:40,350 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:47:40,350 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;@6d845830, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:47:40,350 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:47:40,350 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:47:40,350 INFO L116 PetriNetUnfolderBase]: 1/3 cut-off events. [2025-04-14 01:47:40,350 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:47:40,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:47:40,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-04-14 01:47:40,350 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:47:40,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:47:40,351 INFO L85 PathProgramCache]: Analyzing trace with hash 10474, now seen corresponding path program 1 times [2025-04-14 01:47:40,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:47:40,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074001177] [2025-04-14 01:47:40,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:47:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:47:40,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-14 01:47:40,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-14 01:47:40,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:47:40,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:47:40,363 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 01:47:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:40,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074001177] [2025-04-14 01:47:40,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074001177] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:47:40,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:47:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:47:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116159644] [2025-04-14 01:47:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:47:40,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:47:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:40,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:47:40,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:47:40,364 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 50 [2025-04-14 01:47:40,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 48 transitions, 171 flow. Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 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 01:47:40,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:40,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 50 [2025-04-14 01:47:40,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand