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.r579-smll-171734921100058.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 MedleyA-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921100058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 MedleyA-PT-08-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-08-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717354086280

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:48:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:48:08] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2024-06-02 18:48:08] [INFO ] Transformed 147 places.
[2024-06-02 18:48:08] [INFO ] Transformed 312 transitions.
[2024-06-02 18:48:08] [INFO ] Found NUPN structural information;
[2024-06-02 18:48:08] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 290 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 23 ms.
Support contains 64 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 118 transition count 280
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 118 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 118 transition count 279
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 117 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 117 transition count 278
Applied a total of 59 rules in 60 ms. Remains 117 /147 variables (removed 30) and now considering 278/312 (removed 34) transitions.
// Phase 1: matrix 278 rows 117 cols
[2024-06-02 18:48:08] [INFO ] Computed 10 invariants in 29 ms
[2024-06-02 18:48:08] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-06-02 18:48:08] [INFO ] Invariant cache hit.
[2024-06-02 18:48:09] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2024-06-02 18:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Problem TDEAD133 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/117 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:12] [INFO ] Deduced a trap composed of 34 places in 169 ms of which 28 ms to minimize.
[2024-06-02 18:48:12] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2024-06-02 18:48:12] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 2 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 18:48:13] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2024-06-02 18:48:14] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 11/21 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:48:15] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 2/23 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:16] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 1/24 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/24 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 7 (OVERLAPS) 278/395 variables, 117/141 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:19] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-06-02 18:48:19] [INFO ] Deduced a trap composed of 33 places in 107 ms of which 5 ms to minimize.
[2024-06-02 18:48:20] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 3/144 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:22] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 1/145 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/145 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 11 (OVERLAPS) 0/395 variables, 0/145 constraints. Problems are: Problem set: 48 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 145 constraints, problems are : Problem set: 48 solved, 229 unsolved in 17422 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 48 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 6/6 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 2 (OVERLAPS) 1/117 variables, 4/10 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 18/28 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 278/395 variables, 117/145 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/395 variables, 229/374 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:32] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 18 ms to minimize.
[2024-06-02 18:48:32] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 2/376 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/376 constraints. Problems are: Problem set: 48 solved, 229 unsolved
[2024-06-02 18:48:44] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/395 variables, 1/377 constraints. Problems are: Problem set: 48 solved, 229 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/377 constraints. Problems are: Problem set: 48 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 395/395 variables, and 377 constraints, problems are : Problem set: 48 solved, 229 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 229/277 constraints, Known Traps: 21/21 constraints]
After SMT, in 48209ms problems are : Problem set: 48 solved, 229 unsolved
Search for dead transitions found 48 dead transitions in 48247ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 117/147 places, 230/312 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 230/230 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49088 ms. Remains : 117/147 places, 230/312 transitions.
Support contains 64 out of 117 places after structural reductions.
[2024-06-02 18:48:57] [INFO ] Flatten gal took : 94 ms
[2024-06-02 18:48:58] [INFO ] Flatten gal took : 49 ms
[2024-06-02 18:48:58] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 63 out of 117 places (down from 64) after GAL structural reductions.
RANDOM walk for 40000 steps (1983 resets) in 3209 ms. (12 steps per ms) remains 42/63 properties
BEST_FIRST walk for 4003 steps (53 resets) in 97 ms. (40 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (48 resets) in 60 ms. (65 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (53 resets) in 55 ms. (71 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (54 resets) in 107 ms. (37 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (56 resets) in 71 ms. (55 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (58 resets) in 91 ms. (43 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (59 resets) in 34 ms. (114 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (50 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (61 resets) in 47 ms. (83 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (57 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (54 resets) in 26 ms. (148 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (54 resets) in 38 ms. (102 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (58 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (61 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (56 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (57 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (54 resets) in 18 ms. (210 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (57 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (48 resets) in 17 ms. (222 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (50 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (52 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (61 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (53 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (60 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (59 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (56 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (48 resets) in 36 ms. (108 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (59 resets) in 29 ms. (133 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (53 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (64 resets) in 28 ms. (137 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (55 resets) in 20 ms. (190 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (53 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (52 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (56 resets) in 27 ms. (143 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (53 resets) in 27 ms. (142 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (61 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (60 resets) in 25 ms. (153 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (56 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (51 resets) in 36 ms. (108 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4001 steps (54 resets) in 21 ms. (181 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (53 resets) in 19 ms. (200 steps per ms) remains 41/42 properties
// Phase 1: matrix 230 rows 117 cols
[2024-06-02 18:48:59] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/76 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 36 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/110 variables, 6/10 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 224/334 variables, 110/120 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/120 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 10/344 variables, 5/125 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 0/125 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 9 (OVERLAPS) 3/347 variables, 2/127 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/127 constraints. Problems are: Problem set: 10 solved, 31 unsolved
[2024-06-02 18:49:02] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/347 variables, 1/128 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/347 variables, 0/128 constraints. Problems are: Problem set: 10 solved, 31 unsolved
[2024-06-02 18:49:02] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/347 variables, 1/129 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/347 variables, 0/129 constraints. Problems are: Problem set: 10 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/347 variables, 0/129 constraints. Problems are: Problem set: 10 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 129 constraints, problems are : Problem set: 10 solved, 31 unsolved in 3644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 31 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp34 is UNSAT
At refinement iteration 1 (OVERLAPS) 37/74 variables, 4/4 constraints. Problems are: Problem set: 12 solved, 29 unsolved
[2024-06-02 18:49:03] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/5 constraints. Problems are: Problem set: 12 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 12 solved, 29 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 4 (OVERLAPS) 36/110 variables, 6/11 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 2/13 constraints. Problems are: Problem set: 14 solved, 27 unsolved
[2024-06-02 18:49:04] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 2 ms to minimize.
[2024-06-02 18:49:04] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 2/15 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 224/334 variables, 110/125 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 26/151 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/151 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 10/344 variables, 5/156 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 1/157 constraints. Problems are: Problem set: 14 solved, 27 unsolved
[2024-06-02 18:49:06] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/158 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 0/158 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 3/347 variables, 2/160 constraints. Problems are: Problem set: 14 solved, 27 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 0/160 constraints. Problems are: Problem set: 14 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 347/347 variables, and 160 constraints, problems are : Problem set: 14 solved, 27 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 27/41 constraints, Known Traps: 6/6 constraints]
After SMT, in 8869ms problems are : Problem set: 14 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 230/230 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 117 transition count 224
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 112 transition count 224
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 112 transition count 222
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 15 place count 110 transition count 222
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 24 place count 101 transition count 213
Iterating global reduction 2 with 9 rules applied. Total rules applied 33 place count 101 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 101 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 100 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 100 transition count 209
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 51 place count 93 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 92 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 92 transition count 202
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 89 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 88 place count 89 transition count 189
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 88 place count 89 transition count 186
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 94 place count 86 transition count 186
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 86 transition count 184
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 84 transition count 184
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 84 transition count 180
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 106 place count 80 transition count 180
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 115 place count 80 transition count 180
Applied a total of 115 rules in 127 ms. Remains 80 /117 variables (removed 37) and now considering 180/230 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 80/117 places, 180/230 transitions.
RANDOM walk for 40000 steps (3002 resets) in 1010 ms. (39 steps per ms) remains 16/27 properties
BEST_FIRST walk for 4002 steps (69 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (71 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (70 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (84 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (77 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (105 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (63 resets) in 17 ms. (222 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (90 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (75 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (89 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (74 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (68 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (72 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (83 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (69 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (71 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
// Phase 1: matrix 180 rows 80 cols
[2024-06-02 18:49:09] [INFO ] Computed 9 invariants in 2 ms
[2024-06-02 18:49:09] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 13/74 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 177/251 variables, 74/82 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 5/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 9/260 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/260 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/260 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 18:49:09] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:49:10] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/260 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (OVERLAPS) 0/260 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 97 constraints, problems are : Problem set: 0 solved, 15 unsolved in 921 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 36/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 13/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-06-02 18:49:10] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:49:10] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 177/251 variables, 74/86 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 9/260 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 8/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 16 (OVERLAPS) 0/260 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 114 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1952 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 80/80 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 4/4 constraints]
After SMT, in 2914ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 12 properties in 4341 ms.
Support contains 10 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 180/180 transitions.
Graph (complete) has 339 edges and 80 vertex of which 77 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 77 transition count 169
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 75 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 19 place count 69 transition count 158
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 69 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 27 place count 67 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 67 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 66 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 66 transition count 150
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 42 place count 60 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 59 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 59 transition count 144
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 54 place count 54 transition count 193
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 70 place count 54 transition count 177
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 54 transition count 173
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 78 place count 50 transition count 173
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 82 place count 50 transition count 173
Applied a total of 82 rules in 70 ms. Remains 50 /80 variables (removed 30) and now considering 173/180 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 50/80 places, 173/180 transitions.
RANDOM walk for 40000 steps (4582 resets) in 194 ms. (205 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (1216 resets) in 91 ms. (434 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1362 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
// Phase 1: matrix 173 rows 50 cols
[2024-06-02 18:49:16] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:49:16] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 169/211 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/223 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/223 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/42 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 169/211 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 11/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/223 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:49:17] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 18:49:17] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/223 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 75 constraints, problems are : Problem set: 0 solved, 2 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 587ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 219 ms.
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 173/173 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 49 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 49 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 171
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 48 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 47 transition count 170
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 47 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 46 transition count 169
Applied a total of 8 rules in 41 ms. Remains 46 /50 variables (removed 4) and now considering 169/173 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 46/50 places, 169/173 transitions.
RANDOM walk for 40000 steps (4580 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1374 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Probably explored full state space saw : 126989 states, properties seen :0
Probabilistic random walk after 597338 steps, saw 126989 distinct states, run finished after 947 ms. (steps per millisecond=630 ) properties seen :0
Explored full state space saw : 126989 states, properties seen :0
Exhaustive walk after 597338 steps, saw 126989 distinct states, run finished after 659 ms. (steps per millisecond=906 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 230 transitions.
Support contains 45 out of 117 places (down from 51) after GAL structural reductions.
Computed a total of 9 stabilizing places and 10 stable transitions
Graph (complete) has 422 edges and 117 vertex of which 112 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 207
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 101 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 97 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 97 transition count 193
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 95 transition count 188
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 95 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 94 transition count 185
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 94 transition count 185
Applied a total of 49 rules in 12 ms. Remains 94 /117 variables (removed 23) and now considering 185/230 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 94/117 places, 185/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 208
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 101 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 98 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 98 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 97 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 97 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 96 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 96 transition count 191
Applied a total of 45 rules in 13 ms. Remains 96 /117 variables (removed 21) and now considering 191/230 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 96/117 places, 191/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 191 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 206
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 100 transition count 203
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 94 transition count 184
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 94 transition count 184
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 91 transition count 177
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 91 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 90 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 90 transition count 174
Applied a total of 57 rules in 9 ms. Remains 90 /117 variables (removed 27) and now considering 174/230 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 90/117 places, 174/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 174 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 99 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 93 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 93 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 90 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 90 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 88 transition count 170
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 88 transition count 170
Applied a total of 61 rules in 7 ms. Remains 88 /117 variables (removed 29) and now considering 170/230 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 88/117 places, 170/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 207
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 100 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 95 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 95 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 93 transition count 185
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 93 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 91 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 91 transition count 179
Applied a total of 55 rules in 7 ms. Remains 91 /117 variables (removed 26) and now considering 179/230 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/117 places, 179/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 99 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 93 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 93 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 90 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 90 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 88 transition count 170
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 88 transition count 170
Applied a total of 61 rules in 6 ms. Remains 88 /117 variables (removed 29) and now considering 170/230 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 88/117 places, 170/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 170 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 99 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 94 transition count 187
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 94 transition count 187
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 92 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 92 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 90 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 90 transition count 177
Applied a total of 57 rules in 6 ms. Remains 90 /117 variables (removed 27) and now considering 177/230 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 90/117 places, 177/230 transitions.
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:49:19] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 99 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 94 transition count 188
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 94 transition count 188
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 92 transition count 183
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 92 transition count 183
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 91 transition count 180
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 91 transition count 180
Applied a total of 55 rules in 6 ms. Remains 91 /117 variables (removed 26) and now considering 180/230 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 91/117 places, 180/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Graph (complete) has 422 edges and 117 vertex of which 112 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 111 transition count 215
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 100 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 25 place count 100 transition count 211
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 98 transition count 211
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 46 place count 81 transition count 187
Iterating global reduction 2 with 17 rules applied. Total rules applied 63 place count 81 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 81 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 81 transition count 184
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 80 transition count 184
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 73 place count 74 transition count 165
Iterating global reduction 3 with 6 rules applied. Total rules applied 79 place count 74 transition count 165
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 81 place count 72 transition count 161
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 72 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 70 transition count 155
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 70 transition count 155
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 111 place count 57 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 57 transition count 143
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 115 place count 54 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 118 place count 54 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 123 place count 54 transition count 133
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 123 place count 54 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 51 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 133 place count 49 transition count 128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 48 transition count 127
Applied a total of 134 rules in 39 ms. Remains 48 /117 variables (removed 69) and now considering 127/230 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 48/117 places, 127/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 127 transitions.
RANDOM walk for 29019 steps (3283 resets) in 164 ms. (175 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 99 transition count 205
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 99 transition count 205
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 99 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 93 transition count 183
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 93 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 91 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 91 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 90 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 90 transition count 175
Applied a total of 57 rules in 6 ms. Remains 90 /117 variables (removed 27) and now considering 175/230 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 90/117 places, 175/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 210
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 103 transition count 208
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 98 transition count 194
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 98 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 97 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 97 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 96 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 96 transition count 189
Applied a total of 44 rules in 6 ms. Remains 96 /117 variables (removed 21) and now considering 189/230 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 96/117 places, 189/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Graph (complete) has 422 edges and 117 vertex of which 112 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 111 transition count 212
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 97 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 31 place count 97 transition count 208
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 95 transition count 208
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 50 place count 80 transition count 186
Iterating global reduction 2 with 15 rules applied. Total rules applied 65 place count 80 transition count 186
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 65 place count 80 transition count 184
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 78 transition count 184
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 75 place count 72 transition count 164
Iterating global reduction 2 with 6 rules applied. Total rules applied 81 place count 72 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 70 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 70 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 68 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 68 transition count 154
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 115 place count 54 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 54 transition count 140
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 51 transition count 135
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 51 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 128 place count 51 transition count 130
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 128 place count 51 transition count 127
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 134 place count 48 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 47 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 46 transition count 125
Applied a total of 137 rules in 32 ms. Remains 46 /117 variables (removed 71) and now considering 125/230 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 46/117 places, 125/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 7 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 125 transitions.
RANDOM walk for 40000 steps (5089 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (957 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1381 steps, run visited all 1 properties in 6 ms. (steps per millisecond=230 )
Probabilistic random walk after 1381 steps, saw 419 distinct states, run finished after 11 ms. (steps per millisecond=125 ) properties seen :1
FORMULA MedleyA-PT-08-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 208
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 101 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 96 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 96 transition count 189
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 93 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 93 transition count 182
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 92 transition count 179
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 92 transition count 179
Applied a total of 53 rules in 6 ms. Remains 92 /117 variables (removed 25) and now considering 179/230 (removed 51) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 92/117 places, 179/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 230/230 transitions.
Graph (complete) has 422 edges and 117 vertex of which 112 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 111 transition count 214
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 99 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 27 place count 99 transition count 210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 97 transition count 210
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 47 place count 81 transition count 187
Iterating global reduction 2 with 16 rules applied. Total rules applied 63 place count 81 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 81 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 75 transition count 166
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 75 transition count 166
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 79 place count 72 transition count 159
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 72 transition count 159
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 70 transition count 153
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 70 transition count 153
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 110 place count 57 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 57 transition count 141
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 55 transition count 139
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 55 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 120 place count 55 transition count 134
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 120 place count 55 transition count 131
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 126 place count 52 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 50 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 49 transition count 128
Applied a total of 131 rules in 34 ms. Remains 49 /117 variables (removed 68) and now considering 128/230 (removed 102) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 49/117 places, 128/230 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:49:20] [INFO ] Input system was already deterministic with 128 transitions.
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 20 ms
[2024-06-02 18:49:20] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:49:20] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 16 ms.
[2024-06-02 18:49:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 230 transitions and 954 arcs took 17 ms.
Total runtime 72845 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-00
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-08-CTLFireability-2024-15

BK_STOP 1717354161276

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-08-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/649/ctl_0_
ctl formula name MedleyA-PT-08-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/649/ctl_1_
ctl formula name MedleyA-PT-08-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/649/ctl_2_
ctl formula name MedleyA-PT-08-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/649/ctl_3_
ctl formula name MedleyA-PT-08-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/649/ctl_4_
ctl formula name MedleyA-PT-08-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/649/ctl_5_
ctl formula name MedleyA-PT-08-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/649/ctl_6_
ctl formula name MedleyA-PT-08-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/649/ctl_7_
ctl formula name MedleyA-PT-08-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/649/ctl_8_
ctl formula name MedleyA-PT-08-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/649/ctl_9_
ctl formula name MedleyA-PT-08-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/649/ctl_10_
ctl formula name MedleyA-PT-08-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/649/ctl_11_
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="MedleyA-PT-08"
export BK_EXAMINATION="CTLFireability"
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 MedleyA-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921100058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-08.tgz
mv MedleyA-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;