About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d2m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1137.275 | 75515.00 | 109273.00 | 368.00 | FFFFTFTF???TF?TF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r532-smll-171683810800098.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 SieveSingleMsgMbox-PT-d2m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800098
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 19:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 19:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 12 19:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M 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 SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717247073338
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:04:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:04:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:04:35] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2024-06-01 13:04:35] [INFO ] Transformed 2398 places.
[2024-06-01 13:04:35] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:04:35] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 89 ms.
Deduced a syphon composed of 1984 places in 29 ms
Reduce places removed 1984 places and 0 transitions.
Support contains 68 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 931 place count 311 transition count 941
Iterating global reduction 1 with 78 rules applied. Total rules applied 1009 place count 311 transition count 941
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 1022 place count 311 transition count 928
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 1070 place count 263 transition count 880
Iterating global reduction 2 with 48 rules applied. Total rules applied 1118 place count 263 transition count 880
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 1144 place count 263 transition count 854
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1163 place count 244 transition count 834
Iterating global reduction 3 with 19 rules applied. Total rules applied 1182 place count 244 transition count 834
Ensure Unique test removed 139 transitions
Reduce isomorphic transitions removed 139 transitions.
Iterating post reduction 3 with 139 rules applied. Total rules applied 1321 place count 244 transition count 695
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1322 place count 243 transition count 693
Iterating global reduction 4 with 1 rules applied. Total rules applied 1323 place count 243 transition count 693
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1324 place count 242 transition count 692
Iterating global reduction 4 with 1 rules applied. Total rules applied 1325 place count 242 transition count 692
Applied a total of 1325 rules in 160 ms. Remains 242 /414 variables (removed 172) and now considering 692/1954 (removed 1262) transitions.
// Phase 1: matrix 692 rows 242 cols
[2024-06-01 13:04:36] [INFO ] Computed 5 invariants in 35 ms
[2024-06-01 13:04:36] [INFO ] Implicit Places using invariants in 753 ms returned []
[2024-06-01 13:04:36] [INFO ] Invariant cache hit.
[2024-06-01 13:04:37] [INFO ] State equation strengthened by 510 read => feed constraints.
[2024-06-01 13:04:38] [INFO ] Implicit Places using invariants and state equation in 1892 ms returned []
Implicit Place search using SMT with State Equation took 2694 ms to find 0 implicit places.
Running 691 sub problems to find dead transitions.
[2024-06-01 13:04:38] [INFO ] Invariant cache hit.
[2024-06-01 13:04:38] [INFO ] State equation strengthened by 510 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 13:04:49] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 38 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 3 ms to minimize.
[2024-06-01 13:04:50] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 13:04:54] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 3 ms to minimize.
[2024-06-01 13:04:54] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-06-01 13:04:55] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (OVERLAPS) 1/242 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 13:05:06] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 13 ms to minimize.
[2024-06-01 13:05:06] [INFO ] Deduced a trap composed of 83 places in 107 ms of which 4 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 3 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 3 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-06-01 13:05:07] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/934 variables, and 20 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/242 constraints, ReadFeed: 0/510 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 1/242 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 691 unsolved
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 2 ms to minimize.
[2024-06-01 13:05:21] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD625 is UNSAT
At refinement iteration 8 (OVERLAPS) 692/934 variables, 242/264 constraints. Problems are: Problem set: 3 solved, 688 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/934 variables, 510/774 constraints. Problems are: Problem set: 3 solved, 688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 934/934 variables, and 1462 constraints, problems are : Problem set: 3 solved, 688 unsolved in 30728 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 242/242 constraints, ReadFeed: 510/510 constraints, PredecessorRefiner: 688/691 constraints, Known Traps: 17/17 constraints]
After SMT, in 63443ms problems are : Problem set: 3 solved, 688 unsolved
Search for dead transitions found 3 dead transitions in 63481ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 242/414 places, 689/1954 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 241 transition count 689
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 10 ms. Remains 241 /242 variables (removed 1) and now considering 689/689 (removed 0) transitions.
// Phase 1: matrix 689 rows 241 cols
[2024-06-01 13:05:42] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 13:05:42] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 13:05:42] [INFO ] Invariant cache hit.
[2024-06-01 13:05:42] [INFO ] State equation strengthened by 508 read => feed constraints.
[2024-06-01 13:05:44] [INFO ] Implicit Places using invariants and state equation in 1990 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 241/414 places, 689/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68655 ms. Remains : 241/414 places, 689/1954 transitions.
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Support contains 67 out of 240 places after structural reductions.
[2024-06-01 13:05:45] [INFO ] Flatten gal took : 156 ms
[2024-06-01 13:05:45] [INFO ] Flatten gal took : 115 ms
[2024-06-01 13:05:45] [INFO ] Input system was already deterministic with 689 transitions.
Reduction of identical properties reduced properties to check from 65 to 64
RANDOM walk for 40000 steps (8980 resets) in 3484 ms. (11 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (390 resets) in 170 ms. (23 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (185 resets) in 73 ms. (54 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (187 resets) in 49 ms. (80 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (176 resets) in 71 ms. (55 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (193 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (425 resets) in 80 ms. (49 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (190 resets) in 56 ms. (70 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (207 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (182 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (179 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (430 resets) in 47 ms. (83 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (400 resets) in 43 ms. (90 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (177 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (194 resets) in 106 ms. (37 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (206 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (188 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (191 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (168 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (197 resets) in 46 ms. (85 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (205 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (189 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (168 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (192 resets) in 43 ms. (90 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (165 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (184 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (201 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (182 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (198 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (160 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (174 resets) in 55 ms. (71 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (201 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (204 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (193 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (181 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (177 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (187 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (180 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (186 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (200 resets) in 42 ms. (93 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (195 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (382 resets) in 45 ms. (87 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (195 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (209 resets) in 41 ms. (95 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (415 resets) in 54 ms. (72 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (199 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (420 resets) in 61 ms. (64 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (194 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (197 resets) in 37 ms. (105 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (180 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (189 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
Probably explored full state space saw : 1185 states, properties seen :0
Probabilistic random walk after 2791 steps, saw 1185 distinct states, run finished after 137 ms. (steps per millisecond=20 ) properties seen :0
Explored full state space saw : 1185 states, properties seen :0
Exhaustive walk after 2791 steps, saw 1185 distinct states, run finished after 68 ms. (steps per millisecond=41 ) properties seen :0
Successfully simplified 65 atomic propositions for a total of 16 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:05:47] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 13:05:47] [INFO ] Flatten gal took : 66 ms
[2024-06-01 13:05:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:05:47] [INFO ] Flatten gal took : 63 ms
[2024-06-01 13:05:48] [INFO ] Input system was already deterministic with 689 transitions.
Computed a total of 59 stabilizing places and 109 stable transitions
Graph (complete) has 1137 edges and 240 vertex of which 239 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.26 ms
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 689/689 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 191 transition count 252
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 191 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 191 transition count 248
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 145 place count 148 transition count 201
Iterating global reduction 1 with 43 rules applied. Total rules applied 188 place count 148 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 203 place count 148 transition count 186
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 221 place count 130 transition count 155
Iterating global reduction 2 with 18 rules applied. Total rules applied 239 place count 130 transition count 155
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 130 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 257 place count 123 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 123 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 117 transition count 130
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 281 place count 112 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 286 place count 112 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 112 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 291 place count 109 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 294 place count 109 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 108 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 108 transition count 119
Applied a total of 296 rules in 50 ms. Remains 108 /240 variables (removed 132) and now considering 119/689 (removed 570) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 108/240 places, 119/689 transitions.
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 10 ms
[2024-06-01 13:05:48] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 689/689 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 191 transition count 252
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 191 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 191 transition count 248
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 145 place count 148 transition count 201
Iterating global reduction 1 with 43 rules applied. Total rules applied 188 place count 148 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 203 place count 148 transition count 186
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 221 place count 130 transition count 155
Iterating global reduction 2 with 18 rules applied. Total rules applied 239 place count 130 transition count 155
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 130 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 257 place count 123 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 123 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 117 transition count 130
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 281 place count 112 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 286 place count 112 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 112 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 291 place count 109 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 294 place count 109 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 108 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 108 transition count 119
Applied a total of 296 rules in 35 ms. Remains 108 /240 variables (removed 132) and now considering 119/689 (removed 570) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 108/240 places, 119/689 transitions.
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:05:48] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 689/689 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 191 transition count 252
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 191 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 191 transition count 248
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 145 place count 148 transition count 201
Iterating global reduction 1 with 43 rules applied. Total rules applied 188 place count 148 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 203 place count 148 transition count 186
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 221 place count 130 transition count 155
Iterating global reduction 2 with 18 rules applied. Total rules applied 239 place count 130 transition count 155
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 130 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 257 place count 123 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 123 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 117 transition count 130
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 281 place count 112 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 286 place count 112 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 112 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 291 place count 109 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 294 place count 109 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 108 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 108 transition count 119
Applied a total of 296 rules in 31 ms. Remains 108 /240 variables (removed 132) and now considering 119/689 (removed 570) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 108/240 places, 119/689 transitions.
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:05:48] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 689/689 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 191 transition count 252
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 191 transition count 252
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 102 place count 191 transition count 248
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 145 place count 148 transition count 201
Iterating global reduction 1 with 43 rules applied. Total rules applied 188 place count 148 transition count 201
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 203 place count 148 transition count 186
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 221 place count 130 transition count 155
Iterating global reduction 2 with 18 rules applied. Total rules applied 239 place count 130 transition count 155
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 250 place count 130 transition count 144
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 257 place count 123 transition count 137
Iterating global reduction 3 with 7 rules applied. Total rules applied 264 place count 123 transition count 137
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 117 transition count 130
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 117 transition count 130
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 281 place count 112 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 286 place count 112 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 288 place count 112 transition count 123
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 291 place count 109 transition count 120
Iterating global reduction 4 with 3 rules applied. Total rules applied 294 place count 109 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 295 place count 108 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 296 place count 108 transition count 119
Applied a total of 296 rules in 29 ms. Remains 108 /240 variables (removed 132) and now considering 119/689 (removed 570) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 108/240 places, 119/689 transitions.
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 6 ms
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 7 ms
[2024-06-01 13:05:48] [INFO ] Input system was already deterministic with 119 transitions.
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:05:48] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:05:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-01 13:05:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 240 places, 689 transitions and 2720 arcs took 12 ms.
Total runtime 73361 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 : SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-08
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-10
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-13
BK_STOP 1717247148853
--------------------
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 SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/586/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/586/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/586/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d2m04-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/586/ctl_3_
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="SieveSingleMsgMbox-PT-d2m04"
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 SieveSingleMsgMbox-PT-d2m04, 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 r532-smll-171683810800098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d2m04.tgz
mv SieveSingleMsgMbox-PT-d2m04 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 ;