About the Execution of LTSMin+red for Planning-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 380.884 | 16381.00 | 35916.00 | 66.90 | T??F??TF??F??F?? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446300065.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Planning-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446300065
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 12 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 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 56K May 18 16:43 model.pnml
-rw-r--r-- 1 mcc users 1 May 18 16:43 unfinite
--------------------
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 Planning-PT-none-CTLCardinality-2024-00
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-01
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-02
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-03
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-04
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-05
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-06
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-07
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-08
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-09
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-10
FORMULA_NAME Planning-PT-none-CTLCardinality-2024-11
FORMULA_NAME Planning-PT-none-CTLCardinality-2023-12
FORMULA_NAME Planning-PT-none-CTLCardinality-2023-13
FORMULA_NAME Planning-PT-none-CTLCardinality-2023-14
FORMULA_NAME Planning-PT-none-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717248133438
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Planning-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:22:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:22:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:22:15] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-06-01 13:22:15] [INFO ] Transformed 126 places.
[2024-06-01 13:22:15] [INFO ] Transformed 128 transitions.
[2024-06-01 13:22:15] [INFO ] Parsed PT model containing 126 places and 128 transitions and 652 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Reduce places removed 2 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Planning-PT-none-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 128/128 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 117 transition count 128
Applied a total of 7 rules in 20 ms. Remains 117 /124 variables (removed 7) and now considering 128/128 (removed 0) transitions.
[2024-06-01 13:22:15] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
// Phase 1: matrix 111 rows 117 cols
[2024-06-01 13:22:15] [INFO ] Computed 39 invariants in 23 ms
[2024-06-01 13:22:16] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-06-01 13:22:16] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
[2024-06-01 13:22:16] [INFO ] Invariant cache hit.
[2024-06-01 13:22:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 13:22:16] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-06-01 13:22:16] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
[2024-06-01 13:22:16] [INFO ] Invariant cache hit.
[2024-06-01 13:22:16] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 26/98 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 4/102 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-06-01 13:22:17] [INFO ] Deduced a trap composed of 1 places in 43 ms of which 20 ms to minimize.
[2024-06-01 13:22:18] [INFO ] Deduced a trap composed of 1 places in 81 ms of which 27 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 111/213 variables, 102/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 31/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 15/228 variables, 15/189 constraints. Problems are: Problem set: 0 solved, 97 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 189 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6262 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (OVERLAPS) 26/98 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 4/102 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 111/213 variables, 102/143 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 31/174 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 39/213 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (OVERLAPS) 15/228 variables, 15/228 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 58/286 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 286 constraints, problems are : Problem set: 0 solved, 97 unsolved in 4731 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 117/117 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints]
After SMT, in 11146ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 11168ms
Starting structural reductions in LTL mode, iteration 1 : 117/124 places, 128/128 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11765 ms. Remains : 117/124 places, 128/128 transitions.
Support contains 85 out of 117 places after structural reductions.
[2024-06-01 13:22:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:22:27] [INFO ] Flatten gal took : 36 ms
FORMULA Planning-PT-none-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:22:27] [INFO ] Flatten gal took : 18 ms
[2024-06-01 13:22:27] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 84 out of 117 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1879 ms. (21 steps per ms) remains 11/71 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
[2024-06-01 13:22:28] [INFO ] Flow matrix only has 111 transitions (discarded 17 similar events)
[2024-06-01 13:22:28] [INFO ] Invariant cache hit.
[2024-06-01 13:22:28] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 2 (OVERLAPS) 17/37 variables, 11/12 constraints. Problems are: Problem set: 4 solved, 7 unsolved
Problem AtomicPropp50 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 1/13 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/43 variables, 6/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/49 variables, 2/21 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/21 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/50 variables, 1/22 constraints. Problems are: Problem set: 5 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp54 is UNSAT
After SMT solving in domain Real declared 105/228 variables, and 72 constraints, problems are : Problem set: 11 solved, 0 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 19/36 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 50/117 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 14 simplifications.
FORMULA Planning-PT-none-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Planning-PT-none-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:22:29] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 11 ms
FORMULA Planning-PT-none-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 9 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 57 out of 117 places (down from 58) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 539 edges and 117 vertex of which 82 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Graph (trivial) has 42 edges and 117 vertex of which 28 / 117 are part of one of the 14 SCC in 2 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 517 edges and 103 vertex of which 71 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 57 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 54 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 54 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 28 place count 54 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 46 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 43 place count 44 transition count 68
Applied a total of 43 rules in 31 ms. Remains 44 /117 variables (removed 73) and now considering 68/128 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 44/117 places, 68/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 68 transitions.
RANDOM walk for 9322 steps (2 resets) in 102 ms. (90 steps per ms) remains 0/1 properties
FORMULA Planning-PT-none-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Graph (trivial) has 42 edges and 117 vertex of which 28 / 117 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 517 edges and 103 vertex of which 69 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.1 ms
Discarding 34 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 55 transition count 81
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 24 place count 51 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 28 place count 51 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 32 place count 51 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 47 place count 41 transition count 64
Applied a total of 47 rules in 10 ms. Remains 41 /117 variables (removed 76) and now considering 64/128 (removed 64) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 41/117 places, 64/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 98 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 39 place count 83 transition count 108
Iterating global reduction 1 with 15 rules applied. Total rules applied 54 place count 83 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 79 transition count 86
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 79 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 79 transition count 82
Applied a total of 66 rules in 6 ms. Remains 79 /117 variables (removed 38) and now considering 82/128 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 79/117 places, 82/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 99 transition count 124
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 36 place count 85 transition count 110
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 85 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 82 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 82 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 82 transition count 101
Applied a total of 59 rules in 6 ms. Remains 82 /117 variables (removed 35) and now considering 101/128 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 82/117 places, 101/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Graph (trivial) has 41 edges and 117 vertex of which 26 / 117 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 518 edges and 104 vertex of which 69 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 56 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 52 transition count 60
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 52 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 52 transition count 56
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 43 place count 44 transition count 52
Applied a total of 43 rules in 10 ms. Remains 44 /117 variables (removed 73) and now considering 52/128 (removed 76) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 44/117 places, 52/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 2 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 98 transition count 123
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 39 place count 83 transition count 108
Iterating global reduction 1 with 15 rules applied. Total rules applied 54 place count 83 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 78 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 78 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 69 place count 78 transition count 79
Applied a total of 69 rules in 6 ms. Remains 78 /117 variables (removed 39) and now considering 79/128 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 78/117 places, 79/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 100 transition count 123
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 31 place count 91 transition count 114
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 89 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 89 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 89 transition count 108
Applied a total of 46 rules in 6 ms. Remains 89 /117 variables (removed 28) and now considering 108/128 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 89/117 places, 108/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 99 transition count 123
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 35 place count 87 transition count 111
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 87 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 85 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 85 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 85 transition count 105
Applied a total of 53 rules in 5 ms. Remains 85 /117 variables (removed 32) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 85/117 places, 105/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 101 transition count 124
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 32 place count 89 transition count 112
Iterating global reduction 1 with 12 rules applied. Total rules applied 44 place count 89 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 87 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 87 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 87 transition count 106
Applied a total of 50 rules in 5 ms. Remains 87 /117 variables (removed 30) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 87/117 places, 106/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 99 transition count 123
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 33 place count 89 transition count 113
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 89 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 88 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 88 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 88 transition count 110
Applied a total of 46 rules in 4 ms. Remains 88 /117 variables (removed 29) and now considering 110/128 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 88/117 places, 110/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 4 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 128/128 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 100 transition count 125
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 33 place count 87 transition count 112
Iterating global reduction 1 with 13 rules applied. Total rules applied 46 place count 87 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 84 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 84 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 84 transition count 103
Applied a total of 55 rules in 3 ms. Remains 84 /117 variables (removed 33) and now considering 103/128 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 84/117 places, 103/128 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 3 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 5 ms
[2024-06-01 13:22:29] [INFO ] Input system was already deterministic with 103 transitions.
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:22:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:22:29] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:22:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 128 transitions and 597 arcs took 3 ms.
Total runtime 13970 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 : Planning-PT-none-CTLCardinality-2024-01
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-02
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-04
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-05
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-08
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-09
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2024-11
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2023-12
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2023-14
Could not compute solution for formula : Planning-PT-none-CTLCardinality-2023-15
BK_STOP 1717248149819
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Planning-PT-none-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/538/ctl_0_
ctl formula name Planning-PT-none-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/538/ctl_1_
ctl formula name Planning-PT-none-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/538/ctl_2_
ctl formula name Planning-PT-none-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/538/ctl_3_
ctl formula name Planning-PT-none-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/538/ctl_4_
ctl formula name Planning-PT-none-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/538/ctl_5_
ctl formula name Planning-PT-none-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/538/ctl_6_
ctl formula name Planning-PT-none-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/538/ctl_7_
ctl formula name Planning-PT-none-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/538/ctl_8_
ctl formula name Planning-PT-none-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/538/ctl_9_
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="Planning-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Planning-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446300065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Planning-PT-none.tgz
mv Planning-PT-none execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;