About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d1m96
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8554.363 | 3583993.00 | 14290610.00 | 115.30 | F?TFTF??FFFTT??T | 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/mcc2023-input.r425-tajo-167905978200441.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is SieveSingleMsgMbox-PT-d1m96, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978200441
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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-d1m96-CTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m96-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679317282135
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m96
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 13:01:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 13:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 13:01:23] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-20 13:01:23] [INFO ] Transformed 1295 places.
[2023-03-20 13:01:23] [INFO ] Transformed 749 transitions.
[2023-03-20 13:01:23] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 1036 places in 9 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 55 places :
Symmetric choice reduction at 1 with 55 rule applications. Total rules 312 place count 187 transition count 264
Iterating global reduction 1 with 55 rules applied. Total rules applied 367 place count 187 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 375 place count 187 transition count 256
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 411 place count 151 transition count 220
Iterating global reduction 2 with 36 rules applied. Total rules applied 447 place count 151 transition count 220
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 457 place count 151 transition count 210
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 481 place count 127 transition count 185
Iterating global reduction 3 with 24 rules applied. Total rules applied 505 place count 127 transition count 185
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 522 place count 127 transition count 168
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 527 place count 122 transition count 159
Iterating global reduction 4 with 5 rules applied. Total rules applied 532 place count 122 transition count 159
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 537 place count 117 transition count 154
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 117 transition count 154
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 544 place count 115 transition count 151
Iterating global reduction 4 with 2 rules applied. Total rules applied 546 place count 115 transition count 151
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 547 place count 114 transition count 150
Iterating global reduction 4 with 1 rules applied. Total rules applied 548 place count 114 transition count 150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 549 place count 113 transition count 149
Iterating global reduction 4 with 1 rules applied. Total rules applied 550 place count 113 transition count 149
Applied a total of 550 rules in 73 ms. Remains 113 /259 variables (removed 146) and now considering 149/749 (removed 600) transitions.
// Phase 1: matrix 149 rows 113 cols
[2023-03-20 13:01:24] [INFO ] Computed 5 place invariants in 16 ms
[2023-03-20 13:01:24] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-20 13:01:24] [INFO ] Invariant cache hit.
[2023-03-20 13:01:24] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-20 13:01:24] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-20 13:01:24] [INFO ] Invariant cache hit.
[2023-03-20 13:01:24] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/259 places, 149/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 113/259 places, 149/749 transitions.
Support contains 12 out of 113 places after structural reductions.
[2023-03-20 13:01:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-20 13:01:24] [INFO ] Flatten gal took : 33 ms
[2023-03-20 13:01:24] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 13:01:24] [INFO ] Flatten gal took : 15 ms
[2023-03-20 13:01:24] [INFO ] Input system was already deterministic with 149 transitions.
Support contains 9 out of 113 places (down from 12) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1002 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1019 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1042 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 983 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 435822 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{2=1}
Probabilistic random walk after 435822 steps, saw 193318 distinct states, run finished after 3007 ms. (steps per millisecond=144 ) properties seen :1
Running SMT prover for 7 properties.
[2023-03-20 13:01:29] [INFO ] Invariant cache hit.
[2023-03-20 13:01:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 13:01:29] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 13:01:29] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:5
[2023-03-20 13:01:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-20 13:01:29] [INFO ] After 41ms SMT Verify possible using 73 Read/Feed constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-20 13:01:29] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-20 13:01:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 13:01:29] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-20 13:01:29] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-20 13:01:29] [INFO ] After 62ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :4 sat :3
[2023-03-20 13:01:29] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-20 13:01:29] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 300 ms.
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 113/113 places, 149/149 transitions.
Graph (complete) has 335 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 112 transition count 147
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 107 transition count 124
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 107 transition count 124
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 103 transition count 120
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 103 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 103 transition count 118
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 27 place count 99 transition count 111
Iterating global reduction 2 with 4 rules applied. Total rules applied 31 place count 99 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 34 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 96 transition count 105
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 96 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 43 place count 93 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 93 transition count 102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 90 transition count 99
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 90 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 90 transition count 97
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 87 transition count 94
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 87 transition count 94
Applied a total of 60 rules in 31 ms. Remains 87 /113 variables (removed 26) and now considering 94/149 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 87/113 places, 94/149 transitions.
Incomplete random walk after 10000 steps, including 2231 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1075 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1020 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 721900 steps, run timeout after 3001 ms. (steps per millisecond=240 ) properties seen :{}
Probabilistic random walk after 721900 steps, saw 340824 distinct states, run finished after 3001 ms. (steps per millisecond=240 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 87 cols
[2023-03-20 13:01:33] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-20 13:01:33] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-20 13:01:33] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 13:01:33] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 13:01:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 13:01:33] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-20 13:01:33] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 13:01:33] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 13:01:33] [INFO ] After 22ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 13:01:33] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-20 13:01:33] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 87/87 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-20 13:01:33] [INFO ] Invariant cache hit.
[2023-03-20 13:01:34] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 13:01:34] [INFO ] Invariant cache hit.
[2023-03-20 13:01:34] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 13:01:34] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-20 13:01:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 13:01:34] [INFO ] Invariant cache hit.
[2023-03-20 13:01:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 87/87 places, 94/94 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 87 transition count 88
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 83 transition count 88
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 10 place count 83 transition count 74
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 38 place count 69 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 63 transition count 68
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 63 transition count 68
Applied a total of 51 rules in 14 ms. Remains 63 /87 variables (removed 24) and now considering 68/94 (removed 26) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 68 rows 63 cols
[2023-03-20 13:01:34] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-20 13:01:34] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 13:01:34] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-20 13:01:34] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 13:01:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 13:01:34] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-20 13:01:34] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 13:01:34] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2023-03-20 13:01:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-20 13:01:34] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 13:01:34] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 4 atomic propositions for a total of 5 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m96-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 8 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 9 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 149 transitions.
Support contains 3 out of 113 places (down from 4) after GAL structural reductions.
Computed a total of 21 stabilizing places and 27 stable transitions
Graph (complete) has 376 edges and 113 vertex of which 112 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 149/149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 124
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 106 transition count 123
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 100 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 100 transition count 117
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 100 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 36 place count 95 transition count 106
Iterating global reduction 2 with 5 rules applied. Total rules applied 41 place count 95 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 44 place count 95 transition count 103
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 47 place count 92 transition count 100
Iterating global reduction 3 with 3 rules applied. Total rules applied 50 place count 92 transition count 100
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 53 place count 89 transition count 97
Iterating global reduction 3 with 3 rules applied. Total rules applied 56 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 59 place count 86 transition count 94
Iterating global reduction 3 with 3 rules applied. Total rules applied 62 place count 86 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 64 place count 86 transition count 92
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 83 transition count 89
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 83 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 82 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 80 transition count 85
Applied a total of 76 rules in 16 ms. Remains 80 /113 variables (removed 33) and now considering 85/149 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 80/113 places, 85/149 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 149/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 105 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 98 transition count 115
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 98 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 98 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 92 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 92 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 92 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 89 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 89 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 86 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 83 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 83 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 77 transition count 81
Applied a total of 83 rules in 14 ms. Remains 77 /113 variables (removed 36) and now considering 81/149 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 77/113 places, 81/149 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 149/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 105 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 98 transition count 115
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 98 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 98 transition count 111
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 40 place count 93 transition count 105
Iterating global reduction 2 with 5 rules applied. Total rules applied 45 place count 93 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 49 place count 93 transition count 101
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 91 transition count 99
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 91 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 89 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 89 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 87 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 87 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 87 transition count 93
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 85 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 85 transition count 91
Applied a total of 67 rules in 12 ms. Remains 85 /113 variables (removed 28) and now considering 91/149 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 85/113 places, 91/149 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 91 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 149/149 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 105 transition count 123
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 105 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 105 transition count 122
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 98 transition count 115
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 98 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 98 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 92 transition count 103
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 92 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 92 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 89 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 89 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 86 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 86 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 66 place count 83 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 69 place count 83 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 83 transition count 88
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 74 place count 80 transition count 85
Iterating global reduction 4 with 3 rules applied. Total rules applied 77 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 78 place count 79 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 79 place count 79 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 78 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 78 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 77 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 77 transition count 81
Applied a total of 83 rules in 13 ms. Remains 77 /113 variables (removed 36) and now considering 81/149 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 77/113 places, 81/149 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 149/149 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 106 transition count 124
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 106 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 106 transition count 123
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 100 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 100 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 100 transition count 115
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 35 place count 94 transition count 106
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 94 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 91 transition count 99
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 91 transition count 99
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 54 place count 88 transition count 96
Iterating global reduction 3 with 3 rules applied. Total rules applied 57 place count 88 transition count 96
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 60 place count 85 transition count 93
Iterating global reduction 3 with 3 rules applied. Total rules applied 63 place count 85 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 85 transition count 91
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 68 place count 82 transition count 88
Iterating global reduction 4 with 3 rules applied. Total rules applied 71 place count 82 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 76 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 77 place count 79 transition count 84
Applied a total of 77 rules in 29 ms. Remains 79 /113 variables (removed 34) and now considering 84/149 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 79/113 places, 84/149 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 13:01:34] [INFO ] Input system was already deterministic with 84 transitions.
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 7 ms
[2023-03-20 13:01:34] [INFO ] Flatten gal took : 7 ms
[2023-03-20 13:01:34] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-20 13:01:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 149 transitions and 591 arcs took 1 ms.
Total runtime 10912 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/517/ctl_0_ --ctl=/tmp/517/ctl_1_ --ctl=/tmp/517/ctl_2_ --ctl=/tmp/517/ctl_3_ --ctl=/tmp/517/ctl_4_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393356 kB
MemFree: 7591076 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16099364 kB
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-CTLCardinality-01
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-CTLCardinality-06
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-CTLCardinality-07
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-CTLCardinality-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d1m96-CTLCardinality-14
BK_STOP 1679320866128
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name SieveSingleMsgMbox-PT-d1m96-CTLCardinality-01
ctl formula formula --ctl=/tmp/517/ctl_0_
ctl formula name SieveSingleMsgMbox-PT-d1m96-CTLCardinality-06
ctl formula formula --ctl=/tmp/517/ctl_1_
ctl formula name SieveSingleMsgMbox-PT-d1m96-CTLCardinality-07
ctl formula formula --ctl=/tmp/517/ctl_2_
ctl formula name SieveSingleMsgMbox-PT-d1m96-CTLCardinality-13
ctl formula formula --ctl=/tmp/517/ctl_3_
ctl formula name SieveSingleMsgMbox-PT-d1m96-CTLCardinality-14
ctl formula formula --ctl=/tmp/517/ctl_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 113 places, 149 transitions and 591 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 149->146 groups
pnml2lts-sym: Regrouping took 0.030 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 113; there are 146 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 523
Killing (9) : 523
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-d1m96"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SieveSingleMsgMbox-PT-d1m96, 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 r425-tajo-167905978200441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m96.tgz
mv SieveSingleMsgMbox-PT-d1m96 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 ;