About the Execution of ITS-Tools for PermAdmissibility-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 688996.00 | 0.00 | 0.00 | TFTTTTFTFFTTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812700497.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 PermAdmissibility-PT-01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812700497
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 277K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 605K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 484K May 29 14:32 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 PermAdmissibility-PT-01-CTLCardinality-2025-00
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-01
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-02
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-03
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-04
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-05
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-06
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-07
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-08
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-09
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-10
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-11
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-12
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-13
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-14
FORMULA_NAME PermAdmissibility-PT-01-CTLCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748899378711
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-02 21:22:59] [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-02 21:22:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:23:00] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2025-06-02 21:23:00] [INFO ] Transformed 168 places.
[2025-06-02 21:23:00] [INFO ] Transformed 592 transitions.
[2025-06-02 21:23:00] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 156 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Applied a total of 0 rules in 12 ms. Remains 168 /168 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 168 cols
[2025-06-02 21:23:00] [INFO ] Computed 32 invariants in 45 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:00] [INFO ] Implicit Places using invariants in 272 ms returned []
[2025-06-02 21:23:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:23:00] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2025-06-02 21:23:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD590 is UNSAT
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 40 solved, 548 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:05] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:06] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:06] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:06] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:06] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:07] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 124 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 6 ms to minimize.
Problem TDEAD182 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:08] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:09] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 4 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD573 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/48 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:11] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:12] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:12] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:13] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:13] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:13] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:13] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:14] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:14] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:14] [INFO ] Deduced a trap composed of 20 places in 144 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:14] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:15] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:15] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:15] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:15] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 15/63 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:16] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:17] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:23:19] [INFO ] Deduced a trap composed of 22 places in 132 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/66 constraints. Problems are: Problem set: 55 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/66 constraints. Problems are: Problem set: 55 solved, 533 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD202 is UNSAT
At refinement iteration 7 (OVERLAPS) 4/168 variables, 4/70 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 168/760 variables, and 70 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 64 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 61/164 variables, 25/28 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 38/66 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/66 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 5 (OVERLAPS) 4/168 variables, 4/70 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/70 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 7 (OVERLAPS) 592/760 variables, 168/238 constraints. Problems are: Problem set: 64 solved, 524 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 524/762 constraints. Problems are: Problem set: 64 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 760/760 variables, and 762 constraints, problems are : Problem set: 64 solved, 524 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 524/588 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60882ms problems are : Problem set: 64 solved, 524 unsolved
Search for dead transitions found 64 dead transitions in 60900ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 168/168 places, 528/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61584 ms. Remains : 168/168 places, 528/592 transitions.
Support contains 156 out of 168 places after structural reductions.
[2025-06-02 21:24:02] [INFO ] Flatten gal took : 78 ms
[2025-06-02 21:24:02] [INFO ] Flatten gal took : 50 ms
[2025-06-02 21:24:02] [INFO ] Input system was already deterministic with 528 transitions.
RANDOM walk for 40000 steps (2352 resets) in 2136 ms. (18 steps per ms) remains 48/111 properties
BEST_FIRST walk for 4004 steps (80 resets) in 77 ms. (51 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 53 ms. (74 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 44 ms. (88 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 43 ms. (91 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 26 ms. (148 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 43 ms. (91 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 47 ms. (83 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 27 ms. (143 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 25 ms. (154 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (80 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
// Phase 1: matrix 528 rows 168 cols
[2025-06-02 21:24:03] [INFO ] Computed 32 invariants in 12 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp103 is UNSAT
After SMT solving in domain Real declared 168/696 variables, and 32 constraints, problems are : Problem set: 48 solved, 0 unsolved in 413 ms.
Refiners :[Generalized P Invariants (flows): 32/32 constraints, State Equation: 0/168 constraints, PredecessorRefiner: 48/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 482ms problems are : Problem set: 48 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 21:24:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2025-06-02 21:24:04] [INFO ] Flatten gal took : 38 ms
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 21:24:04] [INFO ] Flatten gal took : 36 ms
[2025-06-02 21:24:04] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 67 out of 168 places (down from 86) after GAL structural reductions.
Computed a total of 168 stabilizing places and 528 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 528
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 4 formulas.
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 528
Applied a total of 64 rules in 14 ms. Remains 104 /168 variables (removed 64) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 104 cols
[2025-06-02 21:24:04] [INFO ] Computed 16 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:24:04] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-02 21:24:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:24:05] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2025-06-02 21:24:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 120 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 10/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 524/644 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 644 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60491ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60497ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 528/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61890 ms. Remains : 104/168 places, 528/528 transitions.
[2025-06-02 21:25:06] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:25:06] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:25:06] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:25:06] [INFO ] Flatten gal took : 41 ms
[2025-06-02 21:25:06] [INFO ] Flatten gal took : 37 ms
[2025-06-02 21:25:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality5853693277974095041.gal : 15 ms
[2025-06-02 21:25:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality5997826465134726489.ctl : 2 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/CTLCardinality5853693277974095041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5997826465134726489.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,9862,1.85541,77924,2,17170,5,54715,6,0,938,22190,0
Converting to forward existential form...Done !
original formula: EG(EF(AG(AX(FALSE))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !(!(EX(!(FALSE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2261
(forward)formula 0,1,14.6821,493252,1,0,1325,2.12906e+06,1079,546,13480,684591,1126
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 112 transition count 528
Applied a total of 56 rules in 9 ms. Remains 112 /168 variables (removed 56) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 112 cols
[2025-06-02 21:25:21] [INFO ] Computed 17 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:21] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 21:25:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:25:22] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2025-06-02 21:25:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 9/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:25] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:26] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:29] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 528/640 variables, 112/155 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 155 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 9/112 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 21:25:55] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 528/640 variables, 112/156 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 524/680 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/640 variables, and 680 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60467ms
Starting structural reductions in LTL mode, iteration 1 : 112/168 places, 528/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61712 ms. Remains : 112/168 places, 528/528 transitions.
[2025-06-02 21:26:22] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:26:22] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:26:22] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:26:23] [INFO ] Flatten gal took : 35 ms
[2025-06-02 21:26:23] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:26:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality3631483901689342388.gal : 6 ms
[2025-06-02 21:26:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality13555286495417208832.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/CTLCardinality3631483901689342388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13555286495417208832.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,12209,2.30304,96304,2,18981,5,63144,6,0,946,29187,0
Converting to forward existential form...Done !
original formula: EF(EX((c13<=(((out1_0+out1_6)+(out1_5+out1_7))+((out1_2+out1_1)+(out1_4+out1_3))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (c13<=(((out1_0+out1_6)+(out1_5+out1_7))+((out1_2+out1_1)+(out1_4+out1_3)))))] != FALSE
(forward)formula 0,1,3.82851,98352,1,0,9,63867,8,1,2677,29187,2
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 112 transition count 528
Applied a total of 56 rules in 4 ms. Remains 112 /168 variables (removed 56) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 112 cols
[2025-06-02 21:26:26] [INFO ] Computed 16 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:26:27] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-02 21:26:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:26:28] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1185 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2025-06-02 21:26:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 8/640 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/640 variables, and 128 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 300/420 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/640 variables, and 420 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/112 constraints, PredecessorRefiner: 300/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60457ms
Starting structural reductions in LTL mode, iteration 1 : 112/168 places, 528/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61649 ms. Remains : 112/168 places, 528/528 transitions.
[2025-06-02 21:27:28] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-02 21:27:28] [INFO ] Flatten gal took : 19 ms
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-02 21:27:28] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:27:28] [INFO ] Input system was already deterministic with 528 transitions.
Support contains 0 out of 112 places (down from 15) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 106 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.4 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 106 /168 variables (removed 62) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 106 cols
[2025-06-02 21:27:28] [INFO ] Computed 16 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:28] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 21:27:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:27:29] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:27:30] [INFO ] Redundant transitions in 39 ms returned []
Running 524 sub problems to find dead transitions.
[2025-06-02 21:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 2/634 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 634/634 variables, and 122 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 412/532 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/634 variables, and 532 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/106 constraints, PredecessorRefiner: 412/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Starting structural reductions in SI_CTL mode, iteration 1 : 106/168 places, 528/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61796 ms. Remains : 106/168 places, 528/528 transitions.
[2025-06-02 21:28:30] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:28:30] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:28:30] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:28:30] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:28:30] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:28:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality4363805284796680966.gal : 4 ms
[2025-06-02 21:28:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality1009048774407683910.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/CTLCardinality4363805284796680966.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1009048774407683910.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,9907,2.39524,95888,2,19043,5,61833,6,0,940,28824,0
Converting to forward existential form...Done !
original formula: EF(AG(!(E(E((out6_2>=1) U (c17>=1)) U ((out7_1<=0)&&(aux11_0>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E(E((out6_2>=1) U (c17>=1)) U ((out7_1<=0)&&(aux11_0>=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t2...2232
(forward)formula 0,1,17.4378,526124,1,0,1302,2.05832e+06,1085,531,12965,662362,1081
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 108 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.3 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 108 /168 variables (removed 60) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 108 cols
[2025-06-02 21:28:48] [INFO ] Computed 16 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:28:48] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-02 21:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:28:49] [INFO ] Implicit Places using invariants and state equation in 1131 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:28:49] [INFO ] Redundant transitions in 4 ms returned []
Running 524 sub problems to find dead transitions.
[2025-06-02 21:28:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 4/636 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/636 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/636 variables, and 124 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 300/420 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/636 variables, and 420 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/108 constraints, PredecessorRefiner: 300/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60432ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60433ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/168 places, 528/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61698 ms. Remains : 108/168 places, 528/528 transitions.
[2025-06-02 21:29:49] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:29:49] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:29:50] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:29:50] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:29:50] [INFO ] Flatten gal took : 18 ms
[2025-06-02 21:29:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality16697145471372901063.gal : 3 ms
[2025-06-02 21:29:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality1523014366485522171.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/CTLCardinality16697145471372901063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1523014366485522171.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,10625,2.68939,97460,2,20976,5,70500,6,0,942,33820,0
Converting to forward existential form...Done !
original formula: ((EG((aux16_3<=0)) + AF((E(((out8_4>=1)&&(aux7_2<=0)) U ((aux13_3>=1)||(out2_3<=out4_6))) * AF(((aux12_6<=in3_4)&&(out7_1>=1)))))) * (EG(...187
=> equivalent forward existential formula: ([FwdG((Init * !(EG((aux16_3<=0)))),!((E(((out8_4>=1)&&(aux7_2<=0)) U ((aux13_3>=1)||(out2_3<=out4_6))) * !(EG(!...266
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...2256
(forward)formula 0,1,23.2457,600184,1,0,1561,2.76066e+06,1098,682,13210,845844,1391
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 110 transition count 528
Applied a total of 58 rules in 10 ms. Remains 110 /168 variables (removed 58) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 110 cols
[2025-06-02 21:30:13] [INFO ] Computed 16 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:30:13] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 21:30:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:30:14] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2025-06-02 21:30:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 6/638 variables, 6/126 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 0.0)
(t3 0.0)
(t4 0.0)
(t5 0.0)
(t6 0.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 0.0)
(t19 0.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 0.0)
(t32 0.0)
(t33 0.0)
(t34 0.0)
(t35 0.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 0.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 0.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 638/638 variables, and 126 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 300/420 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/638 variables, and 420 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/110 constraints, PredecessorRefiner: 300/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60436ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Starting structural reductions in LTL mode, iteration 1 : 110/168 places, 528/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61605 ms. Remains : 110/168 places, 528/528 transitions.
[2025-06-02 21:31:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:31:15] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:31:15] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:31:15] [INFO ] Flatten gal took : 26 ms
[2025-06-02 21:31:15] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:31:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4486288803642144106.gal : 4 ms
[2025-06-02 21:31:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality13777973478928130913.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/CTLCardinality4486288803642144106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13777973478928130913.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,11127,2.74666,99760,2,20661,5,65918,6,0,944,31158,0
Converting to forward existential form...Done !
original formula: E(((AX((aux13_2<=aux11_5)) * (aux5_0>out7_7)) * (!((EX(E((out6_2<=aux14_7) U (out4_4>=1))) * !(((aux7_7>=1)||(out2_0<=aux10_7))))) + AF((...289
=> equivalent forward existential formula: [FwdG(FwdU(Init,((!(EX(!((aux13_2<=aux11_5)))) * (aux5_0>out7_7)) * (!((EX(E((out6_2<=aux14_7) U (out4_4>=1))) *...460
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2256
(forward)formula 0,1,28.5354,726324,1,0,1628,3.4518e+06,1106,722,13403,1.06114e+06,1427
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 109 transition count 528
Applied a total of 59 rules in 8 ms. Remains 109 /168 variables (removed 59) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 109 cols
[2025-06-02 21:31:44] [INFO ] Computed 16 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2025-06-02 21:31:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:31:45] [INFO ] Implicit Places using invariants and state equation in 1063 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
Running 524 sub problems to find dead transitions.
[2025-06-02 21:31:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 5/637 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 637/637 variables, and 125 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 307/427 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/637 variables, and 427 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/109 constraints, PredecessorRefiner: 307/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60443ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 109/168 places, 528/528 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61631 ms. Remains : 109/168 places, 528/528 transitions.
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 17 ms
[2025-06-02 21:32:45] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 20 ms
[2025-06-02 21:32:45] [INFO ] Flatten gal took : 24 ms
[2025-06-02 21:32:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7299961514139835589.gal : 3 ms
[2025-06-02 21:32:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality984874780663019477.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/CTLCardinality7299961514139835589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality984874780663019477.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 -...282
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,10167,2.03687,77612,2,17140,5,56669,6,0,943,23563,0
Converting to forward existential form...Done !
original formula: EF((((AX((aux16_1>out4_6)) * EF((aux14_3>c12))) * (!(A((aux14_2<=c18) U (aux12_7<=0))) * (E((aux13_6<=0) U (in1_1<=out8_2)) + AX((out5_3<...246
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((!(EX(!((aux16_1>out4_6)))) * E(TRUE U (aux14_3>c12))) * (!(!((E(!((aux12_7<=0)) U (!((a...861
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2251
Hit Full ! (commute/partial/dont) 416/0/112
(forward)formula 0,1,17.7971,541216,1,0,1388,2.51939e+06,1110,565,13762,749865,1150
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 168/168 places, 528/528 transitions.
Graph (complete) has 1551 edges and 168 vertex of which 108 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.2 ms
Discarding 60 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 17 ms. Remains 108 /168 variables (removed 60) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 108 cols
[2025-06-02 21:33:03] [INFO ] Computed 16 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:04] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-02 21:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 21:33:05] [INFO ] Implicit Places using invariants and state equation in 1071 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 21:33:05] [INFO ] Redundant transitions in 7 ms returned []
Running 524 sub problems to find dead transitions.
[2025-06-02 21:33:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 6 (OVERLAPS) 4/636 variables, 4/124 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 636/636 variables, and 124 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 524/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 524 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 4 (OVERLAPS) 528/632 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 524 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 300/420 constraints. Problems are: Problem set: 0 solved, 524 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/636 variables, and 420 constraints, problems are : Problem set: 0 solved, 524 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/108 constraints, PredecessorRefiner: 300/524 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 524 unsolved
Search for dead transitions found 0 dead transitions in 60459ms
Starting structural reductions in SI_CTL mode, iteration 1 : 108/168 places, 528/528 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61681 ms. Remains : 108/168 places, 528/528 transitions.
[2025-06-02 21:34:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:34:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:34:05] [INFO ] Input system was already deterministic with 528 transitions.
[2025-06-02 21:34:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:34:05] [INFO ] Flatten gal took : 16 ms
[2025-06-02 21:34:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8410470493707392515.gal : 3 ms
[2025-06-02 21:34:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality15074138687045613119.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/CTLCardinality8410470493707392515.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15074138687045613119.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,11434,3.14499,108972,2,22007,5,68470,6,0,942,32720,0
Converting to forward existential form...Done !
original formula: AF(((out1_4>=1) + ((EF((out2_0<1)) * !(A((in1_0>=1) U (out3_5<=out6_6)))) * (c11>0))))
=> equivalent forward existential formula: [FwdG(Init,!(((out1_4>=1) + ((E(TRUE U (out2_0<1)) * !(!((E(!((out3_5<=out6_6)) U (!((in1_0>=1)) * !((out3_5<=ou...216
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...2255
(forward)formula 0,0,21.5842,629004,1,0,1391,2.41951e+06,1093,572,13594,870255,1142
FORMULA PermAdmissibility-PT-01-CTLCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 19 ms
[2025-06-02 21:34:27] [INFO ] Flatten gal took : 18 ms
Total runtime 687754 ms.
BK_STOP 1748900067707
--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="PermAdmissibility-PT-01"
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 PermAdmissibility-PT-01, 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 r142-tall-174876812700497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-01.tgz
mv PermAdmissibility-PT-01 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 ;