About the Execution of LTSMin+red for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1180.331 | 93240.00 | 150390.00 | 333.40 | [undef] | Cannot compute |
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.r528-tall-171683760500146.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 ShieldIIPs-PT-050A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760500146
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 426K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-12
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-13
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-14
FORMULA_NAME ShieldIIPs-PT-050A-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717230653130
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:30:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:30:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:30:54] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 08:30:54] [INFO ] Transformed 1253 places.
[2024-06-01 08:30:54] [INFO ] Transformed 1203 transitions.
[2024-06-01 08:30:54] [INFO ] Found NUPN structural information;
[2024-06-01 08:30:54] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 267 out of 1253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 84 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
// Phase 1: matrix 1203 rows 1253 cols
[2024-06-01 08:30:54] [INFO ] Computed 451 invariants in 31 ms
[2024-06-01 08:30:55] [INFO ] Implicit Places using invariants in 836 ms returned []
[2024-06-01 08:30:55] [INFO ] Invariant cache hit.
[2024-06-01 08:30:56] [INFO ] Implicit Places using invariants and state equation in 1269 ms returned []
Implicit Place search using SMT with State Equation took 2134 ms to find 0 implicit places.
Running 1202 sub problems to find dead transitions.
[2024-06-01 08:30:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1252/2456 variables, and 1252 constraints, problems are : Problem set: 0 solved, 1202 unsolved in 30042 ms.
Refiners :[Domain max(s): 1252/1253 constraints, Positive P Invariants (semi-flows): 0/451 constraints, State Equation: 0/1253 constraints, PredecessorRefiner: 1202/1202 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1252 variables, 1252/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1252 variables, 0/1252 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 2 (OVERLAPS) 1/1253 variables, 451/1703 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1253 variables, 1/1704 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:31:48] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 7 ms to minimize.
[2024-06-01 08:31:48] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:31:49] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:31:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:31:49] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:31:49] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-06-01 08:31:50] [INFO ] Deduced a trap composed of 15 places in 263 ms of which 3 ms to minimize.
[2024-06-01 08:31:50] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-06-01 08:31:50] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:31:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:31:51] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:31:51] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 08:31:51] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2024-06-01 08:31:52] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 08:31:53] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-06-01 08:31:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:31:53] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1253 variables, 20/1724 constraints. Problems are: Problem set: 0 solved, 1202 unsolved
[2024-06-01 08:31:57] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 2 ms to minimize.
SMT process timed out in 60751ms, After SMT, problems are : Problem set: 0 solved, 1202 unsolved
Search for dead transitions found 0 dead transitions in 60783ms
Finished structural reductions in LTL mode , in 1 iterations and 63033 ms. Remains : 1253/1253 places, 1203/1203 transitions.
Support contains 267 out of 1253 places after structural reductions.
[2024-06-01 08:31:58] [INFO ] Flatten gal took : 228 ms
[2024-06-01 08:31:58] [INFO ] Flatten gal took : 124 ms
[2024-06-01 08:31:58] [INFO ] Input system was already deterministic with 1203 transitions.
Support contains 262 out of 1253 places (down from 267) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 116 to 114
RANDOM walk for 40000 steps (12 resets) in 2319 ms. (17 steps per ms) remains 8/114 properties
BEST_FIRST walk for 40004 steps (8 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 8/8 properties
[2024-06-01 08:32:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/112 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1253 variables, 418/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1141/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 0/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1203/2456 variables, 1253/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/2456 variables, 0/2957 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2456/2456 variables, and 2957 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1511 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/112 variables, 33/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1141/1253 variables, 418/563 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1253 variables, 1141/1704 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:32:02] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 20 ms to minimize.
[2024-06-01 08:32:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:32:02] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1253 variables, 3/1707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1253 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1203/2456 variables, 1253/2960 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2456 variables, 8/2968 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 08:32:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:32:04] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2456 variables, 5/2973 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2456 variables, 0/2973 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2456/2456 variables, and 2973 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5007 ms.
Refiners :[Domain max(s): 1253/1253 constraints, Positive P Invariants (semi-flows): 451/451 constraints, State Equation: 1253/1253 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 6542ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 329 times.
Drop transitions (Partial Free agglomeration) removed 329 transitions
Iterating global reduction 0 with 329 rules applied. Total rules applied 333 place count 1251 transition count 1201
Applied a total of 333 rules in 263 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 1251/1253 places, 1201/1203 transitions.
RANDOM walk for 40000 steps (8 resets) in 1529 ms. (26 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 2/2 properties
// Phase 1: matrix 1201 rows 1251 cols
[2024-06-01 08:32:08] [INFO ] Computed 451 invariants in 57 ms
[2024-06-01 08:32:08] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 21/29 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1229 variables, 432/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1200/1669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:08] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:32:08] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:32:08] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 3/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 0/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 22/1251 variables, 11/1683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1251 variables, 22/1705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 1/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1201/2452 variables, 1251/2957 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2452 variables, 4/2961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/2452 variables, 0/2961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/2452 variables, 0/2961 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2452/2452 variables, and 2961 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1768 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 21/29 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 21/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1200/1229 variables, 432/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1200/1669 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 3/1672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 4 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 4/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1229 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/1251 variables, 11/1687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1251 variables, 22/1709 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1251 variables, 1/1710 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-06-01 08:32:10] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1251 variables, 4/1714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1251 variables, 0/1714 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1201/2452 variables, 1251/2965 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2452 variables, 4/2969 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2452 variables, 2/2971 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:11] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:32:11] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 08:32:11] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 2 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 9 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 2 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:32:12] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 7 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2452 variables, 17/2988 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 08:32:13] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:32:14] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:32:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:32:14] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2452 variables, 4/2992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2452 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/2452 variables, 0/2992 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2452/2452 variables, and 2992 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4929 ms.
Refiners :[Domain max(s): 1251/1251 constraints, Positive P Invariants (semi-flows): 440/440 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 1251/1251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 33/33 constraints]
After SMT, in 6782ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 6880 ms.
Support contains 4 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 1251 transition count 1201
Applied a total of 18 rules in 114 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 1251/1251 places, 1201/1201 transitions.
RANDOM walk for 40000 steps (8 resets) in 823 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9508 steps, run visited all 1 properties in 136 ms. (steps per millisecond=69 )
Probabilistic random walk after 9508 steps, saw 9051 distinct states, run finished after 139 ms. (steps per millisecond=68 ) properties seen :1
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 61 ms
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 61 ms
[2024-06-01 08:32:22] [INFO ] Input system was already deterministic with 1203 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 21 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:32:22] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 54 ms
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 56 ms
[2024-06-01 08:32:22] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 20 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:22] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 53 ms
[2024-06-01 08:32:23] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 77 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 55 ms
[2024-06-01 08:32:23] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 18 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:32:23] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 49 ms
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 54 ms
[2024-06-01 08:32:23] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:32:23] [INFO ] Flatten gal took : 54 ms
[2024-06-01 08:32:24] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:32:24] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 48 ms
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 51 ms
[2024-06-01 08:32:24] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 49 ms
[2024-06-01 08:32:24] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 48 ms
[2024-06-01 08:32:24] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 23 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 46 ms
[2024-06-01 08:32:24] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:32:25] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 63 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:32:25] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 17 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 48 ms
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 50 ms
[2024-06-01 08:32:25] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Applied a total of 4 rules in 86 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 1251/1253 places, 1201/1203 transitions.
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 49 ms
[2024-06-01 08:32:25] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Applied a total of 0 rules in 16 ms. Remains 1253 /1253 variables (removed 0) and now considering 1203/1203 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 1253/1253 places, 1203/1203 transitions.
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 44 ms
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:32:25] [INFO ] Input system was already deterministic with 1203 transitions.
[2024-06-01 08:32:25] [INFO ] Flatten gal took : 48 ms
[2024-06-01 08:32:26] [INFO ] Flatten gal took : 47 ms
[2024-06-01 08:32:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 08:32:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1253 places, 1203 transitions and 5406 arcs took 9 ms.
Total runtime 91787 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 : ShieldIIPs-PT-050A-CTLFireability-2024-00
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-01
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-02
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-03
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-04
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-05
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-06
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-07
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-08
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-09
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-10
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2024-11
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2023-12
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2023-13
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2023-14
Could not compute solution for formula : ShieldIIPs-PT-050A-CTLFireability-2023-15
BK_STOP 1717230746370
--------------------
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 ShieldIIPs-PT-050A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/726/ctl_0_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/726/ctl_1_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/726/ctl_2_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/726/ctl_3_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/726/ctl_4_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/726/ctl_5_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/726/ctl_6_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/726/ctl_7_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/726/ctl_8_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/726/ctl_9_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/726/ctl_10_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/726/ctl_11_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/726/ctl_12_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/726/ctl_13_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/726/ctl_14_
ctl formula name ShieldIIPs-PT-050A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/726/ctl_15_
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="ShieldIIPs-PT-050A"
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 ShieldIIPs-PT-050A, 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 r528-tall-171683760500146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A 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 ;