Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r144-smll-177955812600277.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is FlexibleBarrier-PT-20b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r144-smll-177955812600277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K Mar 7 06:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 06:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 06:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 06:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 10:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Mar 7 06:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 06:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1779637066735

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-05-24 15:37:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-24 15:37:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 15:37:49] [INFO ] Load time of PNML (sax parser for PT used): 462 ms
[2026-05-24 15:37:49] [INFO ] Transformed 5372 places.
[2026-05-24 15:37:49] [INFO ] Transformed 6193 transitions.
[2026-05-24 15:37:49] [INFO ] Found NUPN structural information;
[2026-05-24 15:37:49] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 695 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 5310 edges and 5372 vertex of which 122 / 5372 are part of one of the 20 SCC in 30 ms
Free SCC test removed 102 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1309 transitions
Trivial Post-agglo rules discarded 1309 transitions
Performed 1309 trivial Post agglomeration. Transition count delta: 1309
Iterating post reduction 0 with 1309 rules applied. Total rules applied 1310 place count 5270 transition count 4781
Reduce places removed 1309 places and 0 transitions.
Iterating post reduction 1 with 1309 rules applied. Total rules applied 2619 place count 3961 transition count 4781
Performed 380 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 380 Pre rules applied. Total rules applied 2619 place count 3961 transition count 4401
Deduced a syphon composed of 380 places in 62 ms
Reduce places removed 380 places and 0 transitions.
Iterating global reduction 2 with 760 rules applied. Total rules applied 3379 place count 3581 transition count 4401
Performed 2335 Post agglomeration using F-continuation condition.Transition count delta: 2335
Deduced a syphon composed of 2335 places in 5 ms
Reduce places removed 2335 places and 0 transitions.
Iterating global reduction 2 with 4670 rules applied. Total rules applied 8049 place count 1246 transition count 2066
Applied a total of 8049 rules in 1176 ms. Remains 1246 /5372 variables (removed 4126) and now considering 2066/6193 (removed 4127) transitions.
[2026-05-24 15:37:50] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
// Phase 1: matrix 2007 rows 1246 cols
[2026-05-24 15:37:50] [INFO ] Computed 22 invariants in 143 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:37:54] [INFO ] Implicit Places using invariants in 3636 ms returned []
[2026-05-24 15:37:54] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2026-05-24 15:37:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 15:37:55] [INFO ] State equation strengthened by 121 read => feed constraints.
[2026-05-24 15:38:01] [INFO ] Implicit Places using invariants and state equation in 6761 ms returned []
Implicit Place search using SMT with State Equation took 10462 ms to find 0 implicit places.
Running 2065 sub problems to find dead transitions.
[2026-05-24 15:38:01] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2026-05-24 15:38:01] [INFO ] Invariant cache hit.
[2026-05-24 15:38:01] [INFO ] State equation strengthened by 121 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1245 variables, 1245/1245 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1245/3253 variables, and 1245 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 30115 ms.
Refiners :[Domain max(s): 1245/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 2065/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2065 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1245 variables, 1245/1245 constraints. Problems are: Problem set: 0 solved, 2065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1245/3253 variables, and 1245 constraints, problems are : Problem set: 0 solved, 2065 unsolved in 30060 ms.
Refiners :[Domain max(s): 1245/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 421/1644 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63734ms problems are : Problem set: 0 solved, 2065 unsolved
Search for dead transitions found 0 dead transitions in 63785ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1246/5372 places, 2066/6193 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 75494 ms. Remains : 1246/5372 places, 2066/6193 transitions.
Discarding 1203 transitions out of 2066. Remains 863
Initial state reduction rules removed 1 formulas.
[2026-05-24 15:39:07] [INFO ] Flatten gal took : 1029 ms
[2026-05-24 15:39:07] [INFO ] Flatten gal took : 462 ms
[2026-05-24 15:39:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2855453110956580196.gal : 136 ms
[2026-05-24 15:39:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18348465775249236999.prop : 23 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2855453110956580196.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18348465775249236999.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality18348465775249236999.prop.
RANDOM walk for 40000 steps (1565 resets) in 16365 ms. (2 steps per ms) remains 780/862 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 16 ms. (7 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 9 ms. (12 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 14 ms. (8 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 7 ms. (15 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 5 ms. (20 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 8 ms. (13 steps per ms) remains 780/780 properties
BEST_FIRST walk for 124 steps (0 resets) in 6 ms. (17 steps per ms) remains 780/780 properties
[2026-05-24 15:39:09] [INFO ] Flow matrix only has 2007 transitions (discarded 59 similar events)
[2026-05-24 15:39:09] [INFO ] Invariant cache hit.
[2026-05-24 15:39:09] [INFO ] State equation strengthened by 121 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Reachability property qltransition_1884 is true.
Reachability property qltransition_1883 is true.
Reachability property qltransition_1882 is true.
Reachability property qltransition_1881 is true.
Reachability property qltransition_1880 is true.
Reachability property qltransition_1879 is true.
Reachability property qltransition_1878 is true.
Reachability property qltransition_1877 is true.
Reachability property qltransition_1876 is true.
Reachability property qltransition_1875 is true.
Reachability property qltransition_1874 is true.
Reachability property qltransition_1873 is true.
Reachability property qltransition_1872 is true.
Reachability property qltransition_1871 is true.
Reachability property qltransition_1870 is true.
Reachability property qltransition_1869 is true.
Reachability property qltransition_1868 is true.
Reachability property qltransition_1867 is true.
Reachability property qltransition_1866 is true.
Reachability property qltransition_1865 is true.
SDD proceeding with computation,842 properties remain. new max is 2
SDD size :1 after 28
SDD proceeding with computation,842 properties remain. new max is 4
SDD size :28 after 730
SDD proceeding with computation,842 properties remain. new max is 8
SDD size :730 after 21142
SDD proceeding with computation,842 properties remain. new max is 16
SDD size :21142 after 703918
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1162 variables, 1162/1162 constraints. Problems are: Problem set: 0 solved, 780 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1162/3253 variables, and 1162 constraints, problems are : Problem set: 0 solved, 780 unsolved in 5035 ms.
Refiners :[Domain max(s): 1162/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 780/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 780 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1162 variables, 1162/1162 constraints. Problems are: Problem set: 0 solved, 780 unsolved
SDD proceeding with computation,842 properties remain. new max is 32
SDD size :703918 after 6.74708e+08
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1162/3253 variables, and 1162 constraints, problems are : Problem set: 0 solved, 780 unsolved in 5024 ms.
Refiners :[Domain max(s): 1162/1246 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1246 constraints, ReadFeed: 0/121 constraints, PredecessorRefiner: 20/760 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10753ms problems are : Problem set: 0 solved, 780 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1162 out of 1246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1246/1246 places, 2066/2066 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 1246 transition count 2006
Free-agglomeration rule applied 22 times.
Iterating global reduction 1 with 22 rules applied. Total rules applied 82 place count 1246 transition count 1984
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 104 place count 1224 transition count 1984
Applied a total of 104 rules in 592 ms. Remains 1224 /1246 variables (removed 22) and now considering 1984/2066 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 1224/1246 places, 1984/2066 transitions.
SDD proceeding with computation,842 properties remain. new max is 64
SDD size :6.74708e+08 after 4.3283e+10
RANDOM walk for 1073566 steps (44649 resets) in 120004 ms. (8 steps per ms) remains 725/780 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 13 ms. (286 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 12 ms. (308 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 15 ms. (250 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 14 ms. (266 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 14 ms. (266 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 13 ms. (286 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 13 ms. (286 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 18 ms. (210 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 11 ms. (333 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 10 ms. (364 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 725/725 properties
Probabilistic random walk after 1000000 steps, saw 321168 distinct states, run finished after 43164 ms. (steps per millisecond=23 ) properties seen :3
// Phase 1: matrix 1984 rows 1224 cols
[2026-05-24 15:40:34] [INFO ] Computed 22 invariants in 80 ms
[2026-05-24 15:40:34] [INFO ] State equation strengthened by 122 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1102 variables, 1102/1102 constraints. Problems are: Problem set: 0 solved, 722 unsolved
(s495 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s42 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s115 1.0)
(s116 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s127 1.0)
(s129 1.0)
(s130 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s164 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s170 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s213 1.0)
(s215 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s229 1.0)
(s230 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s256 1.0)
(s258 1.0)
(s260 1.0)
(s261 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s299 1.0)
(s301 1.0)
(s302 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s342 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s385 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s428 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s471 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/3208 variables, and 1102 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45061 ms.
Refiners :[Domain max(s): 1102/1224 constraints, Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 722/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 722 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1102 variables, 1102/1102 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1102 variables, 0/1102 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 2 (OVERLAPS) 122/1224 variables, 22/1124 constraints. Problems are: Problem set: 0 solved, 722 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1224 variables, 122/1246 constraints. Problems are: Problem set: 0 solved, 722 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1224/3208 variables, and 1246 constraints, problems are : Problem set: 0 solved, 722 unsolved in 45025 ms.
Refiners :[Domain max(s): 1224/1224 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1224 constraints, ReadFeed: 0/122 constraints, PredecessorRefiner: 19/703 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90593ms problems are : Problem set: 0 solved, 722 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1102 out of 1224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1224/1224 places, 1984/1984 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1221 transition count 1981
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1221 transition count 1981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 1221 transition count 1979
Free-agglomeration rule applied 53 times.
Iterating global reduction 1 with 53 rules applied. Total rules applied 61 place count 1221 transition count 1926
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 114 place count 1168 transition count 1926
Applied a total of 114 rules in 431 ms. Remains 1168 /1224 variables (removed 56) and now considering 1926/1984 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 1168/1224 places, 1926/1984 transitions.
RANDOM walk for 1159846 steps (48221 resets) in 120004 ms. (9 steps per ms) remains 651/722 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 6 ms. (572 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 7 ms. (500 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 9 ms. (400 steps per ms) remains 651/651 properties
BEST_FIRST walk for 4004 steps (0 resets) in 8 ms. (444 steps per ms) remains 651/651 properties
// Phase 1: matrix 1926 rows 1168 cols
[2026-05-24 15:42:35] [INFO ] Computed 22 invariants in 62 ms
[2026-05-24 15:42:35] [INFO ] State equation strengthened by 174 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1019 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 149/1168 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1168 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1926/3094 variables, 1168/1190 constraints. Problems are: Problem set: 0 solved, 651 unsolved
SMT process timed out in 75492ms, After SMT, problems are : Problem set: 0 solved, 651 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1019 out of 1168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1168/1168 places, 1926/1926 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1164 transition count 1922
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1164 transition count 1922
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 1164 transition count 1918
Free-agglomeration rule applied 67 times.
Iterating global reduction 1 with 67 rules applied. Total rules applied 79 place count 1164 transition count 1851
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 154 place count 1097 transition count 1843
Applied a total of 154 rules in 371 ms. Remains 1097 /1168 variables (removed 71) and now considering 1843/1926 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 1097/1168 places, 1843/1926 transitions.
RANDOM walk for 1234813 steps (51324 resets) in 120004 ms. (10 steps per ms) remains 575/651 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 575/575 properties
// Phase 1: matrix 1843 rows 1097 cols
[2026-05-24 15:44:21] [INFO ] Computed 22 invariants in 69 ms
[2026-05-24 15:44:21] [INFO ] State equation strengthened by 233 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
Reachability property qltransition_1522 is true.
Reachability property qltransition_1521 is true.
Reachability property qltransition_1520 is true.
Reachability property qltransition_1519 is true.
Reachability property qltransition_1518 is true.
Reachability property qltransition_1517 is true.
Reachability property qltransition_1516 is true.
Reachability property qltransition_1515 is true.
Reachability property qltransition_1514 is true.
Reachability property qltransition_1513 is true.
Reachability property qltransition_1512 is true.
Reachability property qltransition_1511 is true.
Reachability property qltransition_1510 is true.
Reachability property qltransition_1509 is true.
Reachability property qltransition_1508 is true.
Reachability property qltransition_1507 is true.
Reachability property qltransition_1506 is true.
Reachability property qltransition_1505 is true.
Reachability property qltransition_1504 is true.
Reachability property qltransition_1503 is true.
Reachability property qltransition_1486 is true.
Reachability property qltransition_1485 is true.
Reachability property qltransition_1484 is true.
Reachability property qltransition_1483 is true.
At refinement iteration 0 (INCLUDED_ONLY) 0/926 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 557 unsolved
At refinement iteration 1 (OVERLAPS) 171/1097 variables, 22/22 constraints. Problems are: Problem set: 19 solved, 556 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1097 variables, 0/22 constraints. Problems are: Problem set: 19 solved, 556 unsolved
Reachability property qltransition_1482 is true.
At refinement iteration 3 (OVERLAPS) 1843/2940 variables, 1097/1119 constraints. Problems are: Problem set: 20 solved, 555 unsolved
Reachability property qltransition_1481 is true.
SMT process timed out in 90622ms, After SMT, problems are : Problem set: 21 solved, 554 unsolved
Fused 554 Parikh solutions to 345 different solutions.
Parikh walk visited 322 properties in 747 ms.
Support contains 396 out of 1097 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1097/1097 places, 1843/1843 transitions.
Discarding 141 places :
Symmetric choice reduction at 0 with 141 rule applications. Total rules 141 place count 956 transition count 1702
Iterating global reduction 0 with 141 rules applied. Total rules applied 282 place count 956 transition count 1702
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Iterating post reduction 0 with 141 rules applied. Total rules applied 423 place count 956 transition count 1561
Free-agglomeration rule applied 255 times.
Iterating global reduction 1 with 255 rules applied. Total rules applied 678 place count 956 transition count 1306
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 1 with 318 rules applied. Total rules applied 996 place count 701 transition count 1243
Applied a total of 996 rules in 351 ms. Remains 701 /1097 variables (removed 396) and now considering 1243/1843 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 701/1097 places, 1243/1843 transitions.
RANDOM walk for 3227475 steps (124937 resets) in 120004 ms. (26 steps per ms) remains 58/232 properties
BEST_FIRST walk for 400004 steps (8 resets) in 358 ms. (1114 steps per ms) remains 57/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 352 ms. (1133 steps per ms) remains 56/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 359 ms. (1111 steps per ms) remains 55/56 properties
BEST_FIRST walk for 400004 steps (8 resets) in 355 ms. (1123 steps per ms) remains 54/55 properties
BEST_FIRST walk for 400004 steps (8 resets) in 363 ms. (1098 steps per ms) remains 53/54 properties
BEST_FIRST walk for 400004 steps (8 resets) in 401 ms. (995 steps per ms) remains 52/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 502 ms. (795 steps per ms) remains 51/52 properties
BEST_FIRST walk for 400004 steps (8 resets) in 585 ms. (682 steps per ms) remains 50/51 properties
BEST_FIRST walk for 400004 steps (8 resets) in 623 ms. (641 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 575 ms. (694 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 604 ms. (661 steps per ms) remains 47/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 567 ms. (704 steps per ms) remains 46/47 properties
BEST_FIRST walk for 400004 steps (8 resets) in 577 ms. (692 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 542 ms. (736 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 530 ms. (753 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 509 ms. (784 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 532 ms. (750 steps per ms) remains 41/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 511 ms. (781 steps per ms) remains 40/41 properties
BEST_FIRST walk for 400004 steps (8 resets) in 509 ms. (784 steps per ms) remains 39/40 properties
BEST_FIRST walk for 400004 steps (8 resets) in 545 ms. (732 steps per ms) remains 38/39 properties
BEST_FIRST walk for 400004 steps (8 resets) in 518 ms. (770 steps per ms) remains 37/38 properties
BEST_FIRST walk for 400004 steps (8 resets) in 490 ms. (814 steps per ms) remains 36/37 properties
BEST_FIRST walk for 400004 steps (8 resets) in 486 ms. (821 steps per ms) remains 35/36 properties
BEST_FIRST walk for 400004 steps (8 resets) in 469 ms. (851 steps per ms) remains 34/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 468 ms. (852 steps per ms) remains 33/34 properties
BEST_FIRST walk for 400004 steps (8 resets) in 476 ms. (838 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400004 steps (8 resets) in 433 ms. (921 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 466 ms. (856 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (8 resets) in 453 ms. (881 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 434 ms. (919 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 430 ms. (928 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (168 resets) in 416 ms. (959 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (166 resets) in 443 ms. (900 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (170 resets) in 402 ms. (992 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (169 resets) in 402 ms. (992 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (165 resets) in 404 ms. (987 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (167 resets) in 402 ms. (992 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (169 resets) in 551 ms. (724 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (172 resets) in 606 ms. (658 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (169 resets) in 493 ms. (809 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (165 resets) in 484 ms. (824 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (167 resets) in 501 ms. (796 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (164 resets) in 488 ms. (818 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (167 resets) in 448 ms. (890 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (169 resets) in 383 ms. (1041 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (165 resets) in 408 ms. (978 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (167 resets) in 388 ms. (1028 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (163 resets) in 455 ms. (877 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (166 resets) in 389 ms. (1025 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (168 resets) in 397 ms. (1005 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (168 resets) in 398 ms. (1002 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (164 resets) in 398 ms. (1002 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (165 resets) in 338 ms. (1179 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (166 resets) in 393 ms. (1015 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (170 resets) in 402 ms. (992 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (167 resets) in 498 ms. (801 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (170 resets) in 509 ms. (784 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (169 resets) in 517 ms. (772 steps per ms) remains 27/27 properties
// Phase 1: matrix 1243 rows 701 cols
[2026-05-24 15:46:31] [INFO ] Computed 22 invariants in 44 ms
[2026-05-24 15:46:31] [INFO ] State equation strengthened by 425 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 278/306 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 395/701 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Reachability property qltransition_1480 is true.
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1944 variables, 701/723 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1944 variables, 425/1148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1944 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/1944 variables, 0/1148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1148 constraints, problems are : Problem set: 0 solved, 27 unsolved in 11189 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 701/701 constraints, ReadFeed: 425/425 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 278/306 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 395/701 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/701 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1944 variables, 701/723 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1944 variables, 425/1148 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1944 variables, 27/1175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1944 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/1944 variables, 0/1175 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1175 constraints, problems are : Problem set: 0 solved, 27 unsolved in 15080 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 701/701 constraints, ReadFeed: 425/425 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26355ms problems are : Problem set: 0 solved, 27 unsolved
Finished Parikh walk after 3860 steps, including 37 resets, run visited all 4 properties in 128 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 27 properties in 249 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 863 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 550196 ms.

BK_STOP 1779637619010

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is FlexibleBarrier-PT-20b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r144-smll-177955812600277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;