About the Execution of ITS-Tools for ErlangenMainframeV0-PT-0505
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 241786.00 | 0.00 | 0.00 | TTTFTFTFFTFFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339600273.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is ErlangenMainframeV0-PT-0505, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339600273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 944K
-rw-r--r-- 1 mcc users 6.6K Jun 6 09:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 6 08:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 6 08:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 11:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Jun 6 11:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 11:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 11:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 14K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 11:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 11:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 485K Jun 5 20:08 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-00
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-01
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-02
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-03
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-04
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-05
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-06
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-07
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-08
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-09
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-10
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-11
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-12
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-13
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-14
FORMULA_NAME ErlangenMainframeV0-PT-0505-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749352269703
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV0-PT-0505
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-08 03:11:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 03:11:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 03:11:11] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2025-06-08 03:11:11] [INFO ] Transformed 203 places.
[2025-06-08 03:11:11] [INFO ] Transformed 949 transitions.
[2025-06-08 03:11:11] [INFO ] Found NUPN structural information;
[2025-06-08 03:11:11] [INFO ] Parsed PT model containing 203 places and 949 transitions and 10344 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 79 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 949/949 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 183 transition count 929
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 183 transition count 929
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 178 transition count 924
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 178 transition count 924
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 176 transition count 762
Ensure Unique test removed 1 places
Iterating global reduction 0 with 3 rules applied. Total rules applied 55 place count 175 transition count 762
Applied a total of 55 rules in 105 ms. Remains 175 /203 variables (removed 28) and now considering 762/949 (removed 187) transitions.
// Phase 1: matrix 762 rows 175 cols
[2025-06-08 03:11:11] [INFO ] Computed 15 invariants in 26 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:11:11] [INFO ] Implicit Places using invariants in 376 ms returned []
[2025-06-08 03:11:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:11:12] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2025-06-08 03:11:12] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
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
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:21] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:21] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:21] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:22] [INFO ] Deduced a trap composed of 35 places in 173 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:22] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:22] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:23] [INFO ] Deduced a trap composed of 58 places in 202 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:24] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:34] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:40] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 175/937 variables, and 31 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/175 constraints, PredecessorRefiner: 761/179 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/175 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:46] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:47] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:47] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:52] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:53] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:53] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:53] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:54] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:54] [INFO ] Deduced a trap composed of 18 places in 281 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:54] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:55] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:55] [INFO ] Deduced a trap composed of 74 places in 220 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:55] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:55] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap composed of 28 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap composed of 22 places in 240 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:56] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:11:57] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 7 (OVERLAPS) 762/937 variables, 175/225 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/937 variables, 179/404 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:13] [INFO ] Deduced a trap composed of 17 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:13] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 17 ms to minimize.
SMT process timed out in 61567ms, After SMT, problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 61602ms
Starting structural reductions in LTL mode, iteration 1 : 175/203 places, 762/949 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62505 ms. Remains : 175/203 places, 762/949 transitions.
Support contains 79 out of 175 places after structural reductions.
[2025-06-08 03:12:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-08 03:12:14] [INFO ] Flatten gal took : 169 ms
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-08 03:12:14] [INFO ] Flatten gal took : 97 ms
[2025-06-08 03:12:14] [INFO ] Input system was already deterministic with 762 transitions.
RANDOM walk for 40000 steps (8 resets) in 2291 ms. (17 steps per ms) remains 2/51 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1188 steps (0 resets) in 13 ms. (84 steps per ms) remains 0/1 properties
[2025-06-08 03:12:15] [INFO ] Flatten gal took : 63 ms
[2025-06-08 03:12:15] [INFO ] Flatten gal took : 61 ms
[2025-06-08 03:12:15] [INFO ] Input system was already deterministic with 762 transitions.
Computed a total of 30 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 134 transition count 399
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 134 transition count 399
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 102 place count 114 transition count 326
Ensure Unique test removed 1 places
Iterating global reduction 0 with 21 rules applied. Total rules applied 123 place count 113 transition count 326
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 134 place count 102 transition count 189
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 148 place count 99 transition count 189
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 155 place count 92 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 162 place count 92 transition count 135
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 89 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 89 transition count 129
Applied a total of 168 rules in 19 ms. Remains 89 /175 variables (removed 86) and now considering 129/762 (removed 633) transitions.
// Phase 1: matrix 129 rows 89 cols
[2025-06-08 03:12:15] [INFO ] Computed 11 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:15] [INFO ] Implicit Places using invariants in 48 ms returned []
[2025-06-08 03:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:15] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-08 03:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:16] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:16] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 129/218 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/218 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 102 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3719 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:19] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (OVERLAPS) 129/218 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 128/231 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:20] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:22] [INFO ] Deduced a trap along path composed of 3 places in 71 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:22] [INFO ] Deduced a trap along path composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:12:26] [INFO ] Deduced a trap along path composed of 6 places in 28 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/218 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 235 constraints, problems are : Problem set: 0 solved, 128 unsolved in 13724 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 17459ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 17460ms
Starting structural reductions in LTL mode, iteration 1 : 89/175 places, 129/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17594 ms. Remains : 89/175 places, 129/762 transitions.
[2025-06-08 03:12:33] [INFO ] Flatten gal took : 8 ms
[2025-06-08 03:12:33] [INFO ] Flatten gal took : 9 ms
[2025-06-08 03:12:33] [INFO ] Input system was already deterministic with 129 transitions.
[2025-06-08 03:12:33] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:12:33] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:12:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality16951699623660534690.gal : 3 ms
[2025-06-08 03:12:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10854449674005092700.ctl : 8 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16951699623660534690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10854449674005092700.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.05194e+08,0.15713,6964,2,2550,5,13935,6,0,487,10124,0
Converting to forward existential form...Done !
original formula: EG(EF(EX((p44==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((p44==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t9, t11, t14, t39, t47, t55, t60, t65, t70, t74, t86, t87, t88, t89, t90, t101, Intersec...246
(forward)formula 0,1,1.97608,55980,1,0,263,282731,283,134,3708,226599,347
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Graph (trivial) has 141 edges and 175 vertex of which 6 / 175 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 171 transition count 716
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 129 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 128 transition count 715
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 87 place count 128 transition count 706
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 105 place count 119 transition count 706
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 131 place count 93 transition count 358
Iterating global reduction 3 with 26 rules applied. Total rules applied 157 place count 93 transition count 358
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 157 place count 93 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 161 place count 91 transition count 356
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 168 place count 84 transition count 277
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 177 place count 82 transition count 277
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 183 place count 76 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 189 place count 76 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 191 place count 74 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 74 transition count 119
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 247 place count 47 transition count 92
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 252 place count 42 transition count 64
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 259 place count 40 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 261 place count 40 transition count 62
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 263 place count 38 transition count 59
Iterating global reduction 4 with 2 rules applied. Total rules applied 265 place count 38 transition count 59
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 267 place count 36 transition count 55
Iterating global reduction 4 with 2 rules applied. Total rules applied 269 place count 36 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 271 place count 35 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 276 place count 35 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 286 place count 30 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 287 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 288 place count 28 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 290 place count 28 transition count 41
Applied a total of 290 rules in 86 ms. Remains 28 /175 variables (removed 147) and now considering 41/762 (removed 721) transitions.
[2025-06-08 03:12:35] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
// Phase 1: matrix 33 rows 28 cols
[2025-06-08 03:12:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-08 03:12:35] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
[2025-06-08 03:12:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-08 03:12:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:12:35] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-08 03:12:35] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
[2025-06-08 03:12:35] [INFO ] Invariant cache hit.
[2025-06-08 03:12:35] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 41 constraints, problems are : Problem set: 0 solved, 23 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 64 constraints, problems are : Problem set: 0 solved, 23 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 633ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/175 places, 41/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 797 ms. Remains : 28/175 places, 41/762 transitions.
[2025-06-08 03:12:35] [INFO ] Flatten gal took : 5 ms
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:12:36] [INFO ] Input system was already deterministic with 41 transitions.
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:12:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14297080410450231871.gal : 1 ms
[2025-06-08 03:12:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality13927552390738176591.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14297080410450231871.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13927552390738176591.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,18432,0.007661,4116,2,152,5,581,5,0,154,402,0
Converting to forward existential form...Done !
original formula: AG(EF(EG(((p165==0)||(p158==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG(((p165==0)||(p158==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.016501,4244,1,0,6,2421,20,0,789,935,8
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 137 transition count 402
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 137 transition count 402
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 118 transition count 330
Ensure Unique test removed 1 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 115 place count 117 transition count 330
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 107 transition count 194
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 137 place count 105 transition count 194
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 143 place count 99 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 149 place count 99 transition count 142
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 150 place count 98 transition count 140
Iterating global reduction 0 with 1 rules applied. Total rules applied 151 place count 98 transition count 140
Applied a total of 151 rules in 13 ms. Remains 98 /175 variables (removed 77) and now considering 140/762 (removed 622) transitions.
// Phase 1: matrix 140 rows 98 cols
[2025-06-08 03:12:36] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:36] [INFO ] Implicit Places using invariants in 49 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/175 places, 140/762 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 97/175 places, 140/762 transitions.
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 5 ms
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:12:36] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:12:36] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:12:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1813867766593938289.gal : 2 ms
[2025-06-08 03:12:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15816227242274399390.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1813867766593938289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15816227242274399390.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.66674e+08,0.145387,9928,2,3981,5,25414,6,0,530,21047,0
Converting to forward existential form...Done !
original formula: A((p99!=0) U EF(AX(E(((p91==0)||(p202==1)) U !(((p124==0)||(p75==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(EX(!(E(((p91==0)||(p202==1)) U !(((p124==0)||(p75==1)))))))))))) * !(E(!(E(TRUE U !(...322
Reverse transition relation is NOT exact ! Due to transitions t5, t8, t10, t15, t16, t20, t22, t24, t30, t32, t34, t41, t44, t46, t50, t54, t58, t59, t62, ...342
(forward)formula 0,1,7.20345,242156,1,0,593,1.44002e+06,315,282,3891,1.4447e+06,641
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Graph (trivial) has 139 edges and 175 vertex of which 4 / 175 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 172 transition count 716
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 129 transition count 715
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 89 place count 128 transition count 715
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 89 place count 128 transition count 706
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 107 place count 119 transition count 706
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 133 place count 93 transition count 358
Iterating global reduction 3 with 26 rules applied. Total rules applied 159 place count 93 transition count 358
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 159 place count 93 transition count 356
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 91 transition count 356
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 170 place count 84 transition count 277
Ensure Unique test removed 2 places
Iterating global reduction 3 with 9 rules applied. Total rules applied 179 place count 82 transition count 277
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 185 place count 76 transition count 123
Iterating global reduction 3 with 6 rules applied. Total rules applied 191 place count 76 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 192 place count 75 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 193 place count 75 transition count 121
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 247 place count 48 transition count 94
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 252 place count 43 transition count 66
Ensure Unique test removed 2 places
Iterating global reduction 3 with 7 rules applied. Total rules applied 259 place count 41 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 262 place count 41 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 264 place count 39 transition count 60
Iterating global reduction 4 with 2 rules applied. Total rules applied 266 place count 39 transition count 60
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 268 place count 37 transition count 56
Iterating global reduction 4 with 2 rules applied. Total rules applied 270 place count 37 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 272 place count 36 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 278 place count 36 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 288 place count 31 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 30 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 290 place count 29 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 291 place count 29 transition count 42
Applied a total of 291 rules in 51 ms. Remains 29 /175 variables (removed 146) and now considering 42/762 (removed 720) transitions.
[2025-06-08 03:12:43] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
// Phase 1: matrix 35 rows 29 cols
[2025-06-08 03:12:43] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-08 03:12:43] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2025-06-08 03:12:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-08 03:12:43] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:12:43] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-08 03:12:43] [INFO ] Flow matrix only has 35 transitions (discarded 7 similar events)
[2025-06-08 03:12:43] [INFO ] Invariant cache hit.
[2025-06-08 03:12:43] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/29 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/64 variables, and 42 constraints, problems are : Problem set: 0 solved, 24 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/29 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 34/63 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/64 variables, and 66 constraints, problems are : Problem set: 0 solved, 24 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 642ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 642ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/175 places, 42/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 763 ms. Remains : 29/175 places, 42/762 transitions.
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 6 ms
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:12:44] [INFO ] Input system was already deterministic with 42 transitions.
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:12:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality3514005239377428093.gal : 0 ms
[2025-06-08 03:12:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13511477252739050368.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3514005239377428093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13511477252739050368.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,27648,0.014934,4128,2,116,5,757,5,0,159,773,0
Converting to forward existential form...Done !
original formula: AF(AG((((p18==1)||(p126==1)) + AF((p145==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((((p18==1)||(p126==1)) + !(EG(!((p145==0))))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.02568,4384,1,0,10,2831,24,4,854,1798,12
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 145 transition count 571
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 145 transition count 571
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 73 place count 132 transition count 557
Iterating global reduction 0 with 13 rules applied. Total rules applied 86 place count 132 transition count 557
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 127 transition count 498
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 127 transition count 498
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 124 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 124 transition count 270
Applied a total of 102 rules in 14 ms. Remains 124 /175 variables (removed 51) and now considering 270/762 (removed 492) transitions.
// Phase 1: matrix 270 rows 124 cols
[2025-06-08 03:12:44] [INFO ] Computed 15 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:12:44] [INFO ] Implicit Places using invariants in 84 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/175 places, 270/762 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 123/175 places, 270/762 transitions.
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 12 ms
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 12 ms
[2025-06-08 03:12:44] [INFO ] Input system was already deterministic with 270 transitions.
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:12:44] [INFO ] Flatten gal took : 11 ms
[2025-06-08 03:12:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality12270025002022756618.gal : 2 ms
[2025-06-08 03:12:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality18033699982716567272.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12270025002022756618.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18033699982716567272.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.64286e+09,2.76561,71308,2,18976,5,225173,6,0,764,288256,0
Converting to forward existential form...Done !
original formula: EF((EX(EG(E((p95==0) U (p131==1)))) * (((p181==0) * EF(((p109==1)&&(p102==1)))) + (E(((E((p50==0) U (p80==0)) * ((p11==0)||(p14==1))) * (...245
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,TRUE) * EX(EG(E((p95==0) U (p131==1))))) * (p181==0)),TRUE) * ((p109==1)&&(p102==1)))] != FA...377
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t13, t15, t17, t20, t48, t50, t52, t57, t62, t66, t68, t69, t71, t74, t75, t7...354
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,26.3531,650344,1,0,784,3.20698e+06,571,402,9530,2.93361e+06,866
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 139 transition count 404
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 139 transition count 404
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 89 place count 122 transition count 361
Iterating global reduction 0 with 17 rules applied. Total rules applied 106 place count 122 transition count 361
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 115 place count 113 transition count 253
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 127 place count 110 transition count 253
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 133 place count 104 transition count 149
Iterating global reduction 0 with 6 rules applied. Total rules applied 139 place count 104 transition count 149
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 142 place count 101 transition count 143
Iterating global reduction 0 with 3 rules applied. Total rules applied 145 place count 101 transition count 143
Applied a total of 145 rules in 12 ms. Remains 101 /175 variables (removed 74) and now considering 143/762 (removed 619) transitions.
// Phase 1: matrix 143 rows 101 cols
[2025-06-08 03:13:10] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:11] [INFO ] Implicit Places using invariants in 53 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/175 places, 143/762 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 100/175 places, 143/762 transitions.
[2025-06-08 03:13:11] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:11] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:11] [INFO ] Input system was already deterministic with 143 transitions.
[2025-06-08 03:13:11] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:11] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4290311328843686110.gal : 1 ms
[2025-06-08 03:13:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality8562879024945205763.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4290311328843686110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8562879024945205763.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08502e+09,0.473826,20604,2,5947,5,63104,6,0,545,80172,0
Converting to forward existential form...Done !
original formula: AG(E(EX((p61==1)) U EX((AG(((p167==0)||(p14==1))) + !(((p190==0)||(p139==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX((p61==1)) U EX((!(E(TRUE U !(((p167==0)||(p14==1))))) + !(((p190==0)||(p139==1)))))))...165
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t11, t12, t13, t16, t33, t35, t45, t48, t53, t57, t60, t61, t65, t66, t71, t72, t73, ...324
(forward)formula 0,0,5.72243,165852,1,0,494,931176,314,292,3988,1.00844e+06,505
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 142 transition count 407
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 142 transition count 407
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 80 place count 128 transition count 340
Ensure Unique test removed 1 places
Iterating global reduction 0 with 15 rules applied. Total rules applied 95 place count 127 transition count 340
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 102 place count 120 transition count 208
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 110 place count 119 transition count 208
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 115 place count 114 transition count 160
Iterating global reduction 0 with 5 rules applied. Total rules applied 120 place count 114 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 113 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 113 transition count 158
Applied a total of 122 rules in 8 ms. Remains 113 /175 variables (removed 62) and now considering 158/762 (removed 604) transitions.
// Phase 1: matrix 158 rows 113 cols
[2025-06-08 03:13:16] [INFO ] Computed 13 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:17] [INFO ] Implicit Places using invariants in 162 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/175 places, 158/762 transitions.
Applied a total of 0 rules in 1 ms. Remains 112 /112 variables (removed 0) and now considering 158/158 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 112/175 places, 158/762 transitions.
[2025-06-08 03:13:17] [INFO ] Flatten gal took : 5 ms
[2025-06-08 03:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:17] [INFO ] Input system was already deterministic with 158 transitions.
[2025-06-08 03:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:17] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17008637817544179234.gal : 0 ms
[2025-06-08 03:13:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality8895661682761578793.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17008637817544179234.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8895661682761578793.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.73221e+09,0.466381,20976,2,8106,5,64390,6,0,608,74918,0
Converting to forward existential form...Done !
original formula: (E(((((p161!=1)||((p79==1)&&((p148==0)||(p126==1)))) * EF(((p180==0)||(p36==1)))) + !(AX((p125==0)))) U ((((p187==0)||(p27==1)) * !(AG(((...248
=> equivalent forward existential formula: [(EY(EY((Init * !(E(((((p161!=1)||((p79==1)&&((p148==0)||(p126==1)))) * E(TRUE U ((p180==0)||(p36==1)))) + !(!(E...322
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t10, t12, t13, t17, t28, t31, t40, t51, t54, t60, t64, t67, t68, t72, t74, t75, t76, ...344
(forward)formula 0,1,9.66944,270632,1,0,347,1.5595e+06,348,187,4616,1.29323e+06,408
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 138 transition count 564
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 138 transition count 564
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 120 transition count 493
Ensure Unique test removed 1 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 111 place count 119 transition count 493
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 121 place count 109 transition count 249
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 133 place count 107 transition count 249
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 139 place count 101 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 145 place count 101 transition count 147
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 147 place count 99 transition count 143
Iterating global reduction 0 with 2 rules applied. Total rules applied 149 place count 99 transition count 143
Applied a total of 149 rules in 9 ms. Remains 99 /175 variables (removed 76) and now considering 143/762 (removed 619) transitions.
// Phase 1: matrix 143 rows 99 cols
[2025-06-08 03:13:26] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:26] [INFO ] Implicit Places using invariants in 51 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/175 places, 143/762 transitions.
Applied a total of 0 rules in 0 ms. Remains 98 /98 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 98/175 places, 143/762 transitions.
[2025-06-08 03:13:26] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:26] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:26] [INFO ] Input system was already deterministic with 143 transitions.
[2025-06-08 03:13:26] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:26] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:13:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality13704512722881173121.gal : 1 ms
[2025-06-08 03:13:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality1501156302925670293.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13704512722881173121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1501156302925670293.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.15391e+09,0.434316,17412,2,6484,5,53985,6,0,537,57257,0
Converting to forward existential form...Done !
original formula: A((p75==1) U A(((AF(((p177==1)&&((p109==0)||(p106==1)))) + (p105!=0)) + (((p84==0)||(p124==1))&&(((p50==0)||(p157==1))||((p85==0)||(p74==...199
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(EX((!(E(TRUE U !((p122==0)))) * !(EG(!((p2==0))))))) U (!(((!(EG(!(((p177==1)&&((p109==0...1075
Reverse transition relation is NOT exact ! Due to transitions t1, t9, t11, t13, t16, t41, t44, t46, t50, t54, t57, t61, t64, t65, t66, t70, t74, t75, t76, ...304
(forward)formula 0,0,9.01931,241700,1,0,345,1.3619e+06,327,175,4109,1.15435e+06,432
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 138 transition count 403
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 138 transition count 403
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 93 place count 119 transition count 332
Ensure Unique test removed 1 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 113 place count 118 transition count 332
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 122 place count 109 transition count 250
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 134 place count 106 transition count 250
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 140 place count 100 transition count 146
Iterating global reduction 0 with 6 rules applied. Total rules applied 146 place count 100 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 149 place count 97 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 152 place count 97 transition count 140
Applied a total of 152 rules in 20 ms. Remains 97 /175 variables (removed 78) and now considering 140/762 (removed 622) transitions.
// Phase 1: matrix 140 rows 97 cols
[2025-06-08 03:13:36] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:36] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 03:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:13:36] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-08 03:13:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:36] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:37] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (OVERLAPS) 140/237 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (OVERLAPS) 0/237 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 110 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4368 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:40] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/237 variables, 97/111 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 139/250 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:42] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 9/259 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:43] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:44] [INFO ] Deduced a trap along path composed of 5 places in 46 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:44] [INFO ] Deduced a trap along path composed of 3 places in 36 ms of which 0 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:13:44] [INFO ] Deduced a trap along path composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 3/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 11 (OVERLAPS) 0/237 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 263 constraints, problems are : Problem set: 0 solved, 139 unsolved in 11909 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 16294ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 16294ms
Starting structural reductions in LTL mode, iteration 1 : 97/175 places, 140/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16431 ms. Remains : 97/175 places, 140/762 transitions.
[2025-06-08 03:13:52] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:52] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:52] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-08 03:13:52] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:13:52] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:13:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10570470948351243184.gal : 1 ms
[2025-06-08 03:13:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6379617874799000991.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10570470948351243184.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6379617874799000991.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.81823e+08,0.316585,16064,2,5399,5,46599,6,0,530,53519,0
Converting to forward existential form...Done !
original formula: (EF((p190==0)) * ((AX(FALSE) + EX((((p177==1)&&(p3==1)) * (((p2==0)||(p196==1)) * E((p179==1) U (p16==1)))))) + (AF(AG((p55==0))) * EF(!(...197
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p190==0))))] = FALSE * ([FwdG((Init * !((!(EX(!(FALSE))) + EX((((p177==1)&&(p3==1)) * (((p...424
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t12, t13, t16, t24, t31, t34, t43, t46, t51, t55, t58, t59, t63, t64, t68, t69, ...338
(forward)formula 0,0,15.889,456980,1,0,636,2.70574e+06,318,321,4113,2.60898e+06,740
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Graph (trivial) has 142 edges and 175 vertex of which 6 / 175 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 171 transition count 714
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 127 transition count 714
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 89 place count 127 transition count 705
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 107 place count 118 transition count 705
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 133 place count 92 transition count 518
Iterating global reduction 2 with 26 rules applied. Total rules applied 159 place count 92 transition count 518
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 159 place count 92 transition count 515
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 165 place count 89 transition count 515
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 83 transition count 438
Ensure Unique test removed 2 places
Iterating global reduction 2 with 8 rules applied. Total rules applied 179 place count 81 transition count 438
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 185 place count 75 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 191 place count 75 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 193 place count 73 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 195 place count 73 transition count 126
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 247 place count 47 transition count 100
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 252 place count 42 transition count 68
Ensure Unique test removed 2 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 259 place count 40 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 262 place count 40 transition count 65
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 264 place count 38 transition count 59
Iterating global reduction 3 with 2 rules applied. Total rules applied 266 place count 38 transition count 59
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 268 place count 36 transition count 55
Iterating global reduction 3 with 2 rules applied. Total rules applied 270 place count 36 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 272 place count 35 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 277 place count 35 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 287 place count 30 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 288 place count 30 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 289 place count 29 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 290 place count 28 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 292 place count 28 transition count 41
Applied a total of 292 rules in 41 ms. Remains 28 /175 variables (removed 147) and now considering 41/762 (removed 721) transitions.
[2025-06-08 03:14:08] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
// Phase 1: matrix 33 rows 28 cols
[2025-06-08 03:14:08] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-08 03:14:08] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
[2025-06-08 03:14:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-08 03:14:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 03:14:08] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-08 03:14:08] [INFO ] Flow matrix only has 33 transitions (discarded 8 similar events)
[2025-06-08 03:14:08] [INFO ] Invariant cache hit.
[2025-06-08 03:14:08] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 42 constraints, problems are : Problem set: 0 solved, 24 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 5/28 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 32/60 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 24/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 66 constraints, problems are : Problem set: 0 solved, 24 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 605ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/175 places, 41/762 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 730 ms. Remains : 28/175 places, 41/762 transitions.
[2025-06-08 03:14:09] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:09] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:09] [INFO ] Input system was already deterministic with 41 transitions.
[2025-06-08 03:14:09] [INFO ] Flatten gal took : 2 ms
[2025-06-08 03:14:09] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:14:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality5653012232771531919.gal : 0 ms
[2025-06-08 03:14:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality12120335109379723679.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5653012232771531919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12120335109379723679.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,20736,0.009055,4052,2,161,5,797,5,0,154,671,0
Converting to forward existential form...Done !
original formula: AG(EF(((p186==0)||(p60==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p186==0)||(p60==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.019252,4436,1,0,6,3601,12,0,734,1510,5
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 137 transition count 402
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 137 transition count 402
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 94 place count 119 transition count 331
Ensure Unique test removed 1 places
Iterating global reduction 0 with 19 rules applied. Total rules applied 113 place count 118 transition count 331
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 124 place count 107 transition count 194
Ensure Unique test removed 3 places
Iterating global reduction 0 with 14 rules applied. Total rules applied 138 place count 104 transition count 194
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 145 place count 97 transition count 140
Iterating global reduction 0 with 7 rules applied. Total rules applied 152 place count 97 transition count 140
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 155 place count 94 transition count 134
Iterating global reduction 0 with 3 rules applied. Total rules applied 158 place count 94 transition count 134
Applied a total of 158 rules in 12 ms. Remains 94 /175 variables (removed 81) and now considering 134/762 (removed 628) transitions.
// Phase 1: matrix 134 rows 94 cols
[2025-06-08 03:14:09] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-08 03:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:09] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2025-06-08 03:14:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:10] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:10] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:10] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/228 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 109 constraints, problems are : Problem set: 0 solved, 133 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:14] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (OVERLAPS) 134/228 variables, 94/110 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 133/243 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:15] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:15] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 5/248 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:16] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:17] [INFO ] Deduced a trap along path composed of 4 places in 41 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:17] [INFO ] Deduced a trap along path composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 251 constraints, problems are : Problem set: 0 solved, 133 unsolved in 11585 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 15990ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 15990ms
Starting structural reductions in LTL mode, iteration 1 : 94/175 places, 134/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16118 ms. Remains : 94/175 places, 134/762 transitions.
[2025-06-08 03:14:25] [INFO ] Flatten gal took : 7 ms
[2025-06-08 03:14:25] [INFO ] Flatten gal took : 6 ms
[2025-06-08 03:14:25] [INFO ] Input system was already deterministic with 134 transitions.
[2025-06-08 03:14:25] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:25] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7632082343959191528.gal : 1 ms
[2025-06-08 03:14:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2959271040993498303.ctl : 1 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7632082343959191528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2959271040993498303.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.45523e+08,0.119896,9184,2,3203,5,22577,6,0,512,21022,0
Converting to forward existential form...Done !
original formula: A(!(AX(((p164==0)||(p190==1)))) U AG(AX(AF(((p107==0)||(p151==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(EX(!(!(EG(!(((p107==0)||(p151==1))))))))))))))) * !(E(!(!(E(TRUE U !(!(EX(!(!(EG...310
Reverse transition relation is NOT exact ! Due to transitions t7, t10, t11, t12, t15, t31, t33, t42, t50, t53, t57, t59, t60, t64, t65, t69, t70, t73, t74,...302
(forward)formula 0,0,2.77835,93496,1,0,297,528336,298,143,3707,413509,364
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 137 transition count 402
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 137 transition count 402
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 93 place count 120 transition count 358
Iterating global reduction 0 with 17 rules applied. Total rules applied 110 place count 120 transition count 358
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 119 place count 111 transition count 250
Ensure Unique test removed 3 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 131 place count 108 transition count 250
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 137 place count 102 transition count 146
Iterating global reduction 0 with 6 rules applied. Total rules applied 143 place count 102 transition count 146
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 146 place count 99 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 149 place count 99 transition count 140
Applied a total of 149 rules in 7 ms. Remains 99 /175 variables (removed 76) and now considering 140/762 (removed 622) transitions.
// Phase 1: matrix 140 rows 99 cols
[2025-06-08 03:14:28] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-08 03:14:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:28] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 139 sub problems to find dead transitions.
[2025-06-08 03:14:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:29] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:29] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:29] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 5 (OVERLAPS) 140/239 variables, 99/114 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 0/239 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 114 constraints, problems are : Problem set: 0 solved, 139 unsolved in 4536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:33] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 7 (OVERLAPS) 140/239 variables, 99/116 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 139/255 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:34] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/256 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:35] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:35] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:35] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:35] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:37] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:38] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/239 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:39] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:39] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/239 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 139 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:41] [INFO ] Deduced a trap along path composed of 5 places in 48 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:41] [INFO ] Deduced a trap along path composed of 6 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 03:14:41] [INFO ] Deduced a trap along path composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/239 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
At refinement iteration 16 (OVERLAPS) 0/239 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 139 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 268 constraints, problems are : Problem set: 0 solved, 139 unsolved in 17261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 139/139 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21814ms problems are : Problem set: 0 solved, 139 unsolved
Search for dead transitions found 0 dead transitions in 21814ms
Starting structural reductions in LTL mode, iteration 1 : 99/175 places, 140/762 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21984 ms. Remains : 99/175 places, 140/762 transitions.
[2025-06-08 03:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:50] [INFO ] Input system was already deterministic with 140 transitions.
[2025-06-08 03:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:50] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality18384076440197405784.gal : 1 ms
[2025-06-08 03:14:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7958260840424375346.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality18384076440197405784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7958260840424375346.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05484e+09,0.276078,15076,2,5719,5,42369,6,0,538,50451,0
Converting to forward existential form...Done !
original formula: EG(EF(!(E((((p10==0)||(p24==1)) + AX((p133==0))) U E(((p136==0)||(p173==1)) U (p129==0))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E((((p10==0)||(p24==1)) + !(EX(!((p133==0))))) U E(((p136==0)||(p173==1)) U (p129==0))))))...165
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t10, t12, t15, t43, t44, t48, t51, t53, t57, t60, t61, t65, t66, t70, t71, t74, t75, ...312
(forward)formula 0,0,2.12202,72676,1,0,301,317522,315,143,3804,332011,347
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Graph (trivial) has 144 edges and 175 vertex of which 6 / 175 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 171 transition count 714
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 89 place count 127 transition count 714
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 89 place count 127 transition count 705
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 107 place count 118 transition count 705
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 134 place count 91 transition count 356
Iterating global reduction 2 with 27 rules applied. Total rules applied 161 place count 91 transition count 356
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 161 place count 91 transition count 353
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 88 transition count 353
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 82 transition count 278
Ensure Unique test removed 1 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 180 place count 81 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 185 place count 76 transition count 132
Iterating global reduction 2 with 5 rules applied. Total rules applied 190 place count 76 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 192 place count 74 transition count 128
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 74 transition count 128
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 246 place count 48 transition count 102
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 251 place count 43 transition count 67
Ensure Unique test removed 2 places
Iterating global reduction 2 with 7 rules applied. Total rules applied 258 place count 41 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 261 place count 41 transition count 64
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 263 place count 39 transition count 58
Iterating global reduction 3 with 2 rules applied. Total rules applied 265 place count 39 transition count 58
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 267 place count 37 transition count 54
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 37 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 273 place count 37 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 281 place count 33 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 282 place count 32 transition count 45
Applied a total of 282 rules in 44 ms. Remains 32 /175 variables (removed 143) and now considering 45/762 (removed 717) transitions.
[2025-06-08 03:14:52] [INFO ] Flow matrix only has 37 transitions (discarded 8 similar events)
// Phase 1: matrix 37 rows 32 cols
[2025-06-08 03:14:52] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:52] [INFO ] Implicit Places using invariants in 215 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 217 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/175 places, 45/762 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 44
Applied a total of 2 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2025-06-08 03:14:52] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
// Phase 1: matrix 36 rows 30 cols
[2025-06-08 03:14:52] [INFO ] Computed 11 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:52] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-08 03:14:52] [INFO ] Flow matrix only has 36 transitions (discarded 8 similar events)
[2025-06-08 03:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-08 03:14:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 30/175 places, 44/762 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 345 ms. Remains : 30/175 places, 44/762 transitions.
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:14:52] [INFO ] Input system was already deterministic with 44 transitions.
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 1 ms
[2025-06-08 03:14:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality11300851156762722993.gal : 1 ms
[2025-06-08 03:14:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17225024091943836937.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11300851156762722993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17225024091943836937.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,21060,0.016128,4104,2,196,5,928,6,0,164,817,0
Converting to forward existential form...Done !
original formula: EF(AG((p68==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p68==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.026143,4488,1,0,6,3678,15,0,843,1428,5
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 134 transition count 399
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 134 transition count 399
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 101 place count 115 transition count 327
Ensure Unique test removed 1 places
Iterating global reduction 0 with 20 rules applied. Total rules applied 121 place count 114 transition count 327
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 131 place count 104 transition count 191
Ensure Unique test removed 2 places
Iterating global reduction 0 with 12 rules applied. Total rules applied 143 place count 102 transition count 191
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 148 place count 97 transition count 141
Iterating global reduction 0 with 5 rules applied. Total rules applied 153 place count 97 transition count 141
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 155 place count 95 transition count 137
Iterating global reduction 0 with 2 rules applied. Total rules applied 157 place count 95 transition count 137
Applied a total of 157 rules in 13 ms. Remains 95 /175 variables (removed 80) and now considering 137/762 (removed 625) transitions.
// Phase 1: matrix 137 rows 95 cols
[2025-06-08 03:14:52] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:52] [INFO ] Implicit Places using invariants in 37 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/175 places, 137/762 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 94/175 places, 137/762 transitions.
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 7 ms
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:14:52] [INFO ] Input system was already deterministic with 137 transitions.
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:52] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality2799164196930844935.gal : 1 ms
[2025-06-08 03:14:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality13311503267116579576.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2799164196930844935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13311503267116579576.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.39254e+08,0.201302,11780,2,4865,5,33656,6,0,515,28921,0
Converting to forward existential form...Done !
original formula: EF(((AX(FALSE) * (p84==1)) * AG(((p92==0)&&(p97==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (!(EX(!(FALSE))) * (p84==1))) * !(E(TRUE U !(((p92==0)&&(p97==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t8, t10, t12, t15, t40, t43, t48, t52, t61, t62, t66, t67, t70, t71, t72, t75, t76, t80, ...296
(forward)formula 0,0,1.51185,52976,1,0,237,246520,296,127,3729,202950,287
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 762/762 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 139 transition count 404
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 139 transition count 404
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 87 place count 124 transition count 362
Iterating global reduction 0 with 15 rules applied. Total rules applied 102 place count 124 transition count 362
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 109 place count 117 transition count 260
Ensure Unique test removed 1 places
Iterating global reduction 0 with 8 rules applied. Total rules applied 117 place count 116 transition count 260
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 122 place count 111 transition count 166
Iterating global reduction 0 with 5 rules applied. Total rules applied 127 place count 111 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 130 place count 108 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 133 place count 108 transition count 160
Applied a total of 133 rules in 14 ms. Remains 108 /175 variables (removed 67) and now considering 160/762 (removed 602) transitions.
// Phase 1: matrix 160 rows 108 cols
[2025-06-08 03:14:54] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 03:14:54] [INFO ] Implicit Places using invariants in 58 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 107/175 places, 160/762 transitions.
Applied a total of 0 rules in 1 ms. Remains 107 /107 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 107/175 places, 160/762 transitions.
[2025-06-08 03:14:54] [INFO ] Flatten gal took : 3 ms
[2025-06-08 03:14:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:14:54] [INFO ] Input system was already deterministic with 160 transitions.
[2025-06-08 03:14:54] [INFO ] Flatten gal took : 4 ms
[2025-06-08 03:14:54] [INFO ] Flatten gal took : 10 ms
[2025-06-08 03:14:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality2482376757160122731.gal : 1 ms
[2025-06-08 03:14:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13186472230574096665.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2482376757160122731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13186472230574096665.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.0188e+09,0.227786,13520,2,5461,5,37049,6,0,590,34552,0
Converting to forward existential form...Done !
original formula: AF((AG((E((((p128==0)||(p28==1))||(p185==0)) U (p10==1)) + EG((p66==1)))) * AX(EF(EG(((p188==0)||(p112==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((E((((p128==0)||(p28==1))||(p185==0)) U (p10==1)) + EG((p66==1)))))) * !(EX(!(E(TRUE ...199
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t13, t16, t18, t20, t45, t53, t55, t62, t63, t67, t69, t71, t73, t74, t77, t78,...307
(forward)formula 0,0,16.7498,489840,1,0,1023,2.57904e+06,361,576,4990,2.97599e+06,988
FORMULA ErlangenMainframeV0-PT-0505-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-08 03:15:11] [INFO ] Flatten gal took : 43 ms
[2025-06-08 03:15:11] [INFO ] Flatten gal took : 40 ms
Total runtime 240513 ms.
BK_STOP 1749352511489
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="ErlangenMainframeV0-PT-0505"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5832"
echo " Executing tool itstools"
echo " Input is ErlangenMainframeV0-PT-0505, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339600273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ErlangenMainframeV0-PT-0505.tgz
mv ErlangenMainframeV0-PT-0505 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;