/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:59:28,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:59:28,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:59:28,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:59:28,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:59:28,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:59:28,168 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:59:28,168 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:59:28,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:59:28,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:59:28,169 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:59:28,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:59:28,169 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:59:28,170 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:28,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:59:28,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:28,170 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:59:28,171 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:59:28,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:59:28,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:59:28,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:59:28,387 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:59:28,388 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:59:28,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-13 20:59:29,698 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2ac25b/16a730b7939e4e179fdb38aed2d5c5a3/FLAGba5f2d284 [2025-04-13 20:59:29,920 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:59:29,920 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c [2025-04-13 20:59:29,929 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2ac25b/16a730b7939e4e179fdb38aed2d5c5a3/FLAGba5f2d284 [2025-04-13 20:59:30,698 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf2ac25b/16a730b7939e4e179fdb38aed2d5c5a3 [2025-04-13 20:59:30,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:59:30,701 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:59:30,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:30,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:59:30,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:59:30,707 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6a1f33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30, skipping insertion in model container [2025-04-13 20:59:30,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:59:30,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c[1841,1854] [2025-04-13 20:59:30,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:30,896 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:59:30,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c[1841,1854] [2025-04-13 20:59:30,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:59:30,936 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:59:30,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30 WrapperNode [2025-04-13 20:59:30,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:59:30,938 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:30,938 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:59:30,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:59:30,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,962 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 41 [2025-04-13 20:59:30,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:59:30,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:59:30,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:59:30,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:59:30,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,984 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 20:59:30,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:30,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:59:30,999 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:59:30,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:59:30,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:59:31,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (1/1) ... [2025-04-13 20:59:31,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:59:31,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:31,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:59:31,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:59:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:59:31,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:59:31,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:59:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:59:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:59:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:59:31,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:59:31,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:59:31,059 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:59:31,117 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:59:31,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:59:31,219 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:59:31,220 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:59:31,220 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:59:31,306 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:59:31,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:31 BoogieIcfgContainer [2025-04-13 20:59:31,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:59:31,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:59:31,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:59:31,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:59:31,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:59:30" (1/3) ... [2025-04-13 20:59:31,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da8b975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:31, skipping insertion in model container [2025-04-13 20:59:31,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:59:30" (2/3) ... [2025-04-13 20:59:31,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da8b975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:59:31, skipping insertion in model container [2025-04-13 20:59:31,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:59:31" (3/3) ... [2025-04-13 20:59:31,315 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2025-04-13 20:59:31,325 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:59:31,326 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy11.wvr.c that has 3 procedures, 20 locations, 19 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 20:59:31,326 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:59:31,355 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 20:59:31,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 21 transitions, 56 flow [2025-04-13 20:59:31,403 INFO L116 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-04-13 20:59:31,404 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:59:31,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 2/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-13 20:59:31,406 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 21 transitions, 56 flow [2025-04-13 20:59:31,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 48 flow [2025-04-13 20:59:31,417 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:59:31,425 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;@15a5188b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:59:31,425 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 20:59:31,434 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:59:31,434 INFO L116 PetriNetUnfolderBase]: 2/17 cut-off events. [2025-04-13 20:59:31,434 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 20:59:31,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:31,435 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:31,435 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-13 20:59:31,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash -449661655, now seen corresponding path program 1 times [2025-04-13 20:59:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:31,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674670549] [2025-04-13 20:59:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:31,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:31,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:31,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:31,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:31,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:31,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674670549] [2025-04-13 20:59:31,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674670549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:31,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:31,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:31,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130659526] [2025-04-13 20:59:31,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:31,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:31,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:31,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:31,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:31,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:31,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 48 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:31,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:32,159 INFO L116 PetriNetUnfolderBase]: 111/200 cut-off events. [2025-04-13 20:59:32,160 INFO L117 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-04-13 20:59:32,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 200 events. 111/200 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 598 event pairs, 2 based on Foata normal form. 1/173 useless extension candidates. Maximal degree in co-relation 364. Up to 57 conditions per place. [2025-04-13 20:59:32,162 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 40 selfloop transitions, 10 changer transitions 10/60 dead transitions. [2025-04-13 20:59:32,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 60 transitions, 276 flow [2025-04-13 20:59:32,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2025-04-13 20:59:32,174 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2025-04-13 20:59:32,175 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 48 flow. Second operand 9 states and 79 transitions. [2025-04-13 20:59:32,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 60 transitions, 276 flow [2025-04-13 20:59:32,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 60 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:32,186 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 105 flow [2025-04-13 20:59:32,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=105, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2025-04-13 20:59:32,190 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2025-04-13 20:59:32,191 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 105 flow [2025-04-13 20:59:32,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:32,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:32,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:32,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:59:32,191 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-13 20:59:32,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:32,192 INFO L85 PathProgramCache]: Analyzing trace with hash 331002627, now seen corresponding path program 2 times [2025-04-13 20:59:32,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:32,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744498570] [2025-04-13 20:59:32,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:32,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:32,202 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:32,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:32,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:32,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:32,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:32,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744498570] [2025-04-13 20:59:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744498570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:32,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675486590] [2025-04-13 20:59:32,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:32,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:32,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:32,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:32,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:32,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:32,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 105 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:32,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:32,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:32,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:32,592 INFO L116 PetriNetUnfolderBase]: 114/207 cut-off events. [2025-04-13 20:59:32,592 INFO L117 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-04-13 20:59:32,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 207 events. 114/207 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 609 event pairs, 14 based on Foata normal form. 1/197 useless extension candidates. Maximal degree in co-relation 575. Up to 115 conditions per place. [2025-04-13 20:59:32,594 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 34 selfloop transitions, 14 changer transitions 10/58 dead transitions. [2025-04-13 20:59:32,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 334 flow [2025-04-13 20:59:32,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 74 transitions. [2025-04-13 20:59:32,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2025-04-13 20:59:32,600 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 105 flow. Second operand 9 states and 74 transitions. [2025-04-13 20:59:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 334 flow [2025-04-13 20:59:32,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 322 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:32,602 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 188 flow [2025-04-13 20:59:32,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=188, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2025-04-13 20:59:32,603 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 19 predicate places. [2025-04-13 20:59:32,603 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 188 flow [2025-04-13 20:59:32,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:32,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:32,603 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:32,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:59:32,603 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-13 20:59:32,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:32,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1652701837, now seen corresponding path program 3 times [2025-04-13 20:59:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:32,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643896256] [2025-04-13 20:59:32,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:32,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:32,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:32,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:32,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:59:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:32,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:32,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643896256] [2025-04-13 20:59:32,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643896256] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251379373] [2025-04-13 20:59:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:32,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:32,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:32,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:32,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:32,789 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:32,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 188 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:32,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:32,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:32,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:33,022 INFO L116 PetriNetUnfolderBase]: 119/215 cut-off events. [2025-04-13 20:59:33,023 INFO L117 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2025-04-13 20:59:33,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 215 events. 119/215 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 662 event pairs, 11 based on Foata normal form. 1/216 useless extension candidates. Maximal degree in co-relation 688. Up to 119 conditions per place. [2025-04-13 20:59:33,024 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 39 selfloop transitions, 18 changer transitions 9/66 dead transitions. [2025-04-13 20:59:33,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 448 flow [2025-04-13 20:59:33,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:33,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2025-04-13 20:59:33,026 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-04-13 20:59:33,026 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 188 flow. Second operand 9 states and 77 transitions. [2025-04-13 20:59:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 448 flow [2025-04-13 20:59:33,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 66 transitions, 416 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:33,029 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 255 flow [2025-04-13 20:59:33,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=255, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-04-13 20:59:33,032 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2025-04-13 20:59:33,032 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 255 flow [2025-04-13 20:59:33,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:33,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:33,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:59:33,033 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-13 20:59:33,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1327138303, now seen corresponding path program 4 times [2025-04-13 20:59:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:33,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684289159] [2025-04-13 20:59:33,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:33,038 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:59:33,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:33,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:33,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:33,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684289159] [2025-04-13 20:59:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684289159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:33,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246027345] [2025-04-13 20:59:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:33,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:33,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:33,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:33,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:33,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:33,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 255 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:33,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:33,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:33,387 INFO L116 PetriNetUnfolderBase]: 194/328 cut-off events. [2025-04-13 20:59:33,387 INFO L117 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2025-04-13 20:59:33,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 328 events. 194/328 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1080 event pairs, 32 based on Foata normal form. 1/329 useless extension candidates. Maximal degree in co-relation 1203. Up to 140 conditions per place. [2025-04-13 20:59:33,389 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 44 selfloop transitions, 37 changer transitions 8/89 dead transitions. [2025-04-13 20:59:33,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 735 flow [2025-04-13 20:59:33,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:59:33,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:59:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2025-04-13 20:59:33,390 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-04-13 20:59:33,390 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 255 flow. Second operand 8 states and 82 transitions. [2025-04-13 20:59:33,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 735 flow [2025-04-13 20:59:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 659 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:33,394 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 516 flow [2025-04-13 20:59:33,394 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=516, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2025-04-13 20:59:33,394 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 29 predicate places. [2025-04-13 20:59:33,395 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 516 flow [2025-04-13 20:59:33,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:33,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:33,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:59:33,395 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-13 20:59:33,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1388576337, now seen corresponding path program 5 times [2025-04-13 20:59:33,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:33,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909557063] [2025-04-13 20:59:33,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:33,400 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:33,403 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:33,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:33,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:33,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909557063] [2025-04-13 20:59:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909557063] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:33,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:33,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337046711] [2025-04-13 20:59:33,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:33,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:33,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:33,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:33,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:33,536 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:33,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 516 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:33,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:33,718 INFO L116 PetriNetUnfolderBase]: 207/356 cut-off events. [2025-04-13 20:59:33,718 INFO L117 PetriNetUnfolderBase]: For 817/817 co-relation queries the response was YES. [2025-04-13 20:59:33,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 356 events. 207/356 cut-off events. For 817/817 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1299 event pairs, 16 based on Foata normal form. 1/357 useless extension candidates. Maximal degree in co-relation 1442. Up to 185 conditions per place. [2025-04-13 20:59:33,720 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 53 selfloop transitions, 33 changer transitions 10/96 dead transitions. [2025-04-13 20:59:33,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 96 transitions, 857 flow [2025-04-13 20:59:33,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2025-04-13 20:59:33,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2025-04-13 20:59:33,723 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 516 flow. Second operand 9 states and 81 transitions. [2025-04-13 20:59:33,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 96 transitions, 857 flow [2025-04-13 20:59:33,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 96 transitions, 837 flow, removed 10 selfloop flow, removed 1 redundant places. [2025-04-13 20:59:33,730 INFO L231 Difference]: Finished difference. Result has 61 places, 65 transitions, 589 flow [2025-04-13 20:59:33,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=61, PETRI_TRANSITIONS=65} [2025-04-13 20:59:33,733 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 38 predicate places. [2025-04-13 20:59:33,733 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 65 transitions, 589 flow [2025-04-13 20:59:33,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:33,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:33,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:59:33,734 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:33,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1332453851, now seen corresponding path program 6 times [2025-04-13 20:59:33,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:33,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694615373] [2025-04-13 20:59:33,736 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:33,741 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:33,743 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:33,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:59:33,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:33,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:33,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:33,836 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694615373] [2025-04-13 20:59:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694615373] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:33,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:33,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243536975] [2025-04-13 20:59:33,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:33,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:33,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:33,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:33,848 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:33,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 65 transitions, 589 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:33,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:33,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:33,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:34,047 INFO L116 PetriNetUnfolderBase]: 225/384 cut-off events. [2025-04-13 20:59:34,047 INFO L117 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2025-04-13 20:59:34,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1760 conditions, 384 events. 225/384 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1403 event pairs, 20 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 1737. Up to 209 conditions per place. [2025-04-13 20:59:34,050 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 51 selfloop transitions, 39 changer transitions 10/100 dead transitions. [2025-04-13 20:59:34,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 1021 flow [2025-04-13 20:59:34,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:34,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2025-04-13 20:59:34,051 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-04-13 20:59:34,051 INFO L175 Difference]: Start difference. First operand has 61 places, 65 transitions, 589 flow. Second operand 9 states and 78 transitions. [2025-04-13 20:59:34,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 1021 flow [2025-04-13 20:59:34,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 100 transitions, 931 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:34,056 INFO L231 Difference]: Finished difference. Result has 65 places, 76 transitions, 763 flow [2025-04-13 20:59:34,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=763, PETRI_PLACES=65, PETRI_TRANSITIONS=76} [2025-04-13 20:59:34,056 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 42 predicate places. [2025-04-13 20:59:34,056 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 76 transitions, 763 flow [2025-04-13 20:59:34,057 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:34,057 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:34,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:59:34,057 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:34,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:34,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1385171715, now seen corresponding path program 7 times [2025-04-13 20:59:34,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:34,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733044982] [2025-04-13 20:59:34,057 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:34,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:34,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:34,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:34,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:34,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:34,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:34,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733044982] [2025-04-13 20:59:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733044982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:34,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:34,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485930225] [2025-04-13 20:59:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:34,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:34,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:34,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:34,207 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:34,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 76 transitions, 763 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:34,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:34,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:34,381 INFO L116 PetriNetUnfolderBase]: 218/372 cut-off events. [2025-04-13 20:59:34,381 INFO L117 PetriNetUnfolderBase]: For 1429/1429 co-relation queries the response was YES. [2025-04-13 20:59:34,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1829 conditions, 372 events. 218/372 cut-off events. For 1429/1429 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1366 event pairs, 19 based on Foata normal form. 1/373 useless extension candidates. Maximal degree in co-relation 1803. Up to 197 conditions per place. [2025-04-13 20:59:34,384 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 56 selfloop transitions, 36 changer transitions 12/104 dead transitions. [2025-04-13 20:59:34,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 104 transitions, 1122 flow [2025-04-13 20:59:34,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2025-04-13 20:59:34,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-04-13 20:59:34,385 INFO L175 Difference]: Start difference. First operand has 65 places, 76 transitions, 763 flow. Second operand 9 states and 77 transitions. [2025-04-13 20:59:34,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 104 transitions, 1122 flow [2025-04-13 20:59:34,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 104 transitions, 1061 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:34,391 INFO L231 Difference]: Finished difference. Result has 68 places, 73 transitions, 750 flow [2025-04-13 20:59:34,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=750, PETRI_PLACES=68, PETRI_TRANSITIONS=73} [2025-04-13 20:59:34,392 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 45 predicate places. [2025-04-13 20:59:34,392 INFO L485 AbstractCegarLoop]: Abstraction has has 68 places, 73 transitions, 750 flow [2025-04-13 20:59:34,392 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:34,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:34,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:59:34,393 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:34,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:34,393 INFO L85 PathProgramCache]: Analyzing trace with hash -749700771, now seen corresponding path program 8 times [2025-04-13 20:59:34,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:34,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293462402] [2025-04-13 20:59:34,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:34,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:34,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:34,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:34,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:34,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293462402] [2025-04-13 20:59:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293462402] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:34,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:34,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:34,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506907529] [2025-04-13 20:59:34,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:34,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:34,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:34,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:34,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:34,515 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:34,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 73 transitions, 750 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:34,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:34,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:34,716 INFO L116 PetriNetUnfolderBase]: 230/392 cut-off events. [2025-04-13 20:59:34,716 INFO L117 PetriNetUnfolderBase]: For 1535/1535 co-relation queries the response was YES. [2025-04-13 20:59:34,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 392 events. 230/392 cut-off events. For 1535/1535 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1445 event pairs, 17 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 1871. Up to 203 conditions per place. [2025-04-13 20:59:34,732 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 53 selfloop transitions, 40 changer transitions 10/103 dead transitions. [2025-04-13 20:59:34,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 1113 flow [2025-04-13 20:59:34,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2025-04-13 20:59:34,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2025-04-13 20:59:34,734 INFO L175 Difference]: Start difference. First operand has 68 places, 73 transitions, 750 flow. Second operand 9 states and 82 transitions. [2025-04-13 20:59:34,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 1113 flow [2025-04-13 20:59:34,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 1029 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:34,739 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 813 flow [2025-04-13 20:59:34,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=813, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-04-13 20:59:34,741 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 47 predicate places. [2025-04-13 20:59:34,741 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 813 flow [2025-04-13 20:59:34,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:34,742 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:34,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:59:34,742 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:34,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:34,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1057030077, now seen corresponding path program 9 times [2025-04-13 20:59:34,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:34,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278426230] [2025-04-13 20:59:34,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:34,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:34,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:34,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:34,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:59:34,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:34,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:34,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278426230] [2025-04-13 20:59:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278426230] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793452721] [2025-04-13 20:59:34,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:34,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:34,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:34,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:34,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:34,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:34,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 813 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:34,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:34,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:34,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:35,041 INFO L116 PetriNetUnfolderBase]: 224/385 cut-off events. [2025-04-13 20:59:35,041 INFO L117 PetriNetUnfolderBase]: For 1694/1694 co-relation queries the response was YES. [2025-04-13 20:59:35,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1918 conditions, 385 events. 224/385 cut-off events. For 1694/1694 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1424 event pairs, 18 based on Foata normal form. 1/386 useless extension candidates. Maximal degree in co-relation 1890. Up to 215 conditions per place. [2025-04-13 20:59:35,044 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 51 selfloop transitions, 36 changer transitions 11/98 dead transitions. [2025-04-13 20:59:35,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 98 transitions, 1096 flow [2025-04-13 20:59:35,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:35,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2025-04-13 20:59:35,045 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2025-04-13 20:59:35,045 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 813 flow. Second operand 9 states and 76 transitions. [2025-04-13 20:59:35,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 98 transitions, 1096 flow [2025-04-13 20:59:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 1021 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:35,050 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 789 flow [2025-04-13 20:59:35,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=789, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2025-04-13 20:59:35,051 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 50 predicate places. [2025-04-13 20:59:35,051 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 789 flow [2025-04-13 20:59:35,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:35,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:35,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:59:35,053 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:35,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:35,053 INFO L85 PathProgramCache]: Analyzing trace with hash -760999045, now seen corresponding path program 10 times [2025-04-13 20:59:35,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:35,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765578443] [2025-04-13 20:59:35,054 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:35,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:59:35,059 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:35,059 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:35,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:35,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:35,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765578443] [2025-04-13 20:59:35,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765578443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431447477] [2025-04-13 20:59:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:35,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:35,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:35,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:35,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:35,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:35,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 789 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:35,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:35,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:35,402 INFO L116 PetriNetUnfolderBase]: 294/493 cut-off events. [2025-04-13 20:59:35,403 INFO L117 PetriNetUnfolderBase]: For 2385/2385 co-relation queries the response was YES. [2025-04-13 20:59:35,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 493 events. 294/493 cut-off events. For 2385/2385 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1904 event pairs, 44 based on Foata normal form. 1/494 useless extension candidates. Maximal degree in co-relation 2505. Up to 238 conditions per place. [2025-04-13 20:59:35,406 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 62 selfloop transitions, 53 changer transitions 7/122 dead transitions. [2025-04-13 20:59:35,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 122 transitions, 1463 flow [2025-04-13 20:59:35,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:59:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:59:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2025-04-13 20:59:35,408 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2025-04-13 20:59:35,408 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 789 flow. Second operand 8 states and 82 transitions. [2025-04-13 20:59:35,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 122 transitions, 1463 flow [2025-04-13 20:59:35,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 122 transitions, 1347 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:35,417 INFO L231 Difference]: Finished difference. Result has 74 places, 96 transitions, 1144 flow [2025-04-13 20:59:35,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1144, PETRI_PLACES=74, PETRI_TRANSITIONS=96} [2025-04-13 20:59:35,418 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 51 predicate places. [2025-04-13 20:59:35,418 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 96 transitions, 1144 flow [2025-04-13 20:59:35,418 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:35,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:35,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 20:59:35,419 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:35,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash 464446775, now seen corresponding path program 11 times [2025-04-13 20:59:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:35,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217259194] [2025-04-13 20:59:35,419 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:35,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:35,424 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:35,427 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:35,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:35,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:35,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:35,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217259194] [2025-04-13 20:59:35,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217259194] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:35,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:35,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677287526] [2025-04-13 20:59:35,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:35,533 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:35,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:35,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:35,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:35,545 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:35,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 96 transitions, 1144 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:35,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:35,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:35,749 INFO L116 PetriNetUnfolderBase]: 319/537 cut-off events. [2025-04-13 20:59:35,749 INFO L117 PetriNetUnfolderBase]: For 2646/2646 co-relation queries the response was YES. [2025-04-13 20:59:35,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 537 events. 319/537 cut-off events. For 2646/2646 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2159 event pairs, 23 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 2818. Up to 273 conditions per place. [2025-04-13 20:59:35,753 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 57 selfloop transitions, 56 changer transitions 10/123 dead transitions. [2025-04-13 20:59:35,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 1527 flow [2025-04-13 20:59:35,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 78 transitions. [2025-04-13 20:59:35,754 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4126984126984127 [2025-04-13 20:59:35,754 INFO L175 Difference]: Start difference. First operand has 74 places, 96 transitions, 1144 flow. Second operand 9 states and 78 transitions. [2025-04-13 20:59:35,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 1527 flow [2025-04-13 20:59:35,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 123 transitions, 1463 flow, removed 15 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:35,762 INFO L231 Difference]: Finished difference. Result has 82 places, 99 transitions, 1251 flow [2025-04-13 20:59:35,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1251, PETRI_PLACES=82, PETRI_TRANSITIONS=99} [2025-04-13 20:59:35,762 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 59 predicate places. [2025-04-13 20:59:35,762 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 99 transitions, 1251 flow [2025-04-13 20:59:35,763 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:35,763 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:35,763 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:59:35,763 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:35,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:35,763 INFO L85 PathProgramCache]: Analyzing trace with hash -656277701, now seen corresponding path program 12 times [2025-04-13 20:59:35,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:35,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302684286] [2025-04-13 20:59:35,763 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:35,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:35,766 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:35,768 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:35,768 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:59:35,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:35,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:35,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302684286] [2025-04-13 20:59:35,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302684286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:35,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:35,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:35,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157177985] [2025-04-13 20:59:35,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:35,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:35,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:35,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:35,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:35,871 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:35,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 99 transitions, 1251 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:35,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:35,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:35,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:36,068 INFO L116 PetriNetUnfolderBase]: 303/513 cut-off events. [2025-04-13 20:59:36,069 INFO L117 PetriNetUnfolderBase]: For 3015/3015 co-relation queries the response was YES. [2025-04-13 20:59:36,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 513 events. 303/513 cut-off events. For 3015/3015 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2045 event pairs, 27 based on Foata normal form. 1/514 useless extension candidates. Maximal degree in co-relation 2799. Up to 277 conditions per place. [2025-04-13 20:59:36,072 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 57 selfloop transitions, 52 changer transitions 11/120 dead transitions. [2025-04-13 20:59:36,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 120 transitions, 1592 flow [2025-04-13 20:59:36,073 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:36,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2025-04-13 20:59:36,073 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-04-13 20:59:36,073 INFO L175 Difference]: Start difference. First operand has 82 places, 99 transitions, 1251 flow. Second operand 9 states and 77 transitions. [2025-04-13 20:59:36,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 120 transitions, 1592 flow [2025-04-13 20:59:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 120 transitions, 1465 flow, removed 10 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:36,083 INFO L231 Difference]: Finished difference. Result has 83 places, 96 transitions, 1210 flow [2025-04-13 20:59:36,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1210, PETRI_PLACES=83, PETRI_TRANSITIONS=96} [2025-04-13 20:59:36,084 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 60 predicate places. [2025-04-13 20:59:36,084 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 96 transitions, 1210 flow [2025-04-13 20:59:36,084 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:36,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:36,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:59:36,084 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:36,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash -469284755, now seen corresponding path program 13 times [2025-04-13 20:59:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:36,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023837919] [2025-04-13 20:59:36,085 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:36,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:36,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:36,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:36,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023837919] [2025-04-13 20:59:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023837919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624782414] [2025-04-13 20:59:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:36,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:36,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:36,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:36,188 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:36,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 96 transitions, 1210 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:36,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:36,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:36,403 INFO L116 PetriNetUnfolderBase]: 323/545 cut-off events. [2025-04-13 20:59:36,403 INFO L117 PetriNetUnfolderBase]: For 3468/3468 co-relation queries the response was YES. [2025-04-13 20:59:36,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3010 conditions, 545 events. 323/545 cut-off events. For 3468/3468 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2160 event pairs, 39 based on Foata normal form. 1/546 useless extension candidates. Maximal degree in co-relation 2977. Up to 287 conditions per place. [2025-04-13 20:59:36,411 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 62 selfloop transitions, 57 changer transitions 11/130 dead transitions. [2025-04-13 20:59:36,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 1782 flow [2025-04-13 20:59:36,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:36,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2025-04-13 20:59:36,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4021164021164021 [2025-04-13 20:59:36,412 INFO L175 Difference]: Start difference. First operand has 83 places, 96 transitions, 1210 flow. Second operand 9 states and 76 transitions. [2025-04-13 20:59:36,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 1782 flow [2025-04-13 20:59:36,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 130 transitions, 1644 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:36,422 INFO L231 Difference]: Finished difference. Result has 88 places, 107 transitions, 1439 flow [2025-04-13 20:59:36,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1439, PETRI_PLACES=88, PETRI_TRANSITIONS=107} [2025-04-13 20:59:36,422 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 65 predicate places. [2025-04-13 20:59:36,422 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 107 transitions, 1439 flow [2025-04-13 20:59:36,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:36,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:36,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:59:36,423 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:36,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash 102170051, now seen corresponding path program 14 times [2025-04-13 20:59:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:36,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427612973] [2025-04-13 20:59:36,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:36,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:36,428 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:36,428 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:36,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:36,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427612973] [2025-04-13 20:59:36,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427612973] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:36,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:36,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:36,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59997869] [2025-04-13 20:59:36,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:36,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:36,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:36,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:36,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:36,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:36,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 107 transitions, 1439 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:36,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:36,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:36,726 INFO L116 PetriNetUnfolderBase]: 319/541 cut-off events. [2025-04-13 20:59:36,726 INFO L117 PetriNetUnfolderBase]: For 3903/3903 co-relation queries the response was YES. [2025-04-13 20:59:36,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 541 events. 319/541 cut-off events. For 3903/3903 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2138 event pairs, 41 based on Foata normal form. 1/542 useless extension candidates. Maximal degree in co-relation 3097. Up to 283 conditions per place. [2025-04-13 20:59:36,730 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 60 selfloop transitions, 59 changer transitions 11/130 dead transitions. [2025-04-13 20:59:36,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 130 transitions, 1858 flow [2025-04-13 20:59:36,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2025-04-13 20:59:36,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-04-13 20:59:36,730 INFO L175 Difference]: Start difference. First operand has 88 places, 107 transitions, 1439 flow. Second operand 9 states and 75 transitions. [2025-04-13 20:59:36,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 130 transitions, 1858 flow [2025-04-13 20:59:36,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 130 transitions, 1758 flow, removed 28 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:36,739 INFO L231 Difference]: Finished difference. Result has 94 places, 108 transitions, 1520 flow [2025-04-13 20:59:36,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1520, PETRI_PLACES=94, PETRI_TRANSITIONS=108} [2025-04-13 20:59:36,740 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 71 predicate places. [2025-04-13 20:59:36,740 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 108 transitions, 1520 flow [2025-04-13 20:59:36,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:36,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:36,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 20:59:36,740 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:36,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:36,740 INFO L85 PathProgramCache]: Analyzing trace with hash -496043825, now seen corresponding path program 15 times [2025-04-13 20:59:36,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:36,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711827986] [2025-04-13 20:59:36,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:36,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:36,743 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:36,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:36,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:59:36,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:36,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:36,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711827986] [2025-04-13 20:59:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711827986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504786120] [2025-04-13 20:59:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:36,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:36,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:36,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:36,824 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:36,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 108 transitions, 1520 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:36,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:36,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:36,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:37,013 INFO L116 PetriNetUnfolderBase]: 331/561 cut-off events. [2025-04-13 20:59:37,013 INFO L117 PetriNetUnfolderBase]: For 4444/4444 co-relation queries the response was YES. [2025-04-13 20:59:37,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 561 events. 331/561 cut-off events. For 4444/4444 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2257 event pairs, 39 based on Foata normal form. 1/562 useless extension candidates. Maximal degree in co-relation 3235. Up to 287 conditions per place. [2025-04-13 20:59:37,017 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 64 selfloop transitions, 57 changer transitions 10/131 dead transitions. [2025-04-13 20:59:37,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 131 transitions, 1918 flow [2025-04-13 20:59:37,017 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:37,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2025-04-13 20:59:37,017 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2025-04-13 20:59:37,018 INFO L175 Difference]: Start difference. First operand has 94 places, 108 transitions, 1520 flow. Second operand 9 states and 77 transitions. [2025-04-13 20:59:37,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 131 transitions, 1918 flow [2025-04-13 20:59:37,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 131 transitions, 1812 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:37,026 INFO L231 Difference]: Finished difference. Result has 98 places, 109 transitions, 1559 flow [2025-04-13 20:59:37,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1559, PETRI_PLACES=98, PETRI_TRANSITIONS=109} [2025-04-13 20:59:37,027 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 75 predicate places. [2025-04-13 20:59:37,027 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 109 transitions, 1559 flow [2025-04-13 20:59:37,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:37,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:37,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:59:37,027 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:37,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:37,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2052647277, now seen corresponding path program 16 times [2025-04-13 20:59:37,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:37,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580595018] [2025-04-13 20:59:37,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:37,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:37,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-13 20:59:37,032 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:37,032 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:37,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:37,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:37,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580595018] [2025-04-13 20:59:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580595018] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:37,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:37,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752332786] [2025-04-13 20:59:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:37,147 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:37,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:37,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:37,153 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:37,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 109 transitions, 1559 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:37,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:37,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:37,313 INFO L116 PetriNetUnfolderBase]: 343/585 cut-off events. [2025-04-13 20:59:37,313 INFO L117 PetriNetUnfolderBase]: For 4790/4790 co-relation queries the response was YES. [2025-04-13 20:59:37,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3447 conditions, 585 events. 343/585 cut-off events. For 4790/4790 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2436 event pairs, 55 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 3407. Up to 231 conditions per place. [2025-04-13 20:59:37,317 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 72 selfloop transitions, 58 changer transitions 11/141 dead transitions. [2025-04-13 20:59:37,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 141 transitions, 2096 flow [2025-04-13 20:59:37,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2025-04-13 20:59:37,318 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41798941798941797 [2025-04-13 20:59:37,318 INFO L175 Difference]: Start difference. First operand has 98 places, 109 transitions, 1559 flow. Second operand 9 states and 79 transitions. [2025-04-13 20:59:37,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 141 transitions, 2096 flow [2025-04-13 20:59:37,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 141 transitions, 1944 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:37,328 INFO L231 Difference]: Finished difference. Result has 102 places, 113 transitions, 1644 flow [2025-04-13 20:59:37,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1644, PETRI_PLACES=102, PETRI_TRANSITIONS=113} [2025-04-13 20:59:37,329 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 79 predicate places. [2025-04-13 20:59:37,329 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 113 transitions, 1644 flow [2025-04-13 20:59:37,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:37,330 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:37,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 20:59:37,330 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:37,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash 579667331, now seen corresponding path program 17 times [2025-04-13 20:59:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:37,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342506159] [2025-04-13 20:59:37,331 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:37,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:37,336 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:37,337 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:37,338 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:59:37,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:37,413 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342506159] [2025-04-13 20:59:37,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342506159] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:37,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:37,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:37,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380291908] [2025-04-13 20:59:37,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:37,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:37,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:37,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:37,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:37,423 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:37,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 113 transitions, 1644 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:37,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:37,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:37,584 INFO L116 PetriNetUnfolderBase]: 366/626 cut-off events. [2025-04-13 20:59:37,584 INFO L117 PetriNetUnfolderBase]: For 5536/5536 co-relation queries the response was YES. [2025-04-13 20:59:37,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 626 events. 366/626 cut-off events. For 5536/5536 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2661 event pairs, 37 based on Foata normal form. 1/627 useless extension candidates. Maximal degree in co-relation 3709. Up to 343 conditions per place. [2025-04-13 20:59:37,588 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 77 selfloop transitions, 54 changer transitions 10/141 dead transitions. [2025-04-13 20:59:37,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 141 transitions, 2160 flow [2025-04-13 20:59:37,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2025-04-13 20:59:37,589 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-04-13 20:59:37,589 INFO L175 Difference]: Start difference. First operand has 102 places, 113 transitions, 1644 flow. Second operand 9 states and 75 transitions. [2025-04-13 20:59:37,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 141 transitions, 2160 flow [2025-04-13 20:59:37,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 141 transitions, 2057 flow, removed 20 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:37,600 INFO L231 Difference]: Finished difference. Result has 107 places, 116 transitions, 1713 flow [2025-04-13 20:59:37,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1549, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1713, PETRI_PLACES=107, PETRI_TRANSITIONS=116} [2025-04-13 20:59:37,601 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 84 predicate places. [2025-04-13 20:59:37,601 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 116 transitions, 1713 flow [2025-04-13 20:59:37,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:37,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:37,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:59:37,601 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:37,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:37,602 INFO L85 PathProgramCache]: Analyzing trace with hash 435723971, now seen corresponding path program 18 times [2025-04-13 20:59:37,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:37,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410140709] [2025-04-13 20:59:37,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:37,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:37,606 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-13 20:59:37,607 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 20:59:37,607 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:59:37,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:37,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410140709] [2025-04-13 20:59:37,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410140709] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:37,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:37,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 20:59:37,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127840630] [2025-04-13 20:59:37,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:37,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:37,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:37,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:37,703 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:37,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 116 transitions, 1713 flow. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:37,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:37,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:37,884 INFO L116 PetriNetUnfolderBase]: 350/602 cut-off events. [2025-04-13 20:59:37,884 INFO L117 PetriNetUnfolderBase]: For 5767/5767 co-relation queries the response was YES. [2025-04-13 20:59:37,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 602 events. 350/602 cut-off events. For 5767/5767 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2533 event pairs, 40 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 3637. Up to 347 conditions per place. [2025-04-13 20:59:37,888 INFO L140 encePairwiseOnDemand]: 12/21 looper letters, 74 selfloop transitions, 49 changer transitions 14/137 dead transitions. [2025-04-13 20:59:37,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 137 transitions, 2154 flow [2025-04-13 20:59:37,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:37,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2025-04-13 20:59:37,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-04-13 20:59:37,889 INFO L175 Difference]: Start difference. First operand has 107 places, 116 transitions, 1713 flow. Second operand 9 states and 72 transitions. [2025-04-13 20:59:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 137 transitions, 2154 flow [2025-04-13 20:59:37,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 137 transitions, 2027 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:37,901 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 1594 flow [2025-04-13 20:59:37,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1594, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2025-04-13 20:59:37,902 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 84 predicate places. [2025-04-13 20:59:37,902 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 1594 flow [2025-04-13 20:59:37,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:37,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:37,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:59:37,902 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:37,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:37,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2069652659, now seen corresponding path program 1 times [2025-04-13 20:59:37,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:37,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200473549] [2025-04-13 20:59:37,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:37,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:37,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:59:37,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:37,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:37,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:37,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200473549] [2025-04-13 20:59:37,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200473549] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:37,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:37,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:37,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415645286] [2025-04-13 20:59:37,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:37,924 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:37,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:37,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:37,932 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:37,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 1594 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:37,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:37,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:37,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:38,052 INFO L116 PetriNetUnfolderBase]: 316/590 cut-off events. [2025-04-13 20:59:38,052 INFO L117 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-04-13 20:59:38,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3411 conditions, 590 events. 316/590 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2817 event pairs, 33 based on Foata normal form. 12/597 useless extension candidates. Maximal degree in co-relation 3365. Up to 169 conditions per place. [2025-04-13 20:59:38,056 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 61 selfloop transitions, 41 changer transitions 7/144 dead transitions. [2025-04-13 20:59:38,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 144 transitions, 2068 flow [2025-04-13 20:59:38,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:59:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:59:38,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2025-04-13 20:59:38,057 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-13 20:59:38,057 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 1594 flow. Second operand 7 states and 77 transitions. [2025-04-13 20:59:38,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 144 transitions, 2068 flow [2025-04-13 20:59:38,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 144 transitions, 1954 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:38,068 INFO L231 Difference]: Finished difference. Result has 107 places, 115 transitions, 1692 flow [2025-04-13 20:59:38,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1692, PETRI_PLACES=107, PETRI_TRANSITIONS=115} [2025-04-13 20:59:38,068 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 84 predicate places. [2025-04-13 20:59:38,068 INFO L485 AbstractCegarLoop]: Abstraction has has 107 places, 115 transitions, 1692 flow [2025-04-13 20:59:38,068 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:38,068 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:38,068 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:38,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:59:38,069 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:38,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1445208587, now seen corresponding path program 2 times [2025-04-13 20:59:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:38,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881128977] [2025-04-13 20:59:38,069 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:38,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:38,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:38,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:38,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:38,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881128977] [2025-04-13 20:59:38,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881128977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:38,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749410008] [2025-04-13 20:59:38,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:38,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:38,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:38,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:38,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:59:38,125 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:38,135 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:38,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:38,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:38,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:38,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749410008] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:38,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:38,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 20:59:38,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12893677] [2025-04-13 20:59:38,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:38,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:38,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:38,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:59:38,200 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:38,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 1692 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:38,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:38,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:38,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:38,317 INFO L116 PetriNetUnfolderBase]: 389/732 cut-off events. [2025-04-13 20:59:38,317 INFO L117 PetriNetUnfolderBase]: For 8349/8349 co-relation queries the response was YES. [2025-04-13 20:59:38,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4384 conditions, 732 events. 389/732 cut-off events. For 8349/8349 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3689 event pairs, 57 based on Foata normal form. 8/722 useless extension candidates. Maximal degree in co-relation 3986. Up to 291 conditions per place. [2025-04-13 20:59:38,323 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 77 selfloop transitions, 44 changer transitions 0/156 dead transitions. [2025-04-13 20:59:38,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 156 transitions, 2258 flow [2025-04-13 20:59:38,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:38,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:38,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 20:59:38,324 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2025-04-13 20:59:38,324 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 1692 flow. Second operand 6 states and 82 transitions. [2025-04-13 20:59:38,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 156 transitions, 2258 flow [2025-04-13 20:59:38,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 156 transitions, 2098 flow, removed 54 selfloop flow, removed 3 redundant places. [2025-04-13 20:59:38,340 INFO L231 Difference]: Finished difference. Result has 112 places, 123 transitions, 1851 flow [2025-04-13 20:59:38,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1573, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1851, PETRI_PLACES=112, PETRI_TRANSITIONS=123} [2025-04-13 20:59:38,340 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 89 predicate places. [2025-04-13 20:59:38,340 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 123 transitions, 1851 flow [2025-04-13 20:59:38,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:38,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:38,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:38,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:38,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:38,541 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:38,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:38,542 INFO L85 PathProgramCache]: Analyzing trace with hash -997797900, now seen corresponding path program 1 times [2025-04-13 20:59:38,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:38,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503701670] [2025-04-13 20:59:38,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:38,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:38,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:59:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:38,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:38,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:38,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503701670] [2025-04-13 20:59:38,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503701670] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:38,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799339235] [2025-04-13 20:59:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:38,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:38,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:38,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:59:38,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:59:38,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:38,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:38,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:38,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:38,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:38,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:38,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799339235] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:38,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:38,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-04-13 20:59:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881385673] [2025-04-13 20:59:38,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:38,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:38,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:38,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:59:38,641 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:38,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 123 transitions, 1851 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:38,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:38,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:38,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:38,739 INFO L116 PetriNetUnfolderBase]: 385/727 cut-off events. [2025-04-13 20:59:38,739 INFO L117 PetriNetUnfolderBase]: For 7169/7169 co-relation queries the response was YES. [2025-04-13 20:59:38,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4289 conditions, 727 events. 385/727 cut-off events. For 7169/7169 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3608 event pairs, 34 based on Foata normal form. 13/734 useless extension candidates. Maximal degree in co-relation 3863. Up to 294 conditions per place. [2025-04-13 20:59:38,746 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 72 selfloop transitions, 37 changer transitions 0/141 dead transitions. [2025-04-13 20:59:38,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 141 transitions, 2137 flow [2025-04-13 20:59:38,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-04-13 20:59:38,749 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:59:38,749 INFO L175 Difference]: Start difference. First operand has 112 places, 123 transitions, 1851 flow. Second operand 5 states and 63 transitions. [2025-04-13 20:59:38,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 141 transitions, 2137 flow [2025-04-13 20:59:38,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 141 transitions, 2018 flow, removed 31 selfloop flow, removed 3 redundant places. [2025-04-13 20:59:38,766 INFO L231 Difference]: Finished difference. Result has 113 places, 118 transitions, 1745 flow [2025-04-13 20:59:38,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1745, PETRI_PLACES=113, PETRI_TRANSITIONS=118} [2025-04-13 20:59:38,767 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 90 predicate places. [2025-04-13 20:59:38,767 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 118 transitions, 1745 flow [2025-04-13 20:59:38,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:38,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:38,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:38,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:38,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 20:59:38,971 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:38,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:38,972 INFO L85 PathProgramCache]: Analyzing trace with hash -413008128, now seen corresponding path program 2 times [2025-04-13 20:59:38,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:38,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520231404] [2025-04-13 20:59:38,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:38,974 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:38,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:38,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:38,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:38,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520231404] [2025-04-13 20:59:38,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520231404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:38,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:38,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:38,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856276944] [2025-04-13 20:59:38,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:38,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:38,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:39,002 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:39,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 118 transitions, 1745 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:39,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:39,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:39,120 INFO L116 PetriNetUnfolderBase]: 437/844 cut-off events. [2025-04-13 20:59:39,120 INFO L117 PetriNetUnfolderBase]: For 7458/7458 co-relation queries the response was YES. [2025-04-13 20:59:39,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 844 events. 437/844 cut-off events. For 7458/7458 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4474 event pairs, 35 based on Foata normal form. 10/846 useless extension candidates. Maximal degree in co-relation 4445. Up to 245 conditions per place. [2025-04-13 20:59:39,126 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 88 selfloop transitions, 33 changer transitions 2/153 dead transitions. [2025-04-13 20:59:39,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 2350 flow [2025-04-13 20:59:39,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-13 20:59:39,127 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2025-04-13 20:59:39,127 INFO L175 Difference]: Start difference. First operand has 113 places, 118 transitions, 1745 flow. Second operand 6 states and 69 transitions. [2025-04-13 20:59:39,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 2350 flow [2025-04-13 20:59:39,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 153 transitions, 2284 flow, removed 8 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:39,143 INFO L231 Difference]: Finished difference. Result has 117 places, 122 transitions, 1882 flow [2025-04-13 20:59:39,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1882, PETRI_PLACES=117, PETRI_TRANSITIONS=122} [2025-04-13 20:59:39,144 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 94 predicate places. [2025-04-13 20:59:39,144 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 122 transitions, 1882 flow [2025-04-13 20:59:39,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:39,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:39,144 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 20:59:39,144 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:39,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1990349858, now seen corresponding path program 3 times [2025-04-13 20:59:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:39,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418806102] [2025-04-13 20:59:39,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:39,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:39,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:39,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:39,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:39,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:39,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418806102] [2025-04-13 20:59:39,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418806102] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:39,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605567043] [2025-04-13 20:59:39,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:39,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:39,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:39,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:59:39,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:39,207 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:39,207 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:39,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:39,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:39,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605567043] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:39,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:39,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-04-13 20:59:39,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356362194] [2025-04-13 20:59:39,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:39,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:39,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:39,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:39,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 20:59:39,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:39,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 122 transitions, 1882 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:39,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:39,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:39,353 INFO L116 PetriNetUnfolderBase]: 430/835 cut-off events. [2025-04-13 20:59:39,353 INFO L117 PetriNetUnfolderBase]: For 8832/8834 co-relation queries the response was YES. [2025-04-13 20:59:39,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4843 conditions, 835 events. 430/835 cut-off events. For 8832/8834 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4425 event pairs, 26 based on Foata normal form. 11/841 useless extension candidates. Maximal degree in co-relation 4572. Up to 396 conditions per place. [2025-04-13 20:59:39,358 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 75 selfloop transitions, 43 changer transitions 0/148 dead transitions. [2025-04-13 20:59:39,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 2344 flow [2025-04-13 20:59:39,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-04-13 20:59:39,359 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:59:39,359 INFO L175 Difference]: Start difference. First operand has 117 places, 122 transitions, 1882 flow. Second operand 5 states and 63 transitions. [2025-04-13 20:59:39,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 2344 flow [2025-04-13 20:59:39,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 148 transitions, 2253 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:39,377 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 1989 flow [2025-04-13 20:59:39,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1738, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1989, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2025-04-13 20:59:39,378 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 94 predicate places. [2025-04-13 20:59:39,378 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 1989 flow [2025-04-13 20:59:39,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,378 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:39,378 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:39,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:59:39,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:39,579 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:39,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 836889187, now seen corresponding path program 3 times [2025-04-13 20:59:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:39,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475800315] [2025-04-13 20:59:39,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:39,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:39,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:39,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:39,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475800315] [2025-04-13 20:59:39,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475800315] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:39,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:39,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:39,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678515350] [2025-04-13 20:59:39,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:39,603 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:39,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:39,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:39,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:39,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 1989 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:39,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:39,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:39,755 INFO L116 PetriNetUnfolderBase]: 398/772 cut-off events. [2025-04-13 20:59:39,755 INFO L117 PetriNetUnfolderBase]: For 9373/9375 co-relation queries the response was YES. [2025-04-13 20:59:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4770 conditions, 772 events. 398/772 cut-off events. For 9373/9375 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3978 event pairs, 49 based on Foata normal form. 9/775 useless extension candidates. Maximal degree in co-relation 4467. Up to 192 conditions per place. [2025-04-13 20:59:39,760 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 85 selfloop transitions, 36 changer transitions 5/155 dead transitions. [2025-04-13 20:59:39,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 155 transitions, 2399 flow [2025-04-13 20:59:39,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:59:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:59:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2025-04-13 20:59:39,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-04-13 20:59:39,761 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 1989 flow. Second operand 8 states and 91 transitions. [2025-04-13 20:59:39,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 155 transitions, 2399 flow [2025-04-13 20:59:39,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 155 transitions, 2356 flow, removed 18 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:39,780 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 1922 flow [2025-04-13 20:59:39,781 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1890, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1922, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2025-04-13 20:59:39,781 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 99 predicate places. [2025-04-13 20:59:39,781 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 1922 flow [2025-04-13 20:59:39,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:39,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:39,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 20:59:39,782 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:39,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:39,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1937744881, now seen corresponding path program 4 times [2025-04-13 20:59:39,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:39,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089359832] [2025-04-13 20:59:39,782 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:39,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:39,787 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:39,789 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:39,789 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:39,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:39,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089359832] [2025-04-13 20:59:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089359832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:39,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774215020] [2025-04-13 20:59:39,811 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:39,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:39,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:59:39,836 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:39,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:39,846 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:39,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:39,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:39,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774215020] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 8 [2025-04-13 20:59:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356059198] [2025-04-13 20:59:39,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:39,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:39,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:39,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:39,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 20:59:39,895 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:39,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 1922 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:39,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:39,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:39,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:40,002 INFO L116 PetriNetUnfolderBase]: 381/737 cut-off events. [2025-04-13 20:59:40,002 INFO L117 PetriNetUnfolderBase]: For 8958/8962 co-relation queries the response was YES. [2025-04-13 20:59:40,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 737 events. 381/737 cut-off events. For 8958/8962 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3733 event pairs, 38 based on Foata normal form. 10/738 useless extension candidates. Maximal degree in co-relation 4262. Up to 286 conditions per place. [2025-04-13 20:59:40,007 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 76 selfloop transitions, 35 changer transitions 1/141 dead transitions. [2025-04-13 20:59:40,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 141 transitions, 2306 flow [2025-04-13 20:59:40,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2025-04-13 20:59:40,008 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-13 20:59:40,008 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 1922 flow. Second operand 5 states and 63 transitions. [2025-04-13 20:59:40,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 141 transitions, 2306 flow [2025-04-13 20:59:40,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 141 transitions, 2234 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:40,025 INFO L231 Difference]: Finished difference. Result has 122 places, 118 transitions, 1945 flow [2025-04-13 20:59:40,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1945, PETRI_PLACES=122, PETRI_TRANSITIONS=118} [2025-04-13 20:59:40,026 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 99 predicate places. [2025-04-13 20:59:40,026 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 118 transitions, 1945 flow [2025-04-13 20:59:40,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:40,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:40,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:40,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 20:59:40,230 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:40,230 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:40,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash -250844675, now seen corresponding path program 5 times [2025-04-13 20:59:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:40,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866049022] [2025-04-13 20:59:40,230 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:40,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:40,233 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:40,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:40,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:40,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:40,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866049022] [2025-04-13 20:59:40,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866049022] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:40,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527171691] [2025-04-13 20:59:40,260 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:40,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:40,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:40,262 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:40,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:59:40,288 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:40,295 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:40,295 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:40,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:40,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527171691] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:40,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-04-13 20:59:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739439903] [2025-04-13 20:59:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:40,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:40,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:40,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:59:40,328 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:40,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 118 transitions, 1945 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:40,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:40,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:40,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:40,421 INFO L116 PetriNetUnfolderBase]: 371/723 cut-off events. [2025-04-13 20:59:40,421 INFO L117 PetriNetUnfolderBase]: For 9000/9002 co-relation queries the response was YES. [2025-04-13 20:59:40,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 723 events. 371/723 cut-off events. For 9000/9002 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3685 event pairs, 40 based on Foata normal form. 10/723 useless extension candidates. Maximal degree in co-relation 4317. Up to 309 conditions per place. [2025-04-13 20:59:40,427 INFO L140 encePairwiseOnDemand]: 16/21 looper letters, 71 selfloop transitions, 38 changer transitions 2/137 dead transitions. [2025-04-13 20:59:40,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 137 transitions, 2292 flow [2025-04-13 20:59:40,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:59:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:59:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-04-13 20:59:40,428 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2025-04-13 20:59:40,428 INFO L175 Difference]: Start difference. First operand has 122 places, 118 transitions, 1945 flow. Second operand 5 states and 59 transitions. [2025-04-13 20:59:40,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 137 transitions, 2292 flow [2025-04-13 20:59:40,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 137 transitions, 2250 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:40,445 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 1943 flow [2025-04-13 20:59:40,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1758, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1943, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2025-04-13 20:59:40,445 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 100 predicate places. [2025-04-13 20:59:40,445 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 1943 flow [2025-04-13 20:59:40,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:40,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:40,446 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:40,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:59:40,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 20:59:40,650 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:40,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1521568866, now seen corresponding path program 4 times [2025-04-13 20:59:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:40,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122481647] [2025-04-13 20:59:40,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:40,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:40,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:40,659 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:40,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:40,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122481647] [2025-04-13 20:59:40,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122481647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:40,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453540059] [2025-04-13 20:59:40,679 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:40,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:40,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:40,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:40,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:59:40,705 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:40,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:40,714 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:40,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:40,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 20:59:40,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453540059] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:59:40,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2025-04-13 20:59:40,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474148920] [2025-04-13 20:59:40,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:40,755 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:40,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:40,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:40,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 20:59:40,762 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:40,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 1943 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:40,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:40,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:40,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:40,867 INFO L116 PetriNetUnfolderBase]: 341/668 cut-off events. [2025-04-13 20:59:40,867 INFO L117 PetriNetUnfolderBase]: For 9000/9002 co-relation queries the response was YES. [2025-04-13 20:59:40,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4325 conditions, 668 events. 341/668 cut-off events. For 9000/9002 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3333 event pairs, 60 based on Foata normal form. 11/677 useless extension candidates. Maximal degree in co-relation 4154. Up to 306 conditions per place. [2025-04-13 20:59:40,871 INFO L140 encePairwiseOnDemand]: 14/21 looper letters, 74 selfloop transitions, 43 changer transitions 1/144 dead transitions. [2025-04-13 20:59:40,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 144 transitions, 2365 flow [2025-04-13 20:59:40,871 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2025-04-13 20:59:40,872 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2025-04-13 20:59:40,872 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 1943 flow. Second operand 6 states and 78 transitions. [2025-04-13 20:59:40,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 144 transitions, 2365 flow [2025-04-13 20:59:40,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 144 transitions, 2314 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:40,887 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 2080 flow [2025-04-13 20:59:40,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2080, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2025-04-13 20:59:40,887 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 102 predicate places. [2025-04-13 20:59:40,887 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 2080 flow [2025-04-13 20:59:40,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:40,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:40,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:40,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 20:59:41,088 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 20:59:41,088 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:41,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1663432588, now seen corresponding path program 5 times [2025-04-13 20:59:41,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:41,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471277989] [2025-04-13 20:59:41,089 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:41,091 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:41,095 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:41,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:41,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:41,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:41,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471277989] [2025-04-13 20:59:41,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471277989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:41,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:41,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569583193] [2025-04-13 20:59:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:41,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:41,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:41,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:41,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:41,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:41,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 2080 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:41,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:41,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:41,250 INFO L116 PetriNetUnfolderBase]: 329/648 cut-off events. [2025-04-13 20:59:41,250 INFO L117 PetriNetUnfolderBase]: For 9272/9274 co-relation queries the response was YES. [2025-04-13 20:59:41,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4337 conditions, 648 events. 329/648 cut-off events. For 9272/9274 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3197 event pairs, 46 based on Foata normal form. 8/654 useless extension candidates. Maximal degree in co-relation 4132. Up to 164 conditions per place. [2025-04-13 20:59:41,254 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 78 selfloop transitions, 39 changer transitions 3/144 dead transitions. [2025-04-13 20:59:41,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 144 transitions, 2443 flow [2025-04-13 20:59:41,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 20:59:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 20:59:41,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2025-04-13 20:59:41,258 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2025-04-13 20:59:41,258 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 2080 flow. Second operand 8 states and 89 transitions. [2025-04-13 20:59:41,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 144 transitions, 2443 flow [2025-04-13 20:59:41,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 144 transitions, 2347 flow, removed 21 selfloop flow, removed 2 redundant places. [2025-04-13 20:59:41,276 INFO L231 Difference]: Finished difference. Result has 130 places, 113 transitions, 1977 flow [2025-04-13 20:59:41,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1940, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1977, PETRI_PLACES=130, PETRI_TRANSITIONS=113} [2025-04-13 20:59:41,276 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 107 predicate places. [2025-04-13 20:59:41,276 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 113 transitions, 1977 flow [2025-04-13 20:59:41,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:41,277 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:41,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:59:41,277 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:41,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:41,277 INFO L85 PathProgramCache]: Analyzing trace with hash -266144158, now seen corresponding path program 6 times [2025-04-13 20:59:41,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:41,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880697722] [2025-04-13 20:59:41,278 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:41,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:41,281 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:41,281 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:41,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880697722] [2025-04-13 20:59:41,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880697722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:41,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133837615] [2025-04-13 20:59:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:41,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:41,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:41,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:41,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:41,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:41,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 113 transitions, 1977 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:41,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:41,405 INFO L116 PetriNetUnfolderBase]: 295/579 cut-off events. [2025-04-13 20:59:41,405 INFO L117 PetriNetUnfolderBase]: For 8524/8524 co-relation queries the response was YES. [2025-04-13 20:59:41,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3957 conditions, 579 events. 295/579 cut-off events. For 8524/8524 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2778 event pairs, 52 based on Foata normal form. 10/583 useless extension candidates. Maximal degree in co-relation 3788. Up to 223 conditions per place. [2025-04-13 20:59:41,411 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 59 selfloop transitions, 33 changer transitions 12/122 dead transitions. [2025-04-13 20:59:41,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 122 transitions, 2150 flow [2025-04-13 20:59:41,411 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:59:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:59:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2025-04-13 20:59:41,412 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-04-13 20:59:41,412 INFO L175 Difference]: Start difference. First operand has 130 places, 113 transitions, 1977 flow. Second operand 7 states and 70 transitions. [2025-04-13 20:59:41,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 122 transitions, 2150 flow [2025-04-13 20:59:41,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 122 transitions, 1992 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:41,426 INFO L231 Difference]: Finished difference. Result has 130 places, 100 transitions, 1673 flow [2025-04-13 20:59:41,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1673, PETRI_PLACES=130, PETRI_TRANSITIONS=100} [2025-04-13 20:59:41,428 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 107 predicate places. [2025-04-13 20:59:41,428 INFO L485 AbstractCegarLoop]: Abstraction has has 130 places, 100 transitions, 1673 flow [2025-04-13 20:59:41,428 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:41,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:41,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 20:59:41,428 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:41,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:41,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1281655409, now seen corresponding path program 6 times [2025-04-13 20:59:41,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:41,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087055432] [2025-04-13 20:59:41,429 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:41,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:41,431 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-04-13 20:59:41,433 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:59:41,433 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:41,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:41,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:41,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087055432] [2025-04-13 20:59:41,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087055432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:41,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:59:41,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:59:41,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114451903] [2025-04-13 20:59:41,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:41,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:59:41,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:41,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:59:41,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 20:59:41,461 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 20:59:41,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 100 transitions, 1673 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:41,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 20:59:41,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:41,558 INFO L116 PetriNetUnfolderBase]: 254/491 cut-off events. [2025-04-13 20:59:41,558 INFO L117 PetriNetUnfolderBase]: For 6701/6701 co-relation queries the response was YES. [2025-04-13 20:59:41,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 491 events. 254/491 cut-off events. For 6701/6701 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2174 event pairs, 20 based on Foata normal form. 7/496 useless extension candidates. Maximal degree in co-relation 3239. Up to 174 conditions per place. [2025-04-13 20:59:41,560 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 74 selfloop transitions, 23 changer transitions 2/113 dead transitions. [2025-04-13 20:59:41,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 113 transitions, 1897 flow [2025-04-13 20:59:41,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:59:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:59:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2025-04-13 20:59:41,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-04-13 20:59:41,561 INFO L175 Difference]: Start difference. First operand has 130 places, 100 transitions, 1673 flow. Second operand 6 states and 66 transitions. [2025-04-13 20:59:41,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 113 transitions, 1897 flow [2025-04-13 20:59:41,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 1744 flow, removed 11 selfloop flow, removed 11 redundant places. [2025-04-13 20:59:41,571 INFO L231 Difference]: Finished difference. Result has 118 places, 91 transitions, 1412 flow [2025-04-13 20:59:41,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1412, PETRI_PLACES=118, PETRI_TRANSITIONS=91} [2025-04-13 20:59:41,572 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 95 predicate places. [2025-04-13 20:59:41,572 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 91 transitions, 1412 flow [2025-04-13 20:59:41,572 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:41,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:41,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:41,572 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 20:59:41,572 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:41,572 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1380097540, now seen corresponding path program 1 times [2025-04-13 20:59:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:41,572 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068485862] [2025-04-13 20:59:41,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:41,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:41,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:41,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:41,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:41,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:41,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068485862] [2025-04-13 20:59:41,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068485862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:41,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316217781] [2025-04-13 20:59:41,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:59:41,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:41,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:41,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:41,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 20:59:41,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:41,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:41,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:41,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:41,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:41,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:41,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:42,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316217781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:42,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:42,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:42,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013409489] [2025-04-13 20:59:42,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:42,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:42,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:42,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:42,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:42,027 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:42,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 91 transitions, 1412 flow. Second operand has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:42,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:42,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:42,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:43,051 INFO L116 PetriNetUnfolderBase]: 694/1287 cut-off events. [2025-04-13 20:59:43,051 INFO L117 PetriNetUnfolderBase]: For 11518/11518 co-relation queries the response was YES. [2025-04-13 20:59:43,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6873 conditions, 1287 events. 694/1287 cut-off events. For 11518/11518 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6882 event pairs, 31 based on Foata normal form. 2/1289 useless extension candidates. Maximal degree in co-relation 6735. Up to 242 conditions per place. [2025-04-13 20:59:43,058 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 129 selfloop transitions, 87 changer transitions 68/284 dead transitions. [2025-04-13 20:59:43,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 284 transitions, 3650 flow [2025-04-13 20:59:43,058 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 20:59:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-04-13 20:59:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 274 transitions. [2025-04-13 20:59:43,059 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36243386243386244 [2025-04-13 20:59:43,059 INFO L175 Difference]: Start difference. First operand has 118 places, 91 transitions, 1412 flow. Second operand 36 states and 274 transitions. [2025-04-13 20:59:43,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 284 transitions, 3650 flow [2025-04-13 20:59:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 284 transitions, 3545 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:43,075 INFO L231 Difference]: Finished difference. Result has 158 places, 128 transitions, 2211 flow [2025-04-13 20:59:43,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2211, PETRI_PLACES=158, PETRI_TRANSITIONS=128} [2025-04-13 20:59:43,076 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 135 predicate places. [2025-04-13 20:59:43,076 INFO L485 AbstractCegarLoop]: Abstraction has has 158 places, 128 transitions, 2211 flow [2025-04-13 20:59:43,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.6956521739130435) internal successors, (85), 23 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:43,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:43,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:43,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:43,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:43,278 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:43,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash 594149446, now seen corresponding path program 2 times [2025-04-13 20:59:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:43,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828106483] [2025-04-13 20:59:43,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:43,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:43,283 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:43,283 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:43,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:43,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828106483] [2025-04-13 20:59:43,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828106483] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:43,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136163907] [2025-04-13 20:59:43,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:43,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:43,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:43,367 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:43,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 20:59:43,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:43,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:43,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:43,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:43,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:43,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:43,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:43,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136163907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:43,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30718822] [2025-04-13 20:59:43,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:43,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:43,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:43,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:43,678 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:43,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 128 transitions, 2211 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:43,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:43,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:43,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:44,094 INFO L116 PetriNetUnfolderBase]: 751/1444 cut-off events. [2025-04-13 20:59:44,094 INFO L117 PetriNetUnfolderBase]: For 15109/15109 co-relation queries the response was YES. [2025-04-13 20:59:44,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7972 conditions, 1444 events. 751/1444 cut-off events. For 15109/15109 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 8272 event pairs, 98 based on Foata normal form. 3/1447 useless extension candidates. Maximal degree in co-relation 7847. Up to 594 conditions per place. [2025-04-13 20:59:44,101 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 102 selfloop transitions, 99 changer transitions 12/213 dead transitions. [2025-04-13 20:59:44,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 213 transitions, 3608 flow [2025-04-13 20:59:44,101 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:59:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:59:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 108 transitions. [2025-04-13 20:59:44,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3956043956043956 [2025-04-13 20:59:44,102 INFO L175 Difference]: Start difference. First operand has 158 places, 128 transitions, 2211 flow. Second operand 13 states and 108 transitions. [2025-04-13 20:59:44,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 213 transitions, 3608 flow [2025-04-13 20:59:44,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 213 transitions, 2810 flow, removed 185 selfloop flow, removed 22 redundant places. [2025-04-13 20:59:44,134 INFO L231 Difference]: Finished difference. Result has 142 places, 160 transitions, 2288 flow [2025-04-13 20:59:44,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2288, PETRI_PLACES=142, PETRI_TRANSITIONS=160} [2025-04-13 20:59:44,134 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 119 predicate places. [2025-04-13 20:59:44,134 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 160 transitions, 2288 flow [2025-04-13 20:59:44,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:44,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:44,134 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:44,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:44,335 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-04-13 20:59:44,335 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:44,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:44,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1989100086, now seen corresponding path program 3 times [2025-04-13 20:59:44,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:44,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300264416] [2025-04-13 20:59:44,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:44,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:44,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:44,339 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:44,339 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:44,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:44,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300264416] [2025-04-13 20:59:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300264416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:44,421 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436715639] [2025-04-13 20:59:44,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:44,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:44,423 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:44,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 20:59:44,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:44,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:44,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:44,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:44,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:44,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:44,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:44,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436715639] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:44,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108517172] [2025-04-13 20:59:44,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:44,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:44,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:44,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:44,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:44,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:44,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 160 transitions, 2288 flow. Second operand has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:44,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:44,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:44,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:45,218 INFO L116 PetriNetUnfolderBase]: 897/1718 cut-off events. [2025-04-13 20:59:45,218 INFO L117 PetriNetUnfolderBase]: For 14263/14263 co-relation queries the response was YES. [2025-04-13 20:59:45,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8559 conditions, 1718 events. 897/1718 cut-off events. For 14263/14263 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 10152 event pairs, 81 based on Foata normal form. 6/1724 useless extension candidates. Maximal degree in co-relation 8456. Up to 438 conditions per place. [2025-04-13 20:59:45,228 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 89 selfloop transitions, 144 changer transitions 27/260 dead transitions. [2025-04-13 20:59:45,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 260 transitions, 3853 flow [2025-04-13 20:59:45,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:59:45,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:59:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2025-04-13 20:59:45,229 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2025-04-13 20:59:45,229 INFO L175 Difference]: Start difference. First operand has 142 places, 160 transitions, 2288 flow. Second operand 18 states and 136 transitions. [2025-04-13 20:59:45,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 260 transitions, 3853 flow [2025-04-13 20:59:45,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 260 transitions, 3752 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:45,256 INFO L231 Difference]: Finished difference. Result has 160 places, 195 transitions, 3200 flow [2025-04-13 20:59:45,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3200, PETRI_PLACES=160, PETRI_TRANSITIONS=195} [2025-04-13 20:59:45,257 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 137 predicate places. [2025-04-13 20:59:45,257 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 195 transitions, 3200 flow [2025-04-13 20:59:45,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.391304347826087) internal successors, (78), 23 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:45,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:45,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:45,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 20:59:45,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:45,458 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:45,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -2098290080, now seen corresponding path program 4 times [2025-04-13 20:59:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:45,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910383226] [2025-04-13 20:59:45,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:45,460 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:45,462 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:45,462 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:45,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:45,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:45,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:45,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910383226] [2025-04-13 20:59:45,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910383226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:45,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052611777] [2025-04-13 20:59:45,540 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:45,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:45,542 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:45,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 20:59:45,564 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:45,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:45,572 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:45,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:45,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:45,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:45,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052611777] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:45,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531960549] [2025-04-13 20:59:45,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:45,834 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:45,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:45,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:45,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:45,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 195 transitions, 3200 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:45,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:45,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:45,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:46,299 INFO L116 PetriNetUnfolderBase]: 834/1607 cut-off events. [2025-04-13 20:59:46,299 INFO L117 PetriNetUnfolderBase]: For 16872/16872 co-relation queries the response was YES. [2025-04-13 20:59:46,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8995 conditions, 1607 events. 834/1607 cut-off events. For 16872/16872 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9453 event pairs, 93 based on Foata normal form. 4/1611 useless extension candidates. Maximal degree in co-relation 8886. Up to 523 conditions per place. [2025-04-13 20:59:46,306 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 83 selfloop transitions, 139 changer transitions 16/238 dead transitions. [2025-04-13 20:59:46,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 238 transitions, 3966 flow [2025-04-13 20:59:46,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:59:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:59:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 126 transitions. [2025-04-13 20:59:46,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2025-04-13 20:59:46,307 INFO L175 Difference]: Start difference. First operand has 160 places, 195 transitions, 3200 flow. Second operand 17 states and 126 transitions. [2025-04-13 20:59:46,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 238 transitions, 3966 flow [2025-04-13 20:59:46,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 238 transitions, 3761 flow, removed 72 selfloop flow, removed 5 redundant places. [2025-04-13 20:59:46,352 INFO L231 Difference]: Finished difference. Result has 171 places, 190 transitions, 3195 flow [2025-04-13 20:59:46,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2999, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3195, PETRI_PLACES=171, PETRI_TRANSITIONS=190} [2025-04-13 20:59:46,353 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 148 predicate places. [2025-04-13 20:59:46,353 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 190 transitions, 3195 flow [2025-04-13 20:59:46,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:46,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:46,353 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:46,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:46,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 20:59:46,553 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:46,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -369242746, now seen corresponding path program 5 times [2025-04-13 20:59:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:46,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259365799] [2025-04-13 20:59:46,554 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:46,556 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:46,557 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:46,557 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:46,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:46,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:46,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259365799] [2025-04-13 20:59:46,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259365799] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:46,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563732232] [2025-04-13 20:59:46,615 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:46,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:46,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:46,617 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:46,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 20:59:46,641 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:46,648 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:46,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:46,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:46,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:59:46,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:46,704 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563732232] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2025-04-13 20:59:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423742993] [2025-04-13 20:59:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:46,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:46,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:46,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:59:46,711 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:46,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 190 transitions, 3195 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:46,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:46,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:46,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:46,885 INFO L116 PetriNetUnfolderBase]: 776/1471 cut-off events. [2025-04-13 20:59:46,886 INFO L117 PetriNetUnfolderBase]: For 16639/16639 co-relation queries the response was YES. [2025-04-13 20:59:46,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8658 conditions, 1471 events. 776/1471 cut-off events. For 16639/16639 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8209 event pairs, 173 based on Foata normal form. 2/1473 useless extension candidates. Maximal degree in co-relation 8554. Up to 997 conditions per place. [2025-04-13 20:59:46,893 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 118 selfloop transitions, 55 changer transitions 47/220 dead transitions. [2025-04-13 20:59:46,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 220 transitions, 3904 flow [2025-04-13 20:59:46,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:46,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 75 transitions. [2025-04-13 20:59:46,894 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3968253968253968 [2025-04-13 20:59:46,894 INFO L175 Difference]: Start difference. First operand has 171 places, 190 transitions, 3195 flow. Second operand 9 states and 75 transitions. [2025-04-13 20:59:46,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 220 transitions, 3904 flow [2025-04-13 20:59:46,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 220 transitions, 3675 flow, removed 5 selfloop flow, removed 13 redundant places. [2025-04-13 20:59:46,929 INFO L231 Difference]: Finished difference. Result has 165 places, 163 transitions, 2559 flow [2025-04-13 20:59:46,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2559, PETRI_PLACES=165, PETRI_TRANSITIONS=163} [2025-04-13 20:59:46,929 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 142 predicate places. [2025-04-13 20:59:46,929 INFO L485 AbstractCegarLoop]: Abstraction has has 165 places, 163 transitions, 2559 flow [2025-04-13 20:59:46,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:46,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:46,929 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:46,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:59:47,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 20:59:47,130 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:47,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1666388538, now seen corresponding path program 6 times [2025-04-13 20:59:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:47,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620993987] [2025-04-13 20:59:47,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:47,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:47,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:47,134 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:47,134 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:47,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:47,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:47,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:47,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620993987] [2025-04-13 20:59:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620993987] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:47,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24681807] [2025-04-13 20:59:47,210 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:47,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:47,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:47,212 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:47,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 20:59:47,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:47,240 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:47,241 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:47,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:47,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:47,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:47,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:47,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24681807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:47,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032552967] [2025-04-13 20:59:47,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:47,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:47,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:47,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:47,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:47,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 163 transitions, 2559 flow. Second operand has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:47,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:47,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:47,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:47,886 INFO L116 PetriNetUnfolderBase]: 737/1436 cut-off events. [2025-04-13 20:59:47,886 INFO L117 PetriNetUnfolderBase]: For 14438/14438 co-relation queries the response was YES. [2025-04-13 20:59:47,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7618 conditions, 1436 events. 737/1436 cut-off events. For 14438/14438 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8281 event pairs, 111 based on Foata normal form. 2/1438 useless extension candidates. Maximal degree in co-relation 7506. Up to 647 conditions per place. [2025-04-13 20:59:47,893 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 105 selfloop transitions, 93 changer transitions 20/218 dead transitions. [2025-04-13 20:59:47,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 218 transitions, 3464 flow [2025-04-13 20:59:47,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:59:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:59:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 110 transitions. [2025-04-13 20:59:47,894 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2025-04-13 20:59:47,894 INFO L175 Difference]: Start difference. First operand has 165 places, 163 transitions, 2559 flow. Second operand 14 states and 110 transitions. [2025-04-13 20:59:47,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 218 transitions, 3464 flow [2025-04-13 20:59:47,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 218 transitions, 3200 flow, removed 23 selfloop flow, removed 16 redundant places. [2025-04-13 20:59:47,925 INFO L231 Difference]: Finished difference. Result has 153 places, 158 transitions, 2458 flow [2025-04-13 20:59:47,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2323, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2458, PETRI_PLACES=153, PETRI_TRANSITIONS=158} [2025-04-13 20:59:47,925 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 130 predicate places. [2025-04-13 20:59:47,925 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 158 transitions, 2458 flow [2025-04-13 20:59:47,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.5652173913043477) internal successors, (82), 23 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:47,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:47,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:47,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 20:59:48,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 20:59:48,130 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:48,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash 513352416, now seen corresponding path program 7 times [2025-04-13 20:59:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:48,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136784100] [2025-04-13 20:59:48,131 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:48,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:48,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:48,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:48,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136784100] [2025-04-13 20:59:48,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136784100] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:48,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970226682] [2025-04-13 20:59:48,215 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:48,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:48,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:48,218 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:48,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:59:48,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:48,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:48,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:48,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:48,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:48,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:48,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:48,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970226682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:48,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:48,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-13 20:59:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87601352] [2025-04-13 20:59:48,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:48,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:59:48,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:48,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:59:48,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:59:48,480 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:48,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 158 transitions, 2458 flow. Second operand has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:48,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:48,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:49,198 INFO L116 PetriNetUnfolderBase]: 1010/1924 cut-off events. [2025-04-13 20:59:49,198 INFO L117 PetriNetUnfolderBase]: For 21387/21387 co-relation queries the response was YES. [2025-04-13 20:59:49,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10784 conditions, 1924 events. 1010/1924 cut-off events. For 21387/21387 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11520 event pairs, 36 based on Foata normal form. 27/1951 useless extension candidates. Maximal degree in co-relation 10658. Up to 466 conditions per place. [2025-04-13 20:59:49,208 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 110 selfloop transitions, 206 changer transitions 12/328 dead transitions. [2025-04-13 20:59:49,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 328 transitions, 5367 flow [2025-04-13 20:59:49,208 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 20:59:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-04-13 20:59:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 191 transitions. [2025-04-13 20:59:49,209 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32482993197278914 [2025-04-13 20:59:49,209 INFO L175 Difference]: Start difference. First operand has 153 places, 158 transitions, 2458 flow. Second operand 28 states and 191 transitions. [2025-04-13 20:59:49,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 328 transitions, 5367 flow [2025-04-13 20:59:49,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 328 transitions, 5231 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-04-13 20:59:49,252 INFO L231 Difference]: Finished difference. Result has 178 places, 265 transitions, 4938 flow [2025-04-13 20:59:49,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2388, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4938, PETRI_PLACES=178, PETRI_TRANSITIONS=265} [2025-04-13 20:59:49,252 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 155 predicate places. [2025-04-13 20:59:49,252 INFO L485 AbstractCegarLoop]: Abstraction has has 178 places, 265 transitions, 4938 flow [2025-04-13 20:59:49,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.5) internal successors, (70), 20 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:49,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:49,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:49,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:49,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 20:59:49,453 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:49,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:49,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1370804332, now seen corresponding path program 8 times [2025-04-13 20:59:49,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:49,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572253371] [2025-04-13 20:59:49,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:49,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:49,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:49,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:49,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:49,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:49,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:49,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572253371] [2025-04-13 20:59:49,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572253371] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:49,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990502050] [2025-04-13 20:59:49,534 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:49,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:49,537 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:49,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:59:49,562 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:49,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:49,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:49,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:49,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:49,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:49,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:49,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990502050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:49,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:49,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 20:59:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472032164] [2025-04-13 20:59:49,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:49,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:59:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:49,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:59:49,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:59:49,811 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:49,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 265 transitions, 4938 flow. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:49,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:49,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:49,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:50,265 INFO L116 PetriNetUnfolderBase]: 1195/2264 cut-off events. [2025-04-13 20:59:50,265 INFO L117 PetriNetUnfolderBase]: For 31612/31612 co-relation queries the response was YES. [2025-04-13 20:59:50,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14756 conditions, 2264 events. 1195/2264 cut-off events. For 31612/31612 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14132 event pairs, 187 based on Foata normal form. 2/2266 useless extension candidates. Maximal degree in co-relation 14621. Up to 1273 conditions per place. [2025-04-13 20:59:50,278 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 171 selfloop transitions, 196 changer transitions 16/383 dead transitions. [2025-04-13 20:59:50,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 383 transitions, 7706 flow [2025-04-13 20:59:50,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:59:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:59:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2025-04-13 20:59:50,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3626373626373626 [2025-04-13 20:59:50,279 INFO L175 Difference]: Start difference. First operand has 178 places, 265 transitions, 4938 flow. Second operand 13 states and 99 transitions. [2025-04-13 20:59:50,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 383 transitions, 7706 flow [2025-04-13 20:59:50,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 383 transitions, 7028 flow, removed 321 selfloop flow, removed 4 redundant places. [2025-04-13 20:59:50,412 INFO L231 Difference]: Finished difference. Result has 189 places, 318 transitions, 6083 flow [2025-04-13 20:59:50,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4510, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6083, PETRI_PLACES=189, PETRI_TRANSITIONS=318} [2025-04-13 20:59:50,412 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 166 predicate places. [2025-04-13 20:59:50,412 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 318 transitions, 6083 flow [2025-04-13 20:59:50,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:50,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:50,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:50,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 20:59:50,614 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:50,615 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:50,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:50,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1969018208, now seen corresponding path program 9 times [2025-04-13 20:59:50,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:50,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005932711] [2025-04-13 20:59:50,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:50,617 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:50,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:50,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:50,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:50,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:50,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:50,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005932711] [2025-04-13 20:59:50,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005932711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:50,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199635399] [2025-04-13 20:59:50,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:50,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:50,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:50,680 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:50,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:59:50,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:50,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:50,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:50,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:50,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:50,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:50,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:50,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:50,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199635399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:50,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:50,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 20:59:50,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453541296] [2025-04-13 20:59:50,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:50,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 20:59:50,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:50,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 20:59:50,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 20:59:50,905 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:50,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 318 transitions, 6083 flow. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:50,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:50,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:50,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:51,375 INFO L116 PetriNetUnfolderBase]: 1435/2728 cut-off events. [2025-04-13 20:59:51,375 INFO L117 PetriNetUnfolderBase]: For 41591/41591 co-relation queries the response was YES. [2025-04-13 20:59:51,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17251 conditions, 2728 events. 1435/2728 cut-off events. For 41591/41591 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17801 event pairs, 218 based on Foata normal form. 10/2738 useless extension candidates. Maximal degree in co-relation 17119. Up to 1239 conditions per place. [2025-04-13 20:59:51,390 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 156 selfloop transitions, 166 changer transitions 101/423 dead transitions. [2025-04-13 20:59:51,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 423 transitions, 8357 flow [2025-04-13 20:59:51,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:59:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:59:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 109 transitions. [2025-04-13 20:59:51,391 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.346031746031746 [2025-04-13 20:59:51,391 INFO L175 Difference]: Start difference. First operand has 189 places, 318 transitions, 6083 flow. Second operand 15 states and 109 transitions. [2025-04-13 20:59:51,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 423 transitions, 8357 flow [2025-04-13 20:59:51,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 423 transitions, 8093 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-13 20:59:51,534 INFO L231 Difference]: Finished difference. Result has 198 places, 287 transitions, 5495 flow [2025-04-13 20:59:51,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5865, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5495, PETRI_PLACES=198, PETRI_TRANSITIONS=287} [2025-04-13 20:59:51,534 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 175 predicate places. [2025-04-13 20:59:51,535 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 287 transitions, 5495 flow [2025-04-13 20:59:51,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:51,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:51,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:51,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:59:51,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:59:51,735 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:51,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:51,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1646228106, now seen corresponding path program 10 times [2025-04-13 20:59:51,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:51,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900164962] [2025-04-13 20:59:51,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:51,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:51,738 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:51,739 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:51,739 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:51,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:51,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:51,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900164962] [2025-04-13 20:59:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900164962] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:51,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763148997] [2025-04-13 20:59:51,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:51,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:51,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:51,810 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:51,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:59:51,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:51,839 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:51,839 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:51,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:51,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:51,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:51,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763148997] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:52,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:52,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917671512] [2025-04-13 20:59:52,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:52,087 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:52,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:52,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:52,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:52,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:52,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 287 transitions, 5495 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:52,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:52,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:52,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:52,566 INFO L116 PetriNetUnfolderBase]: 1355/2587 cut-off events. [2025-04-13 20:59:52,566 INFO L117 PetriNetUnfolderBase]: For 37292/37292 co-relation queries the response was YES. [2025-04-13 20:59:52,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16686 conditions, 2587 events. 1355/2587 cut-off events. For 37292/37292 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 16910 event pairs, 182 based on Foata normal form. 6/2593 useless extension candidates. Maximal degree in co-relation 16554. Up to 1288 conditions per place. [2025-04-13 20:59:52,582 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 157 selfloop transitions, 219 changer transitions 53/429 dead transitions. [2025-04-13 20:59:52,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 429 transitions, 8488 flow [2025-04-13 20:59:52,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 20:59:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 20:59:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 136 transitions. [2025-04-13 20:59:52,584 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2025-04-13 20:59:52,584 INFO L175 Difference]: Start difference. First operand has 198 places, 287 transitions, 5495 flow. Second operand 18 states and 136 transitions. [2025-04-13 20:59:52,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 429 transitions, 8488 flow [2025-04-13 20:59:52,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 429 transitions, 8047 flow, removed 4 selfloop flow, removed 11 redundant places. [2025-04-13 20:59:52,715 INFO L231 Difference]: Finished difference. Result has 207 places, 325 transitions, 6542 flow [2025-04-13 20:59:52,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5166, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6542, PETRI_PLACES=207, PETRI_TRANSITIONS=325} [2025-04-13 20:59:52,716 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 184 predicate places. [2025-04-13 20:59:52,716 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 325 transitions, 6542 flow [2025-04-13 20:59:52,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:52,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:52,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:52,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:59:52,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 20:59:52,917 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:52,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash 940771342, now seen corresponding path program 11 times [2025-04-13 20:59:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:52,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274259904] [2025-04-13 20:59:52,917 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:52,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:52,919 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:52,920 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:52,920 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:52,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:52,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:52,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274259904] [2025-04-13 20:59:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274259904] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:52,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516454696] [2025-04-13 20:59:52,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:52,972 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:52,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:59:52,996 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:53,002 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:53,003 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:53,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:53,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:59:53,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:53,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516454696] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:53,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:53,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2025-04-13 20:59:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200675453] [2025-04-13 20:59:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:53,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:53,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:53,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:59:53,047 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:53,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 325 transitions, 6542 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:53,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:53,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:53,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:53,321 INFO L116 PetriNetUnfolderBase]: 1255/2409 cut-off events. [2025-04-13 20:59:53,321 INFO L117 PetriNetUnfolderBase]: For 36841/36841 co-relation queries the response was YES. [2025-04-13 20:59:53,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15842 conditions, 2409 events. 1255/2409 cut-off events. For 36841/36841 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15559 event pairs, 85 based on Foata normal form. 16/2425 useless extension candidates. Maximal degree in co-relation 15730. Up to 608 conditions per place. [2025-04-13 20:59:53,335 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 128 selfloop transitions, 140 changer transitions 90/358 dead transitions. [2025-04-13 20:59:53,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 358 transitions, 7733 flow [2025-04-13 20:59:53,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2025-04-13 20:59:53,335 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35978835978835977 [2025-04-13 20:59:53,336 INFO L175 Difference]: Start difference. First operand has 207 places, 325 transitions, 6542 flow. Second operand 9 states and 68 transitions. [2025-04-13 20:59:53,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 358 transitions, 7733 flow [2025-04-13 20:59:53,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 358 transitions, 7424 flow, removed 29 selfloop flow, removed 16 redundant places. [2025-04-13 20:59:53,469 INFO L231 Difference]: Finished difference. Result has 193 places, 255 transitions, 5221 flow [2025-04-13 20:59:53,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6245, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5221, PETRI_PLACES=193, PETRI_TRANSITIONS=255} [2025-04-13 20:59:53,470 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 170 predicate places. [2025-04-13 20:59:53,470 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 255 transitions, 5221 flow [2025-04-13 20:59:53,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:53,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:53,470 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:53,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:53,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:53,671 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:53,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash 813226216, now seen corresponding path program 12 times [2025-04-13 20:59:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:53,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402982109] [2025-04-13 20:59:53,671 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:53,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:53,673 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:53,675 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:53,675 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:53,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:53,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:53,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402982109] [2025-04-13 20:59:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402982109] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:53,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182696021] [2025-04-13 20:59:53,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:59:53,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:53,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:53,753 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:53,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:59:53,775 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:53,782 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:53,782 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:59:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:53,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:53,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:53,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:53,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:53,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:53,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182696021] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:53,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:53,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-13 20:59:53,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206517822] [2025-04-13 20:59:53,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:53,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 20:59:53,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:53,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 20:59:53,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2025-04-13 20:59:53,993 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:53,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 255 transitions, 5221 flow. Second operand has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:53,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:53,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:53,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:54,611 INFO L116 PetriNetUnfolderBase]: 827/1621 cut-off events. [2025-04-13 20:59:54,611 INFO L117 PetriNetUnfolderBase]: For 24642/24642 co-relation queries the response was YES. [2025-04-13 20:59:54,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11301 conditions, 1621 events. 827/1621 cut-off events. For 24642/24642 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 9984 event pairs, 18 based on Foata normal form. 4/1625 useless extension candidates. Maximal degree in co-relation 11244. Up to 416 conditions per place. [2025-04-13 20:59:54,620 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 63 selfloop transitions, 182 changer transitions 59/304 dead transitions. [2025-04-13 20:59:54,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 304 transitions, 6113 flow [2025-04-13 20:59:54,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 20:59:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 20:59:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 158 transitions. [2025-04-13 20:59:54,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30095238095238097 [2025-04-13 20:59:54,622 INFO L175 Difference]: Start difference. First operand has 193 places, 255 transitions, 5221 flow. Second operand 25 states and 158 transitions. [2025-04-13 20:59:54,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 304 transitions, 6113 flow [2025-04-13 20:59:54,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 304 transitions, 5539 flow, removed 11 selfloop flow, removed 17 redundant places. [2025-04-13 20:59:54,699 INFO L231 Difference]: Finished difference. Result has 182 places, 221 transitions, 4362 flow [2025-04-13 20:59:54,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4671, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4362, PETRI_PLACES=182, PETRI_TRANSITIONS=221} [2025-04-13 20:59:54,700 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 159 predicate places. [2025-04-13 20:59:54,700 INFO L485 AbstractCegarLoop]: Abstraction has has 182 places, 221 transitions, 4362 flow [2025-04-13 20:59:54,700 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.6) internal successors, (72), 20 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:54,700 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:54,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:54,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:54,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:54,900 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:54,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:54,901 INFO L85 PathProgramCache]: Analyzing trace with hash 670564550, now seen corresponding path program 13 times [2025-04-13 20:59:54,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:54,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169771782] [2025-04-13 20:59:54,901 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:54,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:54,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:54,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:54,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:54,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:54,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:54,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169771782] [2025-04-13 20:59:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169771782] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:54,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87102907] [2025-04-13 20:59:54,975 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:59:54,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:54,977 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:54,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:59:54,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 20:59:55,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:55,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:59:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:55,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:55,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:55,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87102907] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:55,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 20:59:55,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203888415] [2025-04-13 20:59:55,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:55,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:59:55,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:59:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:59:55,184 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:55,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 221 transitions, 4362 flow. Second operand has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:55,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:55,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:55,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:55,797 INFO L116 PetriNetUnfolderBase]: 1048/2091 cut-off events. [2025-04-13 20:59:55,798 INFO L117 PetriNetUnfolderBase]: For 26443/26443 co-relation queries the response was YES. [2025-04-13 20:59:55,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13401 conditions, 2091 events. 1048/2091 cut-off events. For 26443/26443 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 13934 event pairs, 37 based on Foata normal form. 18/2109 useless extension candidates. Maximal degree in co-relation 13351. Up to 490 conditions per place. [2025-04-13 20:59:55,811 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 102 selfloop transitions, 236 changer transitions 39/377 dead transitions. [2025-04-13 20:59:55,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 377 transitions, 7133 flow [2025-04-13 20:59:55,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 20:59:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-13 20:59:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 205 transitions. [2025-04-13 20:59:55,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3366174055829228 [2025-04-13 20:59:55,812 INFO L175 Difference]: Start difference. First operand has 182 places, 221 transitions, 4362 flow. Second operand 29 states and 205 transitions. [2025-04-13 20:59:55,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 377 transitions, 7133 flow [2025-04-13 20:59:55,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 377 transitions, 6526 flow, removed 13 selfloop flow, removed 21 redundant places. [2025-04-13 20:59:55,899 INFO L231 Difference]: Finished difference. Result has 189 places, 289 transitions, 5828 flow [2025-04-13 20:59:55,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3808, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5828, PETRI_PLACES=189, PETRI_TRANSITIONS=289} [2025-04-13 20:59:55,900 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 166 predicate places. [2025-04-13 20:59:55,900 INFO L485 AbstractCegarLoop]: Abstraction has has 189 places, 289 transitions, 5828 flow [2025-04-13 20:59:55,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 21 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:55,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:55,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:55,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:59:56,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:56,101 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:56,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:56,101 INFO L85 PathProgramCache]: Analyzing trace with hash -783059010, now seen corresponding path program 14 times [2025-04-13 20:59:56,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:56,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236345700] [2025-04-13 20:59:56,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:56,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:56,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:56,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:56,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:56,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:56,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236345700] [2025-04-13 20:59:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236345700] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:56,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624277878] [2025-04-13 20:59:56,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:59:56,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:56,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:56,197 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:56,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:59:56,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:56,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:56,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:56,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:56,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:56,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:56,326 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:56,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624277878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:56,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 20:59:56,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539172124] [2025-04-13 20:59:56,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:56,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 20:59:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:56,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 20:59:56,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-04-13 20:59:56,463 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:56,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 289 transitions, 5828 flow. Second operand has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:56,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:56,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:56,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:56,930 INFO L116 PetriNetUnfolderBase]: 1023/2063 cut-off events. [2025-04-13 20:59:56,931 INFO L117 PetriNetUnfolderBase]: For 26346/26346 co-relation queries the response was YES. [2025-04-13 20:59:56,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13480 conditions, 2063 events. 1023/2063 cut-off events. For 26346/26346 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 13839 event pairs, 40 based on Foata normal form. 5/2068 useless extension candidates. Maximal degree in co-relation 13423. Up to 549 conditions per place. [2025-04-13 20:59:56,943 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 82 selfloop transitions, 196 changer transitions 62/340 dead transitions. [2025-04-13 20:59:56,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 340 transitions, 6869 flow [2025-04-13 20:59:56,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 20:59:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 20:59:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 147 transitions. [2025-04-13 20:59:56,944 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-04-13 20:59:56,944 INFO L175 Difference]: Start difference. First operand has 189 places, 289 transitions, 5828 flow. Second operand 20 states and 147 transitions. [2025-04-13 20:59:56,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 340 transitions, 6869 flow [2025-04-13 20:59:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 340 transitions, 6627 flow, removed 86 selfloop flow, removed 12 redundant places. [2025-04-13 20:59:57,036 INFO L231 Difference]: Finished difference. Result has 191 places, 239 transitions, 4947 flow [2025-04-13 20:59:57,037 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5594, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4947, PETRI_PLACES=191, PETRI_TRANSITIONS=239} [2025-04-13 20:59:57,037 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 168 predicate places. [2025-04-13 20:59:57,037 INFO L485 AbstractCegarLoop]: Abstraction has has 191 places, 239 transitions, 4947 flow [2025-04-13 20:59:57,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4761904761904763) internal successors, (73), 21 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:57,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:57,037 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:57,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 20:59:57,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 20:59:57,239 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:57,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1629937590, now seen corresponding path program 15 times [2025-04-13 20:59:57,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:57,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052282815] [2025-04-13 20:59:57,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:57,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:57,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:57,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:57,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:57,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:57,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052282815] [2025-04-13 20:59:57,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052282815] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:57,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354114802] [2025-04-13 20:59:57,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:59:57,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:57,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:57,317 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:57,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:59:57,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:57,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:57,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:59:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:57,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:57,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:57,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:57,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:57,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354114802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:57,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:57,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 20:59:57,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101369043] [2025-04-13 20:59:57,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:57,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 20:59:57,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:57,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 20:59:57,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2025-04-13 20:59:57,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:57,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 239 transitions, 4947 flow. Second operand has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:57,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:57,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:57,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:58,156 INFO L116 PetriNetUnfolderBase]: 1042/2224 cut-off events. [2025-04-13 20:59:58,156 INFO L117 PetriNetUnfolderBase]: For 27210/27210 co-relation queries the response was YES. [2025-04-13 20:59:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13511 conditions, 2224 events. 1042/2224 cut-off events. For 27210/27210 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 15848 event pairs, 170 based on Foata normal form. 5/2229 useless extension candidates. Maximal degree in co-relation 13458. Up to 816 conditions per place. [2025-04-13 20:59:58,168 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 130 selfloop transitions, 168 changer transitions 30/328 dead transitions. [2025-04-13 20:59:58,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 328 transitions, 6743 flow [2025-04-13 20:59:58,168 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 20:59:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-04-13 20:59:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 159 transitions. [2025-04-13 20:59:58,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2025-04-13 20:59:58,169 INFO L175 Difference]: Start difference. First operand has 191 places, 239 transitions, 4947 flow. Second operand 24 states and 159 transitions. [2025-04-13 20:59:58,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 328 transitions, 6743 flow [2025-04-13 20:59:58,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 328 transitions, 6381 flow, removed 7 selfloop flow, removed 16 redundant places. [2025-04-13 20:59:58,241 INFO L231 Difference]: Finished difference. Result has 199 places, 243 transitions, 5195 flow [2025-04-13 20:59:58,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4640, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=5195, PETRI_PLACES=199, PETRI_TRANSITIONS=243} [2025-04-13 20:59:58,242 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 176 predicate places. [2025-04-13 20:59:58,242 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 243 transitions, 5195 flow [2025-04-13 20:59:58,242 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.4583333333333335) internal successors, (83), 24 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:58,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:58,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:58,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:59:58,443 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 20:59:58,443 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:58,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2014432088, now seen corresponding path program 16 times [2025-04-13 20:59:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:58,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639530101] [2025-04-13 20:59:58,444 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:58,445 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:58,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:58,447 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:58,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:58,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639530101] [2025-04-13 20:59:58,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639530101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:58,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784513852] [2025-04-13 20:59:58,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:59:58,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:58,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:58,544 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:58,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:59:58,565 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:58,572 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:58,573 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:59:58,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:58,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 20:59:58,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:58,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:59:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:58,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784513852] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:59:58,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:59:58,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 20:59:58,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437672233] [2025-04-13 20:59:58,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:59:58,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 20:59:58,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:58,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 20:59:58,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-04-13 20:59:58,780 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:58,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 243 transitions, 5195 flow. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:58,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:58,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:58,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:59,180 INFO L116 PetriNetUnfolderBase]: 1000/2119 cut-off events. [2025-04-13 20:59:59,180 INFO L117 PetriNetUnfolderBase]: For 26929/26929 co-relation queries the response was YES. [2025-04-13 20:59:59,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13230 conditions, 2119 events. 1000/2119 cut-off events. For 26929/26929 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 14753 event pairs, 56 based on Foata normal form. 5/2124 useless extension candidates. Maximal degree in co-relation 13174. Up to 792 conditions per place. [2025-04-13 20:59:59,192 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 114 selfloop transitions, 175 changer transitions 26/315 dead transitions. [2025-04-13 20:59:59,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 315 transitions, 6933 flow [2025-04-13 20:59:59,192 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 20:59:59,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 20:59:59,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 111 transitions. [2025-04-13 20:59:59,193 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33035714285714285 [2025-04-13 20:59:59,193 INFO L175 Difference]: Start difference. First operand has 199 places, 243 transitions, 5195 flow. Second operand 16 states and 111 transitions. [2025-04-13 20:59:59,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 315 transitions, 6933 flow [2025-04-13 20:59:59,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 315 transitions, 6681 flow, removed 33 selfloop flow, removed 20 redundant places. [2025-04-13 20:59:59,271 INFO L231 Difference]: Finished difference. Result has 192 places, 263 transitions, 5991 flow [2025-04-13 20:59:59,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4972, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5991, PETRI_PLACES=192, PETRI_TRANSITIONS=263} [2025-04-13 20:59:59,271 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 169 predicate places. [2025-04-13 20:59:59,271 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 263 transitions, 5991 flow [2025-04-13 20:59:59,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:59,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:59,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:59,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 20:59:59,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:59,472 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 20:59:59,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:59:59,473 INFO L85 PathProgramCache]: Analyzing trace with hash 536310560, now seen corresponding path program 17 times [2025-04-13 20:59:59,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:59:59,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162205620] [2025-04-13 20:59:59,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:59,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:59:59,474 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:59,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:59,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:59,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:59:59,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162205620] [2025-04-13 20:59:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162205620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:59:59,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361361483] [2025-04-13 20:59:59,531 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:59:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:59:59,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:59:59,533 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:59:59,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:59:59,553 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 20:59:59,560 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 20:59:59,560 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:59:59,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:59:59,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 20:59:59,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:59:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:59:59,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:59:59,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361361483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:59:59,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:59:59,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 20:59:59,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804007551] [2025-04-13 20:59:59,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:59:59,616 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 20:59:59,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:59:59,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 20:59:59,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-04-13 20:59:59,625 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 20:59:59,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 263 transitions, 5991 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:59,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:59:59,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 20:59:59,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:59:59,835 INFO L116 PetriNetUnfolderBase]: 924/1942 cut-off events. [2025-04-13 20:59:59,835 INFO L117 PetriNetUnfolderBase]: For 27559/27559 co-relation queries the response was YES. [2025-04-13 20:59:59,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12893 conditions, 1942 events. 924/1942 cut-off events. For 27559/27559 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13096 event pairs, 230 based on Foata normal form. 3/1945 useless extension candidates. Maximal degree in co-relation 12836. Up to 1262 conditions per place. [2025-04-13 20:59:59,846 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 144 selfloop transitions, 124 changer transitions 15/283 dead transitions. [2025-04-13 20:59:59,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 283 transitions, 6682 flow [2025-04-13 20:59:59,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:59:59,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:59:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 72 transitions. [2025-04-13 20:59:59,847 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-04-13 20:59:59,847 INFO L175 Difference]: Start difference. First operand has 192 places, 263 transitions, 5991 flow. Second operand 9 states and 72 transitions. [2025-04-13 20:59:59,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 283 transitions, 6682 flow [2025-04-13 20:59:59,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 283 transitions, 6194 flow, removed 34 selfloop flow, removed 11 redundant places. [2025-04-13 20:59:59,926 INFO L231 Difference]: Finished difference. Result has 188 places, 255 transitions, 5596 flow [2025-04-13 20:59:59,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5507, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5596, PETRI_PLACES=188, PETRI_TRANSITIONS=255} [2025-04-13 20:59:59,927 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 165 predicate places. [2025-04-13 20:59:59,927 INFO L485 AbstractCegarLoop]: Abstraction has has 188 places, 255 transitions, 5596 flow [2025-04-13 20:59:59,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:59:59,927 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:59:59,927 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:59:59,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:00,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:00,127 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:00,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 547094546, now seen corresponding path program 18 times [2025-04-13 21:00:00,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:00,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861649599] [2025-04-13 21:00:00,128 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:00,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:00,130 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:00,131 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:00,131 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:00,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:00,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861649599] [2025-04-13 21:00:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861649599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:00,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139552819] [2025-04-13 21:00:00,195 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:00,197 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:00,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 21:00:00,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:00,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:00,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:00,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:00,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:00,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:00,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139552819] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:00,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:00,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 21:00:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815323176] [2025-04-13 21:00:00,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:00,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:00:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:00,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:00:00,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:00:00,412 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:00,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 255 transitions, 5596 flow. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:00,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:00,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:00,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:00,832 INFO L116 PetriNetUnfolderBase]: 1148/2440 cut-off events. [2025-04-13 21:00:00,833 INFO L117 PetriNetUnfolderBase]: For 31290/31290 co-relation queries the response was YES. [2025-04-13 21:00:00,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15578 conditions, 2440 events. 1148/2440 cut-off events. For 31290/31290 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 17564 event pairs, 214 based on Foata normal form. 2/2442 useless extension candidates. Maximal degree in co-relation 15521. Up to 1202 conditions per place. [2025-04-13 21:00:00,845 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 176 selfloop transitions, 168 changer transitions 12/356 dead transitions. [2025-04-13 21:00:00,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 356 transitions, 8173 flow [2025-04-13 21:00:00,846 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2025-04-13 21:00:00,846 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-13 21:00:00,846 INFO L175 Difference]: Start difference. First operand has 188 places, 255 transitions, 5596 flow. Second operand 14 states and 105 transitions. [2025-04-13 21:00:00,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 356 transitions, 8173 flow [2025-04-13 21:00:00,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 356 transitions, 7600 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-04-13 21:00:00,928 INFO L231 Difference]: Finished difference. Result has 192 places, 301 transitions, 6776 flow [2025-04-13 21:00:00,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=5159, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6776, PETRI_PLACES=192, PETRI_TRANSITIONS=301} [2025-04-13 21:00:00,928 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 169 predicate places. [2025-04-13 21:00:00,928 INFO L485 AbstractCegarLoop]: Abstraction has has 192 places, 301 transitions, 6776 flow [2025-04-13 21:00:00,928 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:00,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:00,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:00,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 21:00:01,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 21:00:01,129 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:01,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:01,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1124055882, now seen corresponding path program 19 times [2025-04-13 21:00:01,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:01,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611751478] [2025-04-13 21:00:01,130 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:01,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:01,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:00:01,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:01,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:01,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:01,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611751478] [2025-04-13 21:00:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611751478] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:01,189 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457109458] [2025-04-13 21:00:01,189 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:01,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:01,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:01,191 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:01,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 21:00:01,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:00:01,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:01,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:01,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:01,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:01,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:01,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:01,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:01,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457109458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:01,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 21:00:01,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415120975] [2025-04-13 21:00:01,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:01,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:00:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:01,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:00:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:00:01,407 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:01,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 301 transitions, 6776 flow. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:01,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:01,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:01,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:01,839 INFO L116 PetriNetUnfolderBase]: 1129/2399 cut-off events. [2025-04-13 21:00:01,839 INFO L117 PetriNetUnfolderBase]: For 30425/30425 co-relation queries the response was YES. [2025-04-13 21:00:01,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15134 conditions, 2399 events. 1129/2399 cut-off events. For 30425/30425 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 17186 event pairs, 265 based on Foata normal form. 2/2401 useless extension candidates. Maximal degree in co-relation 15076. Up to 1482 conditions per place. [2025-04-13 21:00:01,852 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 168 selfloop transitions, 167 changer transitions 14/349 dead transitions. [2025-04-13 21:00:01,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 349 transitions, 7988 flow [2025-04-13 21:00:01,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 105 transitions. [2025-04-13 21:00:01,853 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-13 21:00:01,853 INFO L175 Difference]: Start difference. First operand has 192 places, 301 transitions, 6776 flow. Second operand 14 states and 105 transitions. [2025-04-13 21:00:01,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 349 transitions, 7988 flow [2025-04-13 21:00:01,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 349 transitions, 7929 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-13 21:00:01,953 INFO L231 Difference]: Finished difference. Result has 200 places, 301 transitions, 7116 flow [2025-04-13 21:00:01,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6719, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7116, PETRI_PLACES=200, PETRI_TRANSITIONS=301} [2025-04-13 21:00:01,953 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 177 predicate places. [2025-04-13 21:00:01,953 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 301 transitions, 7116 flow [2025-04-13 21:00:01,953 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:01,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:01,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:01,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 21:00:02,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 21:00:02,154 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:02,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:02,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1344904980, now seen corresponding path program 20 times [2025-04-13 21:00:02,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:02,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5366410] [2025-04-13 21:00:02,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:02,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:02,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:02,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:02,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:02,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:02,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5366410] [2025-04-13 21:00:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5366410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:02,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763460010] [2025-04-13 21:00:02,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:02,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:02,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:02,224 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:02,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 21:00:02,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:02,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:02,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:02,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:02,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:02,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:02,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:02,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763460010] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:02,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:02,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 21:00:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6524808] [2025-04-13 21:00:02,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:02,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:00:02,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:02,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:00:02,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:00:02,455 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:02,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 301 transitions, 7116 flow. Second operand has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:02,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:02,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:02,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:03,087 INFO L116 PetriNetUnfolderBase]: 1176/2499 cut-off events. [2025-04-13 21:00:03,087 INFO L117 PetriNetUnfolderBase]: For 33673/33673 co-relation queries the response was YES. [2025-04-13 21:00:03,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16233 conditions, 2499 events. 1176/2499 cut-off events. For 33673/33673 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 18046 event pairs, 274 based on Foata normal form. 7/2506 useless extension candidates. Maximal degree in co-relation 16172. Up to 1561 conditions per place. [2025-04-13 21:00:03,102 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 176 selfloop transitions, 164 changer transitions 40/380 dead transitions. [2025-04-13 21:00:03,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 380 transitions, 8778 flow [2025-04-13 21:00:03,103 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 21:00:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-04-13 21:00:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 156 transitions. [2025-04-13 21:00:03,103 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32298136645962733 [2025-04-13 21:00:03,103 INFO L175 Difference]: Start difference. First operand has 200 places, 301 transitions, 7116 flow. Second operand 23 states and 156 transitions. [2025-04-13 21:00:03,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 380 transitions, 8778 flow [2025-04-13 21:00:03,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 380 transitions, 8443 flow, removed 33 selfloop flow, removed 9 redundant places. [2025-04-13 21:00:03,221 INFO L231 Difference]: Finished difference. Result has 222 places, 310 transitions, 7332 flow [2025-04-13 21:00:03,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6797, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7332, PETRI_PLACES=222, PETRI_TRANSITIONS=310} [2025-04-13 21:00:03,221 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 199 predicate places. [2025-04-13 21:00:03,222 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 310 transitions, 7332 flow [2025-04-13 21:00:03,222 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.5) internal successors, (77), 22 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:03,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:03,222 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:03,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 21:00:03,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 21:00:03,422 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:03,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:03,423 INFO L85 PathProgramCache]: Analyzing trace with hash 828024850, now seen corresponding path program 21 times [2025-04-13 21:00:03,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:03,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376693632] [2025-04-13 21:00:03,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:03,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:03,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:03,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:03,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:03,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:03,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:03,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376693632] [2025-04-13 21:00:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376693632] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:03,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822638837] [2025-04-13 21:00:03,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:03,513 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:03,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 21:00:03,534 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:03,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:03,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:03,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:03,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:03,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:03,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:03,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822638837] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:03,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 21:00:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133732950] [2025-04-13 21:00:03,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:03,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 21:00:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:03,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 21:00:03,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2025-04-13 21:00:03,727 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:03,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 310 transitions, 7332 flow. Second operand has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:03,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:03,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:03,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:04,205 INFO L116 PetriNetUnfolderBase]: 1108/2344 cut-off events. [2025-04-13 21:00:04,205 INFO L117 PetriNetUnfolderBase]: For 33376/33376 co-relation queries the response was YES. [2025-04-13 21:00:04,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15531 conditions, 2344 events. 1108/2344 cut-off events. For 33376/33376 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16651 event pairs, 237 based on Foata normal form. 8/2352 useless extension candidates. Maximal degree in co-relation 15461. Up to 1330 conditions per place. [2025-04-13 21:00:04,219 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 171 selfloop transitions, 139 changer transitions 41/351 dead transitions. [2025-04-13 21:00:04,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 351 transitions, 8487 flow [2025-04-13 21:00:04,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 99 transitions. [2025-04-13 21:00:04,220 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.336734693877551 [2025-04-13 21:00:04,220 INFO L175 Difference]: Start difference. First operand has 222 places, 310 transitions, 7332 flow. Second operand 14 states and 99 transitions. [2025-04-13 21:00:04,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 351 transitions, 8487 flow [2025-04-13 21:00:04,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 351 transitions, 8313 flow, removed 32 selfloop flow, removed 12 redundant places. [2025-04-13 21:00:04,354 INFO L231 Difference]: Finished difference. Result has 217 places, 281 transitions, 6660 flow [2025-04-13 21:00:04,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=7164, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6660, PETRI_PLACES=217, PETRI_TRANSITIONS=281} [2025-04-13 21:00:04,354 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 194 predicate places. [2025-04-13 21:00:04,354 INFO L485 AbstractCegarLoop]: Abstraction has has 217 places, 281 transitions, 6660 flow [2025-04-13 21:00:04,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.4545454545454546) internal successors, (76), 22 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:04,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:04,355 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:04,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 21:00:04,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:04,559 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:04,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:04,559 INFO L85 PathProgramCache]: Analyzing trace with hash 240279528, now seen corresponding path program 22 times [2025-04-13 21:00:04,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:04,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259572642] [2025-04-13 21:00:04,560 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:04,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:04,561 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:04,562 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:04,562 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:04,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:04,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259572642] [2025-04-13 21:00:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259572642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:04,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508830751] [2025-04-13 21:00:04,624 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:04,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:04,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:04,625 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:04,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 21:00:04,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:04,651 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:04,651 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:04,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:04,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:04,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:04,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:04,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508830751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:04,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 21:00:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873238799] [2025-04-13 21:00:04,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:04,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:00:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:04,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:00:04,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:00:04,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:04,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 281 transitions, 6660 flow. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:04,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:04,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:04,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:05,730 INFO L116 PetriNetUnfolderBase]: 1384/2896 cut-off events. [2025-04-13 21:00:05,731 INFO L117 PetriNetUnfolderBase]: For 43408/43408 co-relation queries the response was YES. [2025-04-13 21:00:05,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19088 conditions, 2896 events. 1384/2896 cut-off events. For 43408/43408 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 21278 event pairs, 182 based on Foata normal form. 26/2922 useless extension candidates. Maximal degree in co-relation 19024. Up to 892 conditions per place. [2025-04-13 21:00:05,749 INFO L140 encePairwiseOnDemand]: 10/21 looper letters, 146 selfloop transitions, 257 changer transitions 76/479 dead transitions. [2025-04-13 21:00:05,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 479 transitions, 11382 flow [2025-04-13 21:00:05,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 21:00:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 21:00:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 208 transitions. [2025-04-13 21:00:05,750 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3195084485407066 [2025-04-13 21:00:05,750 INFO L175 Difference]: Start difference. First operand has 217 places, 281 transitions, 6660 flow. Second operand 31 states and 208 transitions. [2025-04-13 21:00:05,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 479 transitions, 11382 flow [2025-04-13 21:00:05,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 479 transitions, 10805 flow, removed 5 selfloop flow, removed 17 redundant places. [2025-04-13 21:00:05,879 INFO L231 Difference]: Finished difference. Result has 239 places, 348 transitions, 8705 flow [2025-04-13 21:00:05,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=6211, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=8705, PETRI_PLACES=239, PETRI_TRANSITIONS=348} [2025-04-13 21:00:05,880 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 216 predicate places. [2025-04-13 21:00:05,880 INFO L485 AbstractCegarLoop]: Abstraction has has 239 places, 348 transitions, 8705 flow [2025-04-13 21:00:05,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:05,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:05,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:05,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 21:00:06,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:06,081 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:06,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 213520458, now seen corresponding path program 23 times [2025-04-13 21:00:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:06,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382853379] [2025-04-13 21:00:06,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:06,084 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:06,085 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:06,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:06,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382853379] [2025-04-13 21:00:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382853379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:06,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705930616] [2025-04-13 21:00:06,131 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:06,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:06,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:06,133 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:06,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 21:00:06,153 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:06,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:06,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:06,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:06,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:00:06,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:06,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:06,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:00:06,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705930616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:06,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:00:06,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 21:00:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807242900] [2025-04-13 21:00:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:06,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:00:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:00:06,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:00:06,216 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:06,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 348 transitions, 8705 flow. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:06,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:06,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:06,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:06,532 INFO L116 PetriNetUnfolderBase]: 1188/2449 cut-off events. [2025-04-13 21:00:06,533 INFO L117 PetriNetUnfolderBase]: For 39932/39932 co-relation queries the response was YES. [2025-04-13 21:00:06,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17345 conditions, 2449 events. 1188/2449 cut-off events. For 39932/39932 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16875 event pairs, 145 based on Foata normal form. 15/2464 useless extension candidates. Maximal degree in co-relation 17268. Up to 931 conditions per place. [2025-04-13 21:00:06,546 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 164 selfloop transitions, 82 changer transitions 122/368 dead transitions. [2025-04-13 21:00:06,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 368 transitions, 9630 flow [2025-04-13 21:00:06,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:00:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:00:06,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2025-04-13 21:00:06,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-13 21:00:06,546 INFO L175 Difference]: Start difference. First operand has 239 places, 348 transitions, 8705 flow. Second operand 9 states and 70 transitions. [2025-04-13 21:00:06,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 368 transitions, 9630 flow [2025-04-13 21:00:06,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 368 transitions, 9281 flow, removed 108 selfloop flow, removed 9 redundant places. [2025-04-13 21:00:06,691 INFO L231 Difference]: Finished difference. Result has 231 places, 234 transitions, 5406 flow [2025-04-13 21:00:06,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=8356, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5406, PETRI_PLACES=231, PETRI_TRANSITIONS=234} [2025-04-13 21:00:06,691 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 208 predicate places. [2025-04-13 21:00:06,692 INFO L485 AbstractCegarLoop]: Abstraction has has 231 places, 234 transitions, 5406 flow [2025-04-13 21:00:06,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:06,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:06,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:06,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 21:00:06,892 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:06,892 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:06,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -747568322, now seen corresponding path program 24 times [2025-04-13 21:00:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:06,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699503256] [2025-04-13 21:00:06,893 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:06,894 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:06,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:06,896 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:06,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:06,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:06,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699503256] [2025-04-13 21:00:06,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699503256] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:06,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189069519] [2025-04-13 21:00:06,951 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:06,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:06,953 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:06,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 21:00:06,973 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:06,981 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:06,981 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:06,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:06,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:06,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:07,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:07,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189069519] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:07,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 21:00:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882190578] [2025-04-13 21:00:07,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:07,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:00:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:07,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:00:07,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:00:07,187 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:07,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 234 transitions, 5406 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:07,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:07,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:07,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:07,523 INFO L116 PetriNetUnfolderBase]: 813/1767 cut-off events. [2025-04-13 21:00:07,523 INFO L117 PetriNetUnfolderBase]: For 27918/27918 co-relation queries the response was YES. [2025-04-13 21:00:07,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11710 conditions, 1767 events. 813/1767 cut-off events. For 27918/27918 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11818 event pairs, 192 based on Foata normal form. 2/1769 useless extension candidates. Maximal degree in co-relation 11636. Up to 1013 conditions per place. [2025-04-13 21:00:07,534 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 193 selfloop transitions, 65 changer transitions 14/272 dead transitions. [2025-04-13 21:00:07,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 272 transitions, 6429 flow [2025-04-13 21:00:07,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:00:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 21:00:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2025-04-13 21:00:07,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 21:00:07,535 INFO L175 Difference]: Start difference. First operand has 231 places, 234 transitions, 5406 flow. Second operand 12 states and 84 transitions. [2025-04-13 21:00:07,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 272 transitions, 6429 flow [2025-04-13 21:00:07,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 272 transitions, 5751 flow, removed 40 selfloop flow, removed 29 redundant places. [2025-04-13 21:00:07,613 INFO L231 Difference]: Finished difference. Result has 203 places, 238 transitions, 5006 flow [2025-04-13 21:00:07,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4773, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5006, PETRI_PLACES=203, PETRI_TRANSITIONS=238} [2025-04-13 21:00:07,614 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 180 predicate places. [2025-04-13 21:00:07,614 INFO L485 AbstractCegarLoop]: Abstraction has has 203 places, 238 transitions, 5006 flow [2025-04-13 21:00:07,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:07,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:07,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:07,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 21:00:07,814 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2025-04-13 21:00:07,814 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:07,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:07,815 INFO L85 PathProgramCache]: Analyzing trace with hash -720809252, now seen corresponding path program 25 times [2025-04-13 21:00:07,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:07,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289971082] [2025-04-13 21:00:07,815 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:07,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:00:07,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:07,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:07,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:07,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:07,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289971082] [2025-04-13 21:00:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289971082] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:07,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755322952] [2025-04-13 21:00:07,876 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:07,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:07,878 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:07,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 21:00:07,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 21:00:07,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:07,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:07,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:07,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:07,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:07,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:08,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755322952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:08,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:08,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 21:00:08,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304887983] [2025-04-13 21:00:08,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:08,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:00:08,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:08,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:00:08,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:00:08,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:08,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 238 transitions, 5006 flow. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:08,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:08,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:08,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:08,424 INFO L116 PetriNetUnfolderBase]: 783/1697 cut-off events. [2025-04-13 21:00:08,424 INFO L117 PetriNetUnfolderBase]: For 22627/22627 co-relation queries the response was YES. [2025-04-13 21:00:08,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10598 conditions, 1697 events. 783/1697 cut-off events. For 22627/22627 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11161 event pairs, 192 based on Foata normal form. 2/1699 useless extension candidates. Maximal degree in co-relation 10534. Up to 1013 conditions per place. [2025-04-13 21:00:08,433 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 182 selfloop transitions, 59 changer transitions 21/262 dead transitions. [2025-04-13 21:00:08,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 262 transitions, 5740 flow [2025-04-13 21:00:08,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:00:08,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 21:00:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 78 transitions. [2025-04-13 21:00:08,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2025-04-13 21:00:08,434 INFO L175 Difference]: Start difference. First operand has 203 places, 238 transitions, 5006 flow. Second operand 12 states and 78 transitions. [2025-04-13 21:00:08,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 262 transitions, 5740 flow [2025-04-13 21:00:08,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 262 transitions, 5687 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-04-13 21:00:08,495 INFO L231 Difference]: Finished difference. Result has 207 places, 232 transitions, 4965 flow [2025-04-13 21:00:08,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4953, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4965, PETRI_PLACES=207, PETRI_TRANSITIONS=232} [2025-04-13 21:00:08,496 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 184 predicate places. [2025-04-13 21:00:08,496 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 4965 flow [2025-04-13 21:00:08,496 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:08,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:08,496 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:08,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 21:00:08,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:08,697 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:08,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:08,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1760260854, now seen corresponding path program 26 times [2025-04-13 21:00:08,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:08,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329217794] [2025-04-13 21:00:08,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:08,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:08,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:08,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:08,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:08,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:08,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:08,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329217794] [2025-04-13 21:00:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329217794] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:08,764 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392060200] [2025-04-13 21:00:08,764 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:08,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:08,766 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:08,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 21:00:08,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:08,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:08,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:08,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:08,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:08,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:08,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:08,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392060200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:08,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:08,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 21:00:08,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555370988] [2025-04-13 21:00:08,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:08,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:00:08,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:08,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:00:08,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:00:08,984 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:08,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 4965 flow. Second operand has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:08,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:08,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:08,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:09,334 INFO L116 PetriNetUnfolderBase]: 759/1639 cut-off events. [2025-04-13 21:00:09,335 INFO L117 PetriNetUnfolderBase]: For 22419/22419 co-relation queries the response was YES. [2025-04-13 21:00:09,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10292 conditions, 1639 events. 759/1639 cut-off events. For 22419/22419 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10674 event pairs, 24 based on Foata normal form. 6/1645 useless extension candidates. Maximal degree in co-relation 10227. Up to 440 conditions per place. [2025-04-13 21:00:09,344 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 117 selfloop transitions, 119 changer transitions 27/263 dead transitions. [2025-04-13 21:00:09,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 263 transitions, 5730 flow [2025-04-13 21:00:09,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 95 transitions. [2025-04-13 21:00:09,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3231292517006803 [2025-04-13 21:00:09,345 INFO L175 Difference]: Start difference. First operand has 207 places, 232 transitions, 4965 flow. Second operand 14 states and 95 transitions. [2025-04-13 21:00:09,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 263 transitions, 5730 flow [2025-04-13 21:00:09,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 263 transitions, 5501 flow, removed 6 selfloop flow, removed 12 redundant places. [2025-04-13 21:00:09,402 INFO L231 Difference]: Finished difference. Result has 202 places, 216 transitions, 4621 flow [2025-04-13 21:00:09,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4738, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4621, PETRI_PLACES=202, PETRI_TRANSITIONS=216} [2025-04-13 21:00:09,403 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 179 predicate places. [2025-04-13 21:00:09,403 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 216 transitions, 4621 flow [2025-04-13 21:00:09,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4782608695652173) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:09,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:09,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:09,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 21:00:09,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:09,603 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:09,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1733501784, now seen corresponding path program 27 times [2025-04-13 21:00:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:09,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852579073] [2025-04-13 21:00:09,604 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:09,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:09,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:09,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:09,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:09,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:09,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852579073] [2025-04-13 21:00:09,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852579073] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:09,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103439002] [2025-04-13 21:00:09,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:09,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:09,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:09,668 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:09,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 21:00:09,688 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-04-13 21:00:09,694 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 21:00:09,694 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:09,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:09,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 21:00:09,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:09,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103439002] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:09,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:09,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 21:00:09,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470772233] [2025-04-13 21:00:09,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:09,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 21:00:09,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:09,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 21:00:09,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2025-04-13 21:00:09,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:09,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 216 transitions, 4621 flow. Second operand has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:09,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:09,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:09,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:10,221 INFO L116 PetriNetUnfolderBase]: 660/1413 cut-off events. [2025-04-13 21:00:10,221 INFO L117 PetriNetUnfolderBase]: For 21284/21284 co-relation queries the response was YES. [2025-04-13 21:00:10,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9282 conditions, 1413 events. 660/1413 cut-off events. For 21284/21284 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8758 event pairs, 24 based on Foata normal form. 7/1420 useless extension candidates. Maximal degree in co-relation 9219. Up to 440 conditions per place. [2025-04-13 21:00:10,229 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 95 selfloop transitions, 79 changer transitions 68/242 dead transitions. [2025-04-13 21:00:10,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 242 transitions, 5282 flow [2025-04-13 21:00:10,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:00:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:00:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 94 transitions. [2025-04-13 21:00:10,230 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2984126984126984 [2025-04-13 21:00:10,230 INFO L175 Difference]: Start difference. First operand has 202 places, 216 transitions, 4621 flow. Second operand 15 states and 94 transitions. [2025-04-13 21:00:10,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 242 transitions, 5282 flow [2025-04-13 21:00:10,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 242 transitions, 4855 flow, removed 4 selfloop flow, removed 18 redundant places. [2025-04-13 21:00:10,283 INFO L231 Difference]: Finished difference. Result has 196 places, 161 transitions, 3193 flow [2025-04-13 21:00:10,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3193, PETRI_PLACES=196, PETRI_TRANSITIONS=161} [2025-04-13 21:00:10,283 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 173 predicate places. [2025-04-13 21:00:10,283 INFO L485 AbstractCegarLoop]: Abstraction has has 196 places, 161 transitions, 3193 flow [2025-04-13 21:00:10,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.4347826086956523) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:10,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:10,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:10,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 21:00:10,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2025-04-13 21:00:10,484 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:10,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:10,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1934108040, now seen corresponding path program 28 times [2025-04-13 21:00:10,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:10,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625907523] [2025-04-13 21:00:10,485 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:10,487 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:10,488 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:10,488 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:10,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:10,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:10,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625907523] [2025-04-13 21:00:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625907523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:10,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500530908] [2025-04-13 21:00:10,515 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:10,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:10,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:10,516 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:10,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 21:00:10,537 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:10,544 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:10,544 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:10,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:10,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:10,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:10,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:10,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:10,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500530908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:10,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 21:00:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140958084] [2025-04-13 21:00:10,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:10,593 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 21:00:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:10,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 21:00:10,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 21:00:10,614 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 21:00:10,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 161 transitions, 3193 flow. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:10,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:10,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 21:00:10,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:10,848 INFO L116 PetriNetUnfolderBase]: 425/988 cut-off events. [2025-04-13 21:00:10,848 INFO L117 PetriNetUnfolderBase]: For 15743/15743 co-relation queries the response was YES. [2025-04-13 21:00:10,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6297 conditions, 988 events. 425/988 cut-off events. For 15743/15743 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 6106 event pairs, 98 based on Foata normal form. 22/984 useless extension candidates. Maximal degree in co-relation 6237. Up to 343 conditions per place. [2025-04-13 21:00:10,854 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 102 selfloop transitions, 63 changer transitions 4/208 dead transitions. [2025-04-13 21:00:10,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 208 transitions, 3733 flow [2025-04-13 21:00:10,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:00:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:00:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2025-04-13 21:00:10,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 21:00:10,855 INFO L175 Difference]: Start difference. First operand has 196 places, 161 transitions, 3193 flow. Second operand 16 states and 140 transitions. [2025-04-13 21:00:10,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 208 transitions, 3733 flow [2025-04-13 21:00:10,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 208 transitions, 3222 flow, removed 74 selfloop flow, removed 21 redundant places. [2025-04-13 21:00:10,890 INFO L231 Difference]: Finished difference. Result has 175 places, 164 transitions, 2792 flow [2025-04-13 21:00:10,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2792, PETRI_PLACES=175, PETRI_TRANSITIONS=164} [2025-04-13 21:00:10,890 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 152 predicate places. [2025-04-13 21:00:10,890 INFO L485 AbstractCegarLoop]: Abstraction has has 175 places, 164 transitions, 2792 flow [2025-04-13 21:00:10,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:10,890 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:10,890 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:10,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 21:00:11,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 21:00:11,091 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:11,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:11,091 INFO L85 PathProgramCache]: Analyzing trace with hash 845159176, now seen corresponding path program 29 times [2025-04-13 21:00:11,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:11,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266999271] [2025-04-13 21:00:11,091 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:11,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:11,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 21:00:11,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:11,095 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:00:11,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:11,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266999271] [2025-04-13 21:00:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266999271] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:11,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229641779] [2025-04-13 21:00:11,119 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:11,121 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:11,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 21:00:11,142 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 3 equivalence classes. [2025-04-13 21:00:11,150 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:11,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:00:11,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:11,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:11,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:11,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:11,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229641779] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:11,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:11,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-04-13 21:00:11,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571460365] [2025-04-13 21:00:11,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:11,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 21:00:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:11,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 21:00:11,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:00:11,213 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 21:00:11,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 164 transitions, 2792 flow. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:11,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:11,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 21:00:11,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:11,372 INFO L116 PetriNetUnfolderBase]: 413/948 cut-off events. [2025-04-13 21:00:11,373 INFO L117 PetriNetUnfolderBase]: For 10609/10609 co-relation queries the response was YES. [2025-04-13 21:00:11,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5721 conditions, 948 events. 413/948 cut-off events. For 10609/10609 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5633 event pairs, 114 based on Foata normal form. 10/934 useless extension candidates. Maximal degree in co-relation 5668. Up to 387 conditions per place. [2025-04-13 21:00:11,378 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 110 selfloop transitions, 56 changer transitions 4/205 dead transitions. [2025-04-13 21:00:11,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 205 transitions, 3499 flow [2025-04-13 21:00:11,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:00:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 21:00:11,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 105 transitions. [2025-04-13 21:00:11,378 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2025-04-13 21:00:11,378 INFO L175 Difference]: Start difference. First operand has 175 places, 164 transitions, 2792 flow. Second operand 12 states and 105 transitions. [2025-04-13 21:00:11,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 205 transitions, 3499 flow [2025-04-13 21:00:11,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 205 transitions, 3170 flow, removed 110 selfloop flow, removed 7 redundant places. [2025-04-13 21:00:11,403 INFO L231 Difference]: Finished difference. Result has 180 places, 176 transitions, 2828 flow [2025-04-13 21:00:11,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2467, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2828, PETRI_PLACES=180, PETRI_TRANSITIONS=176} [2025-04-13 21:00:11,404 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 157 predicate places. [2025-04-13 21:00:11,404 INFO L485 AbstractCegarLoop]: Abstraction has has 180 places, 176 transitions, 2828 flow [2025-04-13 21:00:11,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:11,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:11,404 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:11,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:11,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 21:00:11,604 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:11,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2072503919, now seen corresponding path program 30 times [2025-04-13 21:00:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:11,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127265392] [2025-04-13 21:00:11,605 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:11,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:11,607 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:11,608 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:11,608 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:11,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:11,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127265392] [2025-04-13 21:00:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127265392] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:11,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414937621] [2025-04-13 21:00:11,629 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:11,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:11,631 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:11,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 21:00:11,651 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-04-13 21:00:11,657 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:00:11,657 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 21:00:11,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:11,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:00:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:11,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,666 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414937621] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:11,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:11,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-04-13 21:00:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147208076] [2025-04-13 21:00:11,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:11,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:00:11,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:11,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:00:11,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:00:11,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2025-04-13 21:00:11,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 176 transitions, 2828 flow. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:11,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:11,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2025-04-13 21:00:11,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:11,893 INFO L116 PetriNetUnfolderBase]: 450/1025 cut-off events. [2025-04-13 21:00:11,893 INFO L117 PetriNetUnfolderBase]: For 9907/9907 co-relation queries the response was YES. [2025-04-13 21:00:11,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6136 conditions, 1025 events. 450/1025 cut-off events. For 9907/9907 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6155 event pairs, 133 based on Foata normal form. 15/1012 useless extension candidates. Maximal degree in co-relation 6081. Up to 409 conditions per place. [2025-04-13 21:00:11,897 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 126 selfloop transitions, 52 changer transitions 8/221 dead transitions. [2025-04-13 21:00:11,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 221 transitions, 3666 flow [2025-04-13 21:00:11,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:00:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 21:00:11,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2025-04-13 21:00:11,898 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4246031746031746 [2025-04-13 21:00:11,898 INFO L175 Difference]: Start difference. First operand has 180 places, 176 transitions, 2828 flow. Second operand 12 states and 107 transitions. [2025-04-13 21:00:11,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 221 transitions, 3666 flow [2025-04-13 21:00:11,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 221 transitions, 3634 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:11,923 INFO L231 Difference]: Finished difference. Result has 193 places, 191 transitions, 3217 flow [2025-04-13 21:00:11,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=2801, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3217, PETRI_PLACES=193, PETRI_TRANSITIONS=191} [2025-04-13 21:00:11,923 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 170 predicate places. [2025-04-13 21:00:11,923 INFO L485 AbstractCegarLoop]: Abstraction has has 193 places, 191 transitions, 3217 flow [2025-04-13 21:00:11,923 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:11,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:11,923 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:11,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 21:00:12,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:12,124 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:12,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:12,124 INFO L85 PathProgramCache]: Analyzing trace with hash -360198487, now seen corresponding path program 31 times [2025-04-13 21:00:12,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:12,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128718811] [2025-04-13 21:00:12,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:12,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:12,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:00:12,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:12,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:12,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:12,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:12,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128718811] [2025-04-13 21:00:12,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128718811] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:12,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036020037] [2025-04-13 21:00:12,205 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:12,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:12,208 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:12,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 21:00:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:00:12,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:12,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:12,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:12,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:12,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:12,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:12,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:12,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036020037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:12,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:12,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 21:00:12,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304785136] [2025-04-13 21:00:12,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:12,482 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:00:12,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:12,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:00:12,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:00:12,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 191 transitions, 3217 flow. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:12,823 INFO L116 PetriNetUnfolderBase]: 638/1326 cut-off events. [2025-04-13 21:00:12,823 INFO L117 PetriNetUnfolderBase]: For 13417/13417 co-relation queries the response was YES. [2025-04-13 21:00:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 1326 events. 638/1326 cut-off events. For 13417/13417 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7755 event pairs, 10 based on Foata normal form. 2/1328 useless extension candidates. Maximal degree in co-relation 8072. Up to 418 conditions per place. [2025-04-13 21:00:12,831 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 142 selfloop transitions, 102 changer transitions 20/264 dead transitions. [2025-04-13 21:00:12,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 264 transitions, 4633 flow [2025-04-13 21:00:12,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:00:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:00:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 101 transitions. [2025-04-13 21:00:12,832 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32063492063492066 [2025-04-13 21:00:12,832 INFO L175 Difference]: Start difference. First operand has 193 places, 191 transitions, 3217 flow. Second operand 15 states and 101 transitions. [2025-04-13 21:00:12,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 264 transitions, 4633 flow [2025-04-13 21:00:12,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 264 transitions, 4512 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-13 21:00:12,869 INFO L231 Difference]: Finished difference. Result has 207 places, 210 transitions, 3778 flow [2025-04-13 21:00:12,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3778, PETRI_PLACES=207, PETRI_TRANSITIONS=210} [2025-04-13 21:00:12,870 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 184 predicate places. [2025-04-13 21:00:12,870 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 210 transitions, 3778 flow [2025-04-13 21:00:12,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:12,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:12,870 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:12,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 21:00:13,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:13,070 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:13,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:13,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1380173917, now seen corresponding path program 32 times [2025-04-13 21:00:13,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:13,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679531599] [2025-04-13 21:00:13,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:13,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:13,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:13,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:13,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:13,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679531599] [2025-04-13 21:00:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679531599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:13,154 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070049367] [2025-04-13 21:00:13,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:13,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:13,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:13,156 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:13,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 21:00:13,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:13,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:13,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:13,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:13,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:13,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:13,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:13,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070049367] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:13,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 21:00:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674779742] [2025-04-13 21:00:13,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:13,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:00:13,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:13,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:00:13,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:00:13,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:13,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 210 transitions, 3778 flow. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:13,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:13,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:13,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:13,749 INFO L116 PetriNetUnfolderBase]: 631/1327 cut-off events. [2025-04-13 21:00:13,749 INFO L117 PetriNetUnfolderBase]: For 12909/12909 co-relation queries the response was YES. [2025-04-13 21:00:13,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8285 conditions, 1327 events. 631/1327 cut-off events. For 12909/12909 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7812 event pairs, 10 based on Foata normal form. 10/1337 useless extension candidates. Maximal degree in co-relation 8219. Up to 299 conditions per place. [2025-04-13 21:00:13,756 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 72 selfloop transitions, 53 changer transitions 127/252 dead transitions. [2025-04-13 21:00:13,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 252 transitions, 4566 flow [2025-04-13 21:00:13,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 21:00:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 21:00:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 99 transitions. [2025-04-13 21:00:13,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3142857142857143 [2025-04-13 21:00:13,757 INFO L175 Difference]: Start difference. First operand has 207 places, 210 transitions, 3778 flow. Second operand 15 states and 99 transitions. [2025-04-13 21:00:13,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 252 transitions, 4566 flow [2025-04-13 21:00:13,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 252 transitions, 4472 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-04-13 21:00:13,794 INFO L231 Difference]: Finished difference. Result has 212 places, 111 transitions, 2048 flow [2025-04-13 21:00:13,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=3684, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2048, PETRI_PLACES=212, PETRI_TRANSITIONS=111} [2025-04-13 21:00:13,795 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 189 predicate places. [2025-04-13 21:00:13,795 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 111 transitions, 2048 flow [2025-04-13 21:00:13,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:13,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:13,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:13,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 21:00:13,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-04-13 21:00:13,995 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:13,996 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:13,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1019649975, now seen corresponding path program 33 times [2025-04-13 21:00:13,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:13,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844846049] [2025-04-13 21:00:13,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:13,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:13,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:13,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:13,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:00:13,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:14,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844846049] [2025-04-13 21:00:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844846049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:14,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481960656] [2025-04-13 21:00:14,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:14,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:14,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:14,088 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 21:00:14,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:14,115 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:14,115 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:00:14,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:14,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:14,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:14,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:14,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481960656] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:14,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:14,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-04-13 21:00:14,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177964267] [2025-04-13 21:00:14,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:14,329 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:00:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:14,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:00:14,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:00:14,343 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:14,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 111 transitions, 2048 flow. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:14,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:14,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:14,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:14,823 INFO L116 PetriNetUnfolderBase]: 300/687 cut-off events. [2025-04-13 21:00:14,823 INFO L117 PetriNetUnfolderBase]: For 6961/6961 co-relation queries the response was YES. [2025-04-13 21:00:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 687 events. 300/687 cut-off events. For 6961/6961 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3650 event pairs, 4 based on Foata normal form. 7/694 useless extension candidates. Maximal degree in co-relation 4094. Up to 163 conditions per place. [2025-04-13 21:00:14,826 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 60 selfloop transitions, 69 changer transitions 44/173 dead transitions. [2025-04-13 21:00:14,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 173 transitions, 2745 flow [2025-04-13 21:00:14,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 21:00:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 21:00:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 176 transitions. [2025-04-13 21:00:14,827 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.27035330261136714 [2025-04-13 21:00:14,827 INFO L175 Difference]: Start difference. First operand has 212 places, 111 transitions, 2048 flow. Second operand 31 states and 176 transitions. [2025-04-13 21:00:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 173 transitions, 2745 flow [2025-04-13 21:00:14,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 173 transitions, 2382 flow, removed 30 selfloop flow, removed 27 redundant places. [2025-04-13 21:00:14,842 INFO L231 Difference]: Finished difference. Result has 199 places, 96 transitions, 1602 flow [2025-04-13 21:00:14,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1602, PETRI_PLACES=199, PETRI_TRANSITIONS=96} [2025-04-13 21:00:14,842 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 176 predicate places. [2025-04-13 21:00:14,842 INFO L485 AbstractCegarLoop]: Abstraction has has 199 places, 96 transitions, 1602 flow [2025-04-13 21:00:14,842 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:14,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:14,843 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:14,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 21:00:15,043 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:15,043 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:15,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:15,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2138112441, now seen corresponding path program 34 times [2025-04-13 21:00:15,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:15,044 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574204184] [2025-04-13 21:00:15,044 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:15,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:15,045 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:15,047 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:15,047 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:15,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:15,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574204184] [2025-04-13 21:00:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574204184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:15,141 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555709606] [2025-04-13 21:00:15,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:15,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:15,142 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:15,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 21:00:15,167 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:15,177 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:15,177 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:15,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:15,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:15,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:15,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:15,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555709606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:15,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:15,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 21:00:15,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070946433] [2025-04-13 21:00:15,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:15,471 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:00:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:15,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:00:15,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:00:15,478 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:15,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 96 transitions, 1602 flow. Second operand has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:15,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:15,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:15,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:15,798 INFO L116 PetriNetUnfolderBase]: 244/559 cut-off events. [2025-04-13 21:00:15,798 INFO L117 PetriNetUnfolderBase]: For 4273/4273 co-relation queries the response was YES. [2025-04-13 21:00:15,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3172 conditions, 559 events. 244/559 cut-off events. For 4273/4273 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2784 event pairs, 62 based on Foata normal form. 3/562 useless extension candidates. Maximal degree in co-relation 3115. Up to 230 conditions per place. [2025-04-13 21:00:15,800 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 70 selfloop transitions, 35 changer transitions 31/136 dead transitions. [2025-04-13 21:00:15,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 136 transitions, 2041 flow [2025-04-13 21:00:15,800 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 21:00:15,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 21:00:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 125 transitions. [2025-04-13 21:00:15,801 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2976190476190476 [2025-04-13 21:00:15,801 INFO L175 Difference]: Start difference. First operand has 199 places, 96 transitions, 1602 flow. Second operand 20 states and 125 transitions. [2025-04-13 21:00:15,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 136 transitions, 2041 flow [2025-04-13 21:00:15,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 136 transitions, 1695 flow, removed 13 selfloop flow, removed 29 redundant places. [2025-04-13 21:00:15,810 INFO L231 Difference]: Finished difference. Result has 170 places, 77 transitions, 1036 flow [2025-04-13 21:00:15,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=1267, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1036, PETRI_PLACES=170, PETRI_TRANSITIONS=77} [2025-04-13 21:00:15,812 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 147 predicate places. [2025-04-13 21:00:15,812 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 77 transitions, 1036 flow [2025-04-13 21:00:15,812 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3448275862068964) internal successors, (97), 29 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:15,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:15,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:15,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:16,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-04-13 21:00:16,017 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:16,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2095631981, now seen corresponding path program 35 times [2025-04-13 21:00:16,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:16,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577496947] [2025-04-13 21:00:16,017 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:16,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:16,019 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:16,021 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:16,021 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:00:16,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:16,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577496947] [2025-04-13 21:00:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577496947] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:16,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563308516] [2025-04-13 21:00:16,064 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:00:16,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:16,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:16,066 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:16,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 21:00:16,086 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:16,093 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:16,093 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 21:00:16,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:16,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 21:00:16,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:16,143 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:00:16,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563308516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:00:16,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:00:16,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2025-04-13 21:00:16,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995078547] [2025-04-13 21:00:16,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:00:16,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:00:16,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:16,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:00:16,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:00:16,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:16,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 77 transitions, 1036 flow. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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-13 21:00:16,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:16,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:16,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:16,225 INFO L116 PetriNetUnfolderBase]: 188/430 cut-off events. [2025-04-13 21:00:16,226 INFO L117 PetriNetUnfolderBase]: For 2232/2232 co-relation queries the response was YES. [2025-04-13 21:00:16,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 430 events. 188/430 cut-off events. For 2232/2232 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1925 event pairs, 40 based on Foata normal form. 2/432 useless extension candidates. Maximal degree in co-relation 2162. Up to 192 conditions per place. [2025-04-13 21:00:16,228 INFO L140 encePairwiseOnDemand]: 13/21 looper letters, 54 selfloop transitions, 21 changer transitions 17/92 dead transitions. [2025-04-13 21:00:16,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 92 transitions, 1254 flow [2025-04-13 21:00:16,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 21:00:16,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 21:00:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2025-04-13 21:00:16,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2025-04-13 21:00:16,228 INFO L175 Difference]: Start difference. First operand has 170 places, 77 transitions, 1036 flow. Second operand 9 states and 63 transitions. [2025-04-13 21:00:16,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 92 transitions, 1254 flow [2025-04-13 21:00:16,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 92 transitions, 1101 flow, removed 11 selfloop flow, removed 23 redundant places. [2025-04-13 21:00:16,234 INFO L231 Difference]: Finished difference. Result has 145 places, 68 transitions, 806 flow [2025-04-13 21:00:16,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=806, PETRI_PLACES=145, PETRI_TRANSITIONS=68} [2025-04-13 21:00:16,235 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 122 predicate places. [2025-04-13 21:00:16,235 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 68 transitions, 806 flow [2025-04-13 21:00:16,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 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-13 21:00:16,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:16,235 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:16,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 21:00:16,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:16,435 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:16,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1730238259, now seen corresponding path program 36 times [2025-04-13 21:00:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:16,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882146901] [2025-04-13 21:00:16,436 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:16,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:16,438 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:16,439 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:16,439 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:00:16,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 21:00:16,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:16,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882146901] [2025-04-13 21:00:16,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882146901] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:16,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50674638] [2025-04-13 21:00:16,482 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 21:00:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:16,484 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:16,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 21:00:16,503 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 3 equivalence classes. [2025-04-13 21:00:16,516 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:16,517 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 21:00:16,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:16,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:16,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:16,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:16,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:16,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:16,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50674638] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:16,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:16,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 24 [2025-04-13 21:00:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355145325] [2025-04-13 21:00:16,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:16,793 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 21:00:16,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:16,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 21:00:16,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-04-13 21:00:16,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:16,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 68 transitions, 806 flow. Second operand has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:16,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:16,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:16,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:17,084 INFO L116 PetriNetUnfolderBase]: 145/327 cut-off events. [2025-04-13 21:00:17,084 INFO L117 PetriNetUnfolderBase]: For 1576/1576 co-relation queries the response was YES. [2025-04-13 21:00:17,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 327 events. 145/327 cut-off events. For 1576/1576 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1271 event pairs, 4 based on Foata normal form. 2/329 useless extension candidates. Maximal degree in co-relation 1623. Up to 78 conditions per place. [2025-04-13 21:00:17,085 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 44 selfloop transitions, 20 changer transitions 37/101 dead transitions. [2025-04-13 21:00:17,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 101 transitions, 1113 flow [2025-04-13 21:00:17,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 21:00:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 21:00:17,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 101 transitions. [2025-04-13 21:00:17,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28291316526610644 [2025-04-13 21:00:17,086 INFO L175 Difference]: Start difference. First operand has 145 places, 68 transitions, 806 flow. Second operand 17 states and 101 transitions. [2025-04-13 21:00:17,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 101 transitions, 1113 flow [2025-04-13 21:00:17,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 101 transitions, 993 flow, removed 4 selfloop flow, removed 14 redundant places. [2025-04-13 21:00:17,090 INFO L231 Difference]: Finished difference. Result has 140 places, 44 transitions, 463 flow [2025-04-13 21:00:17,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=463, PETRI_PLACES=140, PETRI_TRANSITIONS=44} [2025-04-13 21:00:17,091 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 117 predicate places. [2025-04-13 21:00:17,091 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 44 transitions, 463 flow [2025-04-13 21:00:17,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.730769230769231) internal successors, (97), 26 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:17,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:17,091 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:17,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 21:00:17,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:17,291 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:17,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -828759389, now seen corresponding path program 37 times [2025-04-13 21:00:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:17,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143302742] [2025-04-13 21:00:17,292 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:17,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:00:17,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:17,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:17,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:17,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143302742] [2025-04-13 21:00:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143302742] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:17,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528702732] [2025-04-13 21:00:17,376 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 21:00:17,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:17,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:17,378 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:17,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 21:00:17,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:00:17,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:17,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:00:17,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:17,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:17,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528702732] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:17,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 21:00:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327115158] [2025-04-13 21:00:17,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:17,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:00:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:17,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:00:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:00:17,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:17,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 44 transitions, 463 flow. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:17,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:17,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:17,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:17,962 INFO L116 PetriNetUnfolderBase]: 98/238 cut-off events. [2025-04-13 21:00:17,962 INFO L117 PetriNetUnfolderBase]: For 1070/1070 co-relation queries the response was YES. [2025-04-13 21:00:17,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 238 events. 98/238 cut-off events. For 1070/1070 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 874 event pairs, 5 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 1043. Up to 56 conditions per place. [2025-04-13 21:00:17,963 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 46 selfloop transitions, 23 changer transitions 12/81 dead transitions. [2025-04-13 21:00:17,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 81 transitions, 752 flow [2025-04-13 21:00:17,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 21:00:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-13 21:00:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 98 transitions. [2025-04-13 21:00:17,964 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-04-13 21:00:17,964 INFO L175 Difference]: Start difference. First operand has 140 places, 44 transitions, 463 flow. Second operand 16 states and 98 transitions. [2025-04-13 21:00:17,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 81 transitions, 752 flow [2025-04-13 21:00:17,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 81 transitions, 616 flow, removed 9 selfloop flow, removed 25 redundant places. [2025-04-13 21:00:17,966 INFO L231 Difference]: Finished difference. Result has 108 places, 42 transitions, 366 flow [2025-04-13 21:00:17,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=366, PETRI_PLACES=108, PETRI_TRANSITIONS=42} [2025-04-13 21:00:17,967 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 85 predicate places. [2025-04-13 21:00:17,967 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 42 transitions, 366 flow [2025-04-13 21:00:17,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:17,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:17,967 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:17,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 21:00:18,167 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 21:00:18,167 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:18,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1400214195, now seen corresponding path program 38 times [2025-04-13 21:00:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:18,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356380758] [2025-04-13 21:00:18,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:18,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:18,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:18,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:18,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:18,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:18,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:18,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356380758] [2025-04-13 21:00:18,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356380758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:18,242 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252797257] [2025-04-13 21:00:18,242 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:00:18,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:18,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:18,244 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:18,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 21:00:18,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:18,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:18,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:00:18,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:18,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:18,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:18,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:18,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252797257] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:18,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:18,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 21:00:18,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475706232] [2025-04-13 21:00:18,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:18,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:00:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:00:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:00:18,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:18,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 42 transitions, 366 flow. Second operand has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:18,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:18,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:18,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:18,768 INFO L116 PetriNetUnfolderBase]: 79/194 cut-off events. [2025-04-13 21:00:18,768 INFO L117 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2025-04-13 21:00:18,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 194 events. 79/194 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 623 event pairs, 8 based on Foata normal form. 2/194 useless extension candidates. Maximal degree in co-relation 787. Up to 46 conditions per place. [2025-04-13 21:00:18,769 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 30 selfloop transitions, 14 changer transitions 23/67 dead transitions. [2025-04-13 21:00:18,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 67 transitions, 571 flow [2025-04-13 21:00:18,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 83 transitions. [2025-04-13 21:00:18,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.282312925170068 [2025-04-13 21:00:18,770 INFO L175 Difference]: Start difference. First operand has 108 places, 42 transitions, 366 flow. Second operand 14 states and 83 transitions. [2025-04-13 21:00:18,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 67 transitions, 571 flow [2025-04-13 21:00:18,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 67 transitions, 512 flow, removed 6 selfloop flow, removed 14 redundant places. [2025-04-13 21:00:18,771 INFO L231 Difference]: Finished difference. Result has 106 places, 26 transitions, 208 flow [2025-04-13 21:00:18,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=208, PETRI_PLACES=106, PETRI_TRANSITIONS=26} [2025-04-13 21:00:18,772 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 83 predicate places. [2025-04-13 21:00:18,772 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 26 transitions, 208 flow [2025-04-13 21:00:18,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.357142857142857) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:18,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:18,772 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:18,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:18,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 21:00:18,973 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:18,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:18,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183163, now seen corresponding path program 39 times [2025-04-13 21:00:18,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:18,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094417795] [2025-04-13 21:00:18,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:18,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:18,975 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:18,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:18,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:18,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:19,054 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:19,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:19,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094417795] [2025-04-13 21:00:19,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094417795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:19,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902556299] [2025-04-13 21:00:19,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:00:19,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:19,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:19,056 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:19,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 21:00:19,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:19,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:19,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 21:00:19,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:19,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:19,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:19,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:19,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:19,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902556299] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:19,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:19,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 21:00:19,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043799630] [2025-04-13 21:00:19,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:19,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:00:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:19,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:00:19,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:00:19,372 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:19,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 26 transitions, 208 flow. Second operand has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:19,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:19,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:19,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:19,526 INFO L116 PetriNetUnfolderBase]: 38/96 cut-off events. [2025-04-13 21:00:19,526 INFO L117 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-04-13 21:00:19,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 96 events. 38/96 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 222 event pairs, 0 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 390. Up to 23 conditions per place. [2025-04-13 21:00:19,526 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 23 selfloop transitions, 10 changer transitions 13/46 dead transitions. [2025-04-13 21:00:19,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 46 transitions, 344 flow [2025-04-13 21:00:19,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 21:00:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 21:00:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 74 transitions. [2025-04-13 21:00:19,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25170068027210885 [2025-04-13 21:00:19,527 INFO L175 Difference]: Start difference. First operand has 106 places, 26 transitions, 208 flow. Second operand 14 states and 74 transitions. [2025-04-13 21:00:19,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 46 transitions, 344 flow [2025-04-13 21:00:19,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 46 transitions, 261 flow, removed 13 selfloop flow, removed 29 redundant places. [2025-04-13 21:00:19,528 INFO L231 Difference]: Finished difference. Result has 76 places, 22 transitions, 115 flow [2025-04-13 21:00:19,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=115, PETRI_PLACES=76, PETRI_TRANSITIONS=22} [2025-04-13 21:00:19,528 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 53 predicate places. [2025-04-13 21:00:19,528 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 22 transitions, 115 flow [2025-04-13 21:00:19,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.392857142857143) internal successors, (95), 28 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:19,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:00:19,529 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:00:19,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 21:00:19,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 21:00:19,729 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:00:19,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:00:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1675637969, now seen corresponding path program 40 times [2025-04-13 21:00:19,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:00:19,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121630532] [2025-04-13 21:00:19,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:00:19,731 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:19,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:19,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:19,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:00:19,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121630532] [2025-04-13 21:00:19,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121630532] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:00:19,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842504292] [2025-04-13 21:00:19,829 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:00:19,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:00:19,831 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:00:19,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 21:00:19,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 21:00:19,861 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:00:19,861 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:00:19,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:00:19,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 21:00:19,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:00:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:20,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:00:20,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:00:20,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842504292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:00:20,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:00:20,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 21:00:20,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694130683] [2025-04-13 21:00:20,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:00:20,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:00:20,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:00:20,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:00:20,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:00:20,195 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 21 [2025-04-13 21:00:20,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 22 transitions, 115 flow. Second operand has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:20,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:00:20,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 21 [2025-04-13 21:00:20,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:00:20,354 INFO L116 PetriNetUnfolderBase]: 24/61 cut-off events. [2025-04-13 21:00:20,355 INFO L117 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-04-13 21:00:20,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 61 events. 24/61 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 213. Up to 21 conditions per place. [2025-04-13 21:00:20,355 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 0 selfloop transitions, 0 changer transitions 33/33 dead transitions. [2025-04-13 21:00:20,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 33 transitions, 202 flow [2025-04-13 21:00:20,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 21:00:20,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 21:00:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2025-04-13 21:00:20,356 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.21978021978021978 [2025-04-13 21:00:20,356 INFO L175 Difference]: Start difference. First operand has 76 places, 22 transitions, 115 flow. Second operand 13 states and 60 transitions. [2025-04-13 21:00:20,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 33 transitions, 202 flow [2025-04-13 21:00:20,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 33 transitions, 168 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-04-13 21:00:20,356 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2025-04-13 21:00:20,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2025-04-13 21:00:20,356 INFO L279 CegarLoopForPetriNet]: 23 programPoint places, 43 predicate places. [2025-04-13 21:00:20,356 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2025-04-13 21:00:20,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:00:20,358 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:00:20,359 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:00:20,359 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:00:20,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2025-04-13 21:00:20,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:00:20,559 INFO L422 BasicCegarLoop]: Path program histogram: [40, 18, 6, 6] [2025-04-13 21:00:20,561 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:00:20,561 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:00:20,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:00:20 BasicIcfg [2025-04-13 21:00:20,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:00:20,565 INFO L158 Benchmark]: Toolchain (without parser) took 49863.88ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 111.3MB in the beginning and 433.2MB in the end (delta: -321.9MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2025-04-13 21:00:20,565 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:20,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.77ms. Allocated memory is still 155.2MB. Free memory was 111.3MB in the beginning and 97.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 21:00:20,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.58ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:00:20,565 INFO L158 Benchmark]: Boogie Preprocessor took 35.22ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:00:20,565 INFO L158 Benchmark]: RCFGBuilder took 307.29ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 73.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:00:20,566 INFO L158 Benchmark]: TraceAbstraction took 49254.37ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 72.7MB in the beginning and 433.2MB in the end (delta: -360.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2025-04-13 21:00:20,566 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.77ms. Allocated memory is still 155.2MB. Free memory was 111.3MB in the beginning and 97.4MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.58ms. Allocated memory is still 155.2MB. Free memory was 97.4MB in the beginning and 95.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 35.22ms. Allocated memory is still 155.2MB. Free memory was 95.8MB in the beginning and 94.2MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 307.29ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 73.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 49254.37ms. Allocated memory was 155.2MB in the beginning and 545.3MB in the end (delta: 390.1MB). Free memory was 72.7MB in the beginning and 433.2MB in the end (delta: -360.5MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 32 locations, 35 edges, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 49.2s, OverallIterations: 70, TraceHistogramMax: 2, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 24.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3798 SdHoareTripleChecker+Valid, 9.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3669 mSDsluCounter, 706 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 612 mSDsCounter, 851 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25976 IncrementalHoareTripleChecker+Invalid, 26827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 851 mSolverCounterUnsat, 94 mSDtfsCounter, 25976 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2590 GetRequests, 1126 SyntacticMatches, 12 SemanticMatches, 1452 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10732 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8705occurred in iteration=52, InterpolantAutomatonStates: 909, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2080 NumberOfCodeBlocks, 2080 NumberOfCodeBlocksAsserted, 208 NumberOfCheckSat, 2676 ConstructedInterpolants, 0 QuantifiedInterpolants, 15830 SizeOfPredicates, 147 NumberOfNonLiveVariables, 4467 ConjunctsInSsa, 573 ConjunctsInUnsatCore, 157 InterpolantComputations, 35 PerfectInterpolantSequences, 92/481 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:00:20,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...