About the Execution of LTSMin+red for QuasiCertifProtocol-PT-06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 412.119 | 30805.00 | 54668.00 | 105.50 | FTF??TT???F??F?T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337700065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 14K Apr 13 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 13 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 03:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 03:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 78K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717219746121
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:29:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:29:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:29:07] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 05:29:07] [INFO ] Transformed 270 places.
[2024-06-01 05:29:07] [INFO ] Transformed 116 transitions.
[2024-06-01 05:29:07] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 184 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Support contains 270 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Applied a total of 0 rules in 8 ms. Remains 270 /270 variables (removed 0) and now considering 116/116 (removed 0) transitions.
// Phase 1: matrix 116 rows 270 cols
[2024-06-01 05:29:07] [INFO ] Computed 155 invariants in 23 ms
[2024-06-01 05:29:07] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-01 05:29:07] [INFO ] Invariant cache hit.
[2024-06-01 05:29:08] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 108 sub problems to find dead transitions.
[2024-06-01 05:29:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 12/263 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 10 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:29:09] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 7/270 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-06-01 05:29:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:29:11] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:29:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 116/386 variables, 270/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 434 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6731 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 12/263 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 7/270 variables, 50/161 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 116/386 variables, 270/434 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 108/542 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 542 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6324 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 9/9 constraints]
After SMT, in 13173ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 13193ms
Finished structural reductions in LTL mode , in 1 iterations and 13726 ms. Remains : 270/270 places, 116/116 transitions.
Support contains 270 out of 270 places after structural reductions.
[2024-06-01 05:29:21] [INFO ] Flatten gal took : 50 ms
[2024-06-01 05:29:21] [INFO ] Flatten gal took : 17 ms
[2024-06-01 05:29:21] [INFO ] Input system was already deterministic with 116 transitions.
RANDOM walk for 40000 steps (3935 resets) in 1989 ms. (20 steps per ms) remains 87/99 properties
BEST_FIRST walk for 4002 steps (70 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (72 resets) in 45 ms. (87 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (71 resets) in 52 ms. (75 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (70 resets) in 60 ms. (65 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (65 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (66 resets) in 46 ms. (85 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (57 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (69 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (72 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (70 resets) in 19 ms. (200 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (88 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (68 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (68 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (67 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (67 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (72 resets) in 34 ms. (114 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (66 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (50 resets) in 36 ms. (108 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (70 resets) in 29 ms. (133 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (75 resets) in 26 ms. (148 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (65 resets) in 20 ms. (190 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (74 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (68 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (69 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (67 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (69 resets) in 33 ms. (117 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (88 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (66 resets) in 20 ms. (190 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (67 resets) in 21 ms. (181 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (43 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (70 resets) in 30 ms. (129 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (65 resets) in 27 ms. (142 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (88 resets) in 28 ms. (138 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (27 resets) in 16 ms. (235 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (69 resets) in 23 ms. (166 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (67 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (68 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (70 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (88 resets) in 27 ms. (143 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (69 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (88 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (71 resets) in 24 ms. (160 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (66 resets) in 21 ms. (181 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (63 resets) in 25 ms. (153 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (73 resets) in 20 ms. (190 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4004 steps (44 resets) in 14 ms. (266 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4003 steps (68 resets) in 20 ms. (190 steps per ms) remains 87/87 properties
[2024-06-01 05:29:22] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp48 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 2/2 constraints. Problems are: Problem set: 13 solved, 74 unsolved
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 140/142 constraints. Problems are: Problem set: 17 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/142 constraints. Problems are: Problem set: 17 solved, 70 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/258 variables, 1/143 constraints. Problems are: Problem set: 32 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/143 constraints. Problems are: Problem set: 32 solved, 55 unsolved
At refinement iteration 5 (OVERLAPS) 12/270 variables, 12/155 constraints. Problems are: Problem set: 32 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/155 constraints. Problems are: Problem set: 32 solved, 55 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp97 is UNSAT
At refinement iteration 7 (OVERLAPS) 116/386 variables, 270/425 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 58 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 58 solved, 29 unsolved in 2484 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 152/152 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 58 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 92/92 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:29:25] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 7/99 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/99 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 33/241 variables, 3/102 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 42/144 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 3 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:29:26] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 8 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 20/164 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 13/177 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:28] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 1/178 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 1/179 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/179 constraints. Problems are: Problem set: 58 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 21/262 variables, 14/193 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/262 variables, 2/195 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:29] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/262 variables, 1/196 constraints. Problems are: Problem set: 58 solved, 29 unsolved
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
[2024-06-01 05:29:30] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 262/386 variables, and 200 constraints, problems are : Problem set: 58 solved, 29 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 148/152 constraints, State Equation: 0/270 constraints, PredecessorRefiner: 0/87 constraints, Known Traps: 49/49 constraints]
After SMT, in 7534ms problems are : Problem set: 58 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 208 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 262 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 248 transition count 93
Applied a total of 38 rules in 20 ms. Remains 248 /270 variables (removed 22) and now considering 93/116 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 248/270 places, 93/116 transitions.
RANDOM walk for 40000 steps (3999 resets) in 853 ms. (46 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (73 resets) in 30 ms. (129 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (88 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (70 resets) in 20 ms. (190 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (49 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (71 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (69 resets) in 33 ms. (117 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (74 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (88 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (70 resets) in 25 ms. (153 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (71 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (73 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (72 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (71 resets) in 23 ms. (166 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (68 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (70 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (69 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (69 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (72 resets) in 25 ms. (154 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (71 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (69 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (71 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (68 resets) in 31 ms. (125 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (68 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (74 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (68 resets) in 15 ms. (250 steps per ms) remains 18/28 properties
// Phase 1: matrix 93 rows 248 cols
[2024-06-01 05:29:30] [INFO ] Computed 155 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 2/196 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 37/233 variables, 43/142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 13/246 variables, 13/155 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 92/338 variables, 246/401 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 3/341 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/341 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 403 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 153/153 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 2/196 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 13/99 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 6/106 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 37/233 variables, 43/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 13/246 variables, 13/162 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (OVERLAPS) 92/338 variables, 246/408 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 16/424 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 3/341 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/341 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 428 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3781 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 153/153 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 7/7 constraints]
After SMT, in 4911ms problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 16 different solutions.
Finished Parikh walk after 59 steps, including 0 resets, run visited all 6 properties in 3 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 18 properties in 214 ms.
Successfully simplified 58 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:29:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:29:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 14 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
Support contains 86 out of 270 places (down from 181) after GAL structural reductions.
Computed a total of 270 stabilizing places and 116 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 270 transition count 116
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 2 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 245 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 19 ms. Remains 244 /270 variables (removed 26) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 244/270 places, 113/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 16 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 244 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 243 transition count 113
Applied a total of 2 rules in 19 ms. Remains 243 /270 variables (removed 27) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 243/270 places, 113/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 244 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.2 ms
Discarding 26 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 10 ms. Remains 243 /270 variables (removed 27) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 243/270 places, 113/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 5 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 9 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 5 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 05:29:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
FORMULA QuasiCertifProtocol-PT-06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 245 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 244 transition count 113
Applied a total of 2 rules in 18 ms. Remains 244 /270 variables (removed 26) and now considering 113/116 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 244/270 places, 113/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 4 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 116/116 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 252 transition count 116
Applied a total of 18 rules in 5 ms. Remains 252 /270 variables (removed 18) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 252/270 places, 116/116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 7 ms
[2024-06-01 05:29:36] [INFO ] Input system was already deterministic with 116 transitions.
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:29:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:29:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 270 places, 116 transitions and 659 arcs took 3 ms.
Total runtime 29314 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-04
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-07
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-09
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-11
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-12
Could not compute solution for formula : QuasiCertifProtocol-PT-06-CTLCardinality-2024-14
BK_STOP 1717219776926
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/726/ctl_0_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/726/ctl_1_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/726/ctl_2_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/726/ctl_3_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/726/ctl_4_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/726/ctl_5_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/726/ctl_6_
ctl formula name QuasiCertifProtocol-PT-06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/726/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-06, 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 r520-tall-171662337700065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;