About the Execution of LTSMin+red for DES-PT-05a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
465.195 | 36309.00 | 57659.00 | 215.90 | ???????T???????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r480-tall-171624189700650.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 DES-PT-05a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189700650
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 08:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 08:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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 DES-PT-05a-CTLFireability-2024-00
FORMULA_NAME DES-PT-05a-CTLFireability-2024-01
FORMULA_NAME DES-PT-05a-CTLFireability-2024-02
FORMULA_NAME DES-PT-05a-CTLFireability-2024-03
FORMULA_NAME DES-PT-05a-CTLFireability-2024-04
FORMULA_NAME DES-PT-05a-CTLFireability-2024-05
FORMULA_NAME DES-PT-05a-CTLFireability-2024-06
FORMULA_NAME DES-PT-05a-CTLFireability-2024-07
FORMULA_NAME DES-PT-05a-CTLFireability-2024-08
FORMULA_NAME DES-PT-05a-CTLFireability-2024-09
FORMULA_NAME DES-PT-05a-CTLFireability-2024-10
FORMULA_NAME DES-PT-05a-CTLFireability-2024-11
FORMULA_NAME DES-PT-05a-CTLFireability-2023-12
FORMULA_NAME DES-PT-05a-CTLFireability-2023-13
FORMULA_NAME DES-PT-05a-CTLFireability-2023-14
FORMULA_NAME DES-PT-05a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717192461818
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-05a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:54:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:54:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:54:23] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-31 21:54:23] [INFO ] Transformed 135 places.
[2024-05-31 21:54:23] [INFO ] Transformed 92 transitions.
[2024-05-31 21:54:23] [INFO ] Found NUPN structural information;
[2024-05-31 21:54:23] [INFO ] Parsed PT model containing 135 places and 92 transitions and 457 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 119 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2024-05-31 21:54:23] [INFO ] Computed 59 invariants in 15 ms
[2024-05-31 21:54:23] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 21:54:23] [INFO ] Invariant cache hit.
[2024-05-31 21:54:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 21:54:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-31 21:54:24] [INFO ] Invariant cache hit.
[2024-05-31 21:54:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 34/180 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 78/213 variables, 135/329 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 330 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4449 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 134/134 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 12/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/135 variables, 34/180 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 13/194 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:54:28] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 12 ms to minimize.
[2024-05-31 21:54:29] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 78/213 variables, 135/331 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 77/409 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-31 21:54:31] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 5 ms to minimize.
[2024-05-31 21:54:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/213 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 411 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9729 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints]
After SMT, in 14237ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 14257ms
Finished structural reductions in LTL mode , in 1 iterations and 14753 ms. Remains : 135/135 places, 78/78 transitions.
Support contains 119 out of 135 places after structural reductions.
[2024-05-31 21:54:38] [INFO ] Flatten gal took : 35 ms
[2024-05-31 21:54:38] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:54:38] [INFO ] Input system was already deterministic with 78 transitions.
Reduction of identical properties reduced properties to check from 67 to 62
RANDOM walk for 40000 steps (886 resets) in 1823 ms. (21 steps per ms) remains 6/62 properties
BEST_FIRST walk for 40003 steps (181 resets) in 284 ms. (140 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40002 steps (203 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (176 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40000 steps (203 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (219 resets) in 257 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (168 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
[2024-05-31 21:54:39] [INFO ] Invariant cache hit.
[2024-05-31 21:54:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp35 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 69/86 variables, 34/51 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 69/120 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 37/123 variables, 22/143 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 37/180 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/180 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/129 variables, 2/182 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 6/188 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 77/206 variables, 129/317 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 1/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 15 (OVERLAPS) 7/213 variables, 6/324 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/213 variables, 6/330 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/213 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/213 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 330 constraints, problems are : Problem set: 2 solved, 3 unsolved in 216 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 18/29 variables, 7/18 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 18/36 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 55/84 variables, 27/63 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 55/118 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 21:54:39] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 1/119 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 38/122 variables, 23/142 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 38/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/128 variables, 2/182 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 6/188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 77/205 variables, 128/316 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/205 variables, 1/317 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/205 variables, 1/318 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-31 21:54:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/205 variables, 1/319 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/205 variables, 0/319 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 8/213 variables, 7/326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/213 variables, 7/333 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/213 variables, 2/335 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/213 variables, 0/335 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/213 variables, 0/335 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 335 constraints, problems are : Problem set: 2 solved, 3 unsolved in 439 ms.
Refiners :[Domain max(s): 135/135 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 661ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 390 ms.
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 78/78 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 76
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 134 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 134 transition count 75
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 134 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 133 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 132 transition count 74
Applied a total of 11 rules in 49 ms. Remains 132 /135 variables (removed 3) and now considering 74/78 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 132/135 places, 74/78 transitions.
RANDOM walk for 40000 steps (529 resets) in 395 ms. (101 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (68 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1754782 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :0 out of 1
Probabilistic random walk after 1754782 steps, saw 244037 distinct states, run finished after 3004 ms. (steps per millisecond=584 ) properties seen :0
// Phase 1: matrix 74 rows 132 cols
[2024-05-31 21:54:43] [INFO ] Computed 60 invariants in 11 ms
[2024-05-31 21:54:43] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/55 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/85 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 21:54:43] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/109 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/116 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/182 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 12/194 variables, 8/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/195 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/195 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/195 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 7/202 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/202 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/206 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/206 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/206 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/55 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 30/85 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/109 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/116 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 66/182 variables, 116/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/182 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/182 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/182 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 12/194 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/194 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/195 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/195 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/195 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/202 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/202 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/202 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/206 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/206 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/206 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 147 ms.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 132/132 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 74/74 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-31 21:54:44] [INFO ] Invariant cache hit.
[2024-05-31 21:54:44] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 21:54:44] [INFO ] Invariant cache hit.
[2024-05-31 21:54:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:54:44] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-31 21:54:44] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-31 21:54:44] [INFO ] Invariant cache hit.
[2024-05-31 21:54:44] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:44] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:45] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 74/205 variables, 131/193 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 2/195 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:46] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:54:46] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-31 21:54:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 1/206 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 0/206 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 199 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2997 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 2/131 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:47] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 74/205 variables, 131/197 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 2/199 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 71/270 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:48] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:54:48] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-31 21:54:48] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-31 21:54:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/205 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/205 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 13 (OVERLAPS) 1/206 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 21:54:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 16 (OVERLAPS) 0/206 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 276 constraints, problems are : Problem set: 0 solved, 71 unsolved in 9134 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 132/132 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 11/11 constraints]
After SMT, in 12149ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 12150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12450 ms. Remains : 132/132 places, 74/74 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 132 transition count 74
Applied a total of 1 rules in 11 ms. Remains 132 /132 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 132 cols
[2024-05-31 21:54:56] [INFO ] Computed 60 invariants in 2 ms
[2024-05-31 21:54:56] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2024-05-31 21:54:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-31 21:54:56] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 21:54:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 21:54:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-31 21:54:56] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 21:54:56] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 21:54:57] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 228 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-05a-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 14 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 38 stabilizing places and 32 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 6 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 135/135 places, 78/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 5 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 9 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 8 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 7 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 2 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 134/135 places, 77/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 77 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 135/135 places, 78/78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:54:57] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:54:57] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-31 21:54:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 78 transitions and 393 arcs took 3 ms.
Total runtime 34442 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-05a-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-05a-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-05a-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-05a-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-05a-CTLFireability-2023-15
BK_STOP 1717192498127
--------------------
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 DES-PT-05a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/617/ctl_0_
ctl formula name DES-PT-05a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/617/ctl_1_
ctl formula name DES-PT-05a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/617/ctl_2_
ctl formula name DES-PT-05a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/617/ctl_3_
ctl formula name DES-PT-05a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/617/ctl_4_
ctl formula name DES-PT-05a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/617/ctl_5_
ctl formula name DES-PT-05a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/617/ctl_6_
ctl formula name DES-PT-05a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/617/ctl_7_
ctl formula name DES-PT-05a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/617/ctl_8_
ctl formula name DES-PT-05a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/617/ctl_9_
ctl formula name DES-PT-05a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/617/ctl_10_
ctl formula name DES-PT-05a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/617/ctl_11_
ctl formula name DES-PT-05a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/617/ctl_12_
ctl formula name DES-PT-05a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/617/ctl_13_
ctl formula name DES-PT-05a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/617/ctl_14_
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="DES-PT-05a"
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 DES-PT-05a, 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 r480-tall-171624189700650"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05a.tgz
mv DES-PT-05a 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 '
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 ;