About the Execution of ITS-LoLa for ShieldIIPs-PT-050A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15739.780 | 3600000.00 | 442529.00 | 317.10 | TTTTTTTTTTTFTFTT | 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/mcc2020-input.r211-tajo-159033477100191.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldIIPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477100191
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 3.3K May 14 00:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 00:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 13 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 13 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 14 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 14 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 07:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 426K May 12 20:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1591291797673
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 17:30:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 17:30:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 17:30:00] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2020-06-04 17:30:00] [INFO ] Transformed 1253 places.
[2020-06-04 17:30:00] [INFO ] Transformed 1203 transitions.
[2020-06-04 17:30:00] [INFO ] Found NUPN structural information;
[2020-06-04 17:30:00] [INFO ] Parsed PT model containing 1253 places and 1203 transitions in 204 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 141 ms. (steps per millisecond=70 ) properties seen :[1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 128 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 141 ms. (steps per millisecond=70 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 85 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1203 rows 1253 cols
[2020-06-04 17:30:01] [INFO ] Computed 451 place invariants in 38 ms
[2020-06-04 17:30:02] [INFO ] [Real]Absence check using 451 positive place invariants in 357 ms returned sat
[2020-06-04 17:30:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:05] [INFO ] [Real]Absence check using state equation in 3214 ms returned sat
[2020-06-04 17:30:05] [INFO ] Deduced a trap composed of 18 places in 77 ms
[2020-06-04 17:30:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2020-06-04 17:30:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:30:06] [INFO ] [Nat]Absence check using 451 positive place invariants in 348 ms returned sat
[2020-06-04 17:30:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:09] [INFO ] [Nat]Absence check using state equation in 3005 ms returned sat
[2020-06-04 17:30:09] [INFO ] Deduced a trap composed of 13 places in 230 ms
[2020-06-04 17:30:10] [INFO ] Deduced a trap composed of 18 places in 445 ms
[2020-06-04 17:30:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 895 ms
[2020-06-04 17:30:10] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 143 ms.
[2020-06-04 17:30:10] [INFO ] Added : 30 causal constraints over 6 iterations in 576 ms. Result :unknown
[2020-06-04 17:30:11] [INFO ] [Real]Absence check using 451 positive place invariants in 348 ms returned sat
[2020-06-04 17:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:14] [INFO ] [Real]Absence check using state equation in 3291 ms returned sat
[2020-06-04 17:30:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:30:15] [INFO ] [Nat]Absence check using 451 positive place invariants in 337 ms returned sat
[2020-06-04 17:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:18] [INFO ] [Nat]Absence check using state equation in 2884 ms returned sat
[2020-06-04 17:30:18] [INFO ] Deduced a trap composed of 11 places in 88 ms
[2020-06-04 17:30:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2020-06-04 17:30:18] [INFO ] Computed and/alt/rep : 1202/4803/1202 causal constraints in 152 ms.
[2020-06-04 17:30:19] [INFO ] Added : 75 causal constraints over 15 iterations in 1346 ms. Result :unknown
[2020-06-04 17:30:20] [INFO ] [Real]Absence check using 451 positive place invariants in 359 ms returned sat
[2020-06-04 17:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:30:24] [INFO ] [Real]Absence check using state equation in 4264 ms returned (error "Failed to check-sat")
[2020-06-04 17:30:26] [INFO ] [Real]Absence check using 451 positive place invariants in 1316 ms returned sat
[2020-06-04 17:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:30:29] [INFO ] [Real]Absence check using state equation in 3505 ms returned unknown
[2020-06-04 17:30:32] [INFO ] [Real]Absence check using 451 positive place invariants in 2708 ms returned sat
[2020-06-04 17:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:30:34] [INFO ] [Real]Absence check using state equation in 2110 ms returned unknown
[2020-06-04 17:30:35] [INFO ] [Real]Absence check using 451 positive place invariants in 318 ms returned sat
[2020-06-04 17:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:30:39] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 17:30:39] [INFO ] [Real]Absence check using state equation in 4516 ms returned (error "Failed to check-sat")
Incomplete Parikh walk after 143000 steps, including 1002 resets, run finished after 1453 ms. (steps per millisecond=98 ) properties seen :[0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 117500 steps, including 1018 resets, run finished after 1458 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 38 out of 1253 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 332 times.
Drop transitions removed 332 transitions
Iterating global reduction 0 with 332 rules applied. Total rules applied 336 place count 1251 transition count 1201
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 337 place count 1251 transition count 1201
Applied a total of 337 rules in 363 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 1000000 steps, including 253 resets, run finished after 9682 ms. (steps per millisecond=103 ) properties seen :[1, 0, 0, 0]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 819635 steps, including 10 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen :[1, 0, 0]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 822084 steps, including 11 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :[1, 0]
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 756332 steps, including 12 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1251 cols
[2020-06-04 17:31:08] [INFO ] Computed 451 place invariants in 139 ms
[2020-06-04 17:31:08] [INFO ] [Real]Absence check using 448 positive place invariants in 402 ms returned sat
[2020-06-04 17:31:08] [INFO ] [Real]Absence check using 448 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-04 17:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:11] [INFO ] [Real]Absence check using state equation in 2986 ms returned sat
[2020-06-04 17:31:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:31:12] [INFO ] [Nat]Absence check using 448 positive place invariants in 237 ms returned sat
[2020-06-04 17:31:12] [INFO ] [Nat]Absence check using 448 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-04 17:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:31:15] [INFO ] [Nat]Absence check using state equation in 2920 ms returned sat
[2020-06-04 17:31:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-04 17:31:15] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2020-06-04 17:31:15] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-06-04 17:31:15] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-06-04 17:31:16] [INFO ] Deduced a trap composed of 9 places in 211 ms
[2020-06-04 17:31:16] [INFO ] Deduced a trap composed of 18 places in 244 ms
[2020-06-04 17:31:16] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-06-04 17:31:16] [INFO ] Deduced a trap composed of 9 places in 250 ms
[2020-06-04 17:31:17] [INFO ] Deduced a trap composed of 15 places in 196 ms
[2020-06-04 17:31:17] [INFO ] Deduced a trap composed of 18 places in 185 ms
[2020-06-04 17:31:17] [INFO ] Deduced a trap composed of 12 places in 98 ms
[2020-06-04 17:31:17] [INFO ] Deduced a trap composed of 24 places in 96 ms
[2020-06-04 17:31:17] [INFO ] Deduced a trap composed of 9 places in 90 ms
[2020-06-04 17:31:18] [INFO ] Deduced a trap composed of 18 places in 250 ms
[2020-06-04 17:31:18] [INFO ] Deduced a trap composed of 18 places in 74 ms
[2020-06-04 17:31:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3286 ms
[2020-06-04 17:31:18] [INFO ] Computed and/alt/rep : 1200/7685/1200 causal constraints in 193 ms.
[2020-06-04 17:31:38] [INFO ] Added : 645 causal constraints over 129 iterations in 20197 ms.(timeout) Result :sat
[2020-06-04 17:31:38] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-06-04 17:31:39] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2020-06-04 17:31:39] [INFO ] Deduced a trap composed of 5 places in 142 ms
[2020-06-04 17:31:39] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2020-06-04 17:31:39] [INFO ] Deduced a trap composed of 5 places in 136 ms
[2020-06-04 17:31:40] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2020-06-04 17:31:40] [INFO ] Deduced a trap composed of 9 places in 178 ms
[2020-06-04 17:31:40] [INFO ] Deduced a trap composed of 6 places in 91 ms
[2020-06-04 17:31:41] [INFO ] Deduced a trap composed of 6 places in 48 ms
[2020-06-04 17:31:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2660 ms
Attempting to minimize the solution found.
Minimization took 129 ms.
Incomplete Parikh walk after 206500 steps, including 914 resets, run finished after 2216 ms. (steps per millisecond=93 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 1251 transition count 1201
Applied a total of 12 rules in 88 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 1000000 steps, including 174 resets, run finished after 10093 ms. (steps per millisecond=99 ) properties seen :[0]
Interrupted Best-First random walk after 806156 steps, including 10 resets, run timeout after 5001 ms. (steps per millisecond=161 ) properties seen :[0]
Interrupted probabilistic random walk after 1851643 steps, run timeout after 30001 ms. (steps per millisecond=61 ) properties seen :[0]
Probabilistic random walk after 1851643 steps, saw 110053 distinct states, run finished after 30001 ms. (steps per millisecond=61 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1251 cols
[2020-06-04 17:32:28] [INFO ] Computed 451 place invariants in 59 ms
[2020-06-04 17:32:29] [INFO ] [Real]Absence check using 450 positive place invariants in 249 ms returned sat
[2020-06-04 17:32:29] [INFO ] [Real]Absence check using 450 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 17:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:32] [INFO ] [Real]Absence check using state equation in 2671 ms returned sat
[2020-06-04 17:32:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:32:32] [INFO ] [Nat]Absence check using 450 positive place invariants in 269 ms returned sat
[2020-06-04 17:32:32] [INFO ] [Nat]Absence check using 450 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:32:35] [INFO ] [Nat]Absence check using state equation in 2759 ms returned sat
[2020-06-04 17:32:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-04 17:32:35] [INFO ] [Nat]Added 5 Read/Feed constraints in 10 ms returned sat
[2020-06-04 17:32:35] [INFO ] Deduced a trap composed of 12 places in 56 ms
[2020-06-04 17:32:35] [INFO ] Deduced a trap composed of 9 places in 35 ms
[2020-06-04 17:32:35] [INFO ] Deduced a trap composed of 18 places in 30 ms
[2020-06-04 17:32:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 290 ms
[2020-06-04 17:32:35] [INFO ] Computed and/alt/rep : 1200/7796/1200 causal constraints in 105 ms.
[2020-06-04 17:32:55] [INFO ] Added : 675 causal constraints over 135 iterations in 20196 ms.(timeout) Result :sat
[2020-06-04 17:32:55] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-06-04 17:32:56] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-06-04 17:32:56] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-06-04 17:32:56] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2020-06-04 17:32:56] [INFO ] Deduced a trap composed of 5 places in 91 ms
[2020-06-04 17:32:57] [INFO ] Deduced a trap composed of 5 places in 113 ms
[2020-06-04 17:32:57] [INFO ] Deduced a trap composed of 6 places in 113 ms
[2020-06-04 17:32:57] [INFO ] Deduced a trap composed of 8 places in 81 ms
[2020-06-04 17:32:58] [INFO ] Deduced a trap composed of 8 places in 102 ms
[2020-06-04 17:32:58] [INFO ] Deduced a trap composed of 5 places in 49 ms
[2020-06-04 17:32:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2560 ms
Attempting to minimize the solution found.
Minimization took 111 ms.
Incomplete Parikh walk after 203400 steps, including 959 resets, run finished after 1927 ms. (steps per millisecond=105 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1251 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 36 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 31 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1251 cols
[2020-06-04 17:33:00] [INFO ] Computed 451 place invariants in 35 ms
[2020-06-04 17:33:04] [INFO ] Implicit Places using invariants in 3976 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 3979 ms to find 1 implicit places.
[2020-06-04 17:33:04] [INFO ] Redundant transitions in 143 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:33:04] [INFO ] Computed 450 place invariants in 17 ms
[2020-06-04 17:33:08] [INFO ] Dead Transitions using invariants and state equation in 3699 ms returned []
Starting structural reductions, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 93 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2020-06-04 17:33:08] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:33:08] [INFO ] Computed 450 place invariants in 18 ms
[2020-06-04 17:33:12] [INFO ] Dead Transitions using invariants and state equation in 3609 ms returned []
Finished structural reductions, in 2 iterations. Remains : 1250/1251 places, 1201/1201 transitions.
Incomplete random walk after 1000000 steps, including 173 resets, run finished after 8815 ms. (steps per millisecond=113 ) properties seen :[0]
Interrupted Best-First random walk after 904509 steps, including 12 resets, run timeout after 5001 ms. (steps per millisecond=180 ) properties seen :[0]
Interrupted probabilistic random walk after 1912174 steps, run timeout after 30001 ms. (steps per millisecond=63 ) properties seen :[0]
Probabilistic random walk after 1912174 steps, saw 151642 distinct states, run finished after 30001 ms. (steps per millisecond=63 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:33:56] [INFO ] Computed 450 place invariants in 32 ms
[2020-06-04 17:33:56] [INFO ] [Real]Absence check using 449 positive place invariants in 350 ms returned sat
[2020-06-04 17:33:56] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 17:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:33:59] [INFO ] [Real]Absence check using state equation in 2768 ms returned sat
[2020-06-04 17:33:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:33:59] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-04 17:33:59] [INFO ] Deduced a trap composed of 5 places in 178 ms
[2020-06-04 17:33:59] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 12 places in 186 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 5 places in 138 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-06-04 17:34:00] [INFO ] Deduced a trap composed of 5 places in 114 ms
[2020-06-04 17:34:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1506 ms
[2020-06-04 17:34:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:34:01] [INFO ] [Nat]Absence check using 449 positive place invariants in 316 ms returned sat
[2020-06-04 17:34:01] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-04 17:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:34:04] [INFO ] [Nat]Absence check using state equation in 2751 ms returned sat
[2020-06-04 17:34:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-06-04 17:34:04] [INFO ] Deduced a trap composed of 15 places in 191 ms
[2020-06-04 17:34:04] [INFO ] Deduced a trap composed of 5 places in 170 ms
[2020-06-04 17:34:04] [INFO ] Deduced a trap composed of 5 places in 184 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 5 places in 72 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 6 places in 83 ms
[2020-06-04 17:34:05] [INFO ] Deduced a trap composed of 18 places in 98 ms
[2020-06-04 17:34:06] [INFO ] Deduced a trap composed of 12 places in 76 ms
[2020-06-04 17:34:06] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1861 ms
[2020-06-04 17:34:06] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 90 ms.
[2020-06-04 17:34:26] [INFO ] Added : 685 causal constraints over 137 iterations in 20242 ms.(timeout) Result :sat
[2020-06-04 17:34:27] [INFO ] Deduced a trap composed of 5 places in 1335 ms
[2020-06-04 17:34:28] [INFO ] Deduced a trap composed of 5 places in 118 ms
[2020-06-04 17:34:28] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-04 17:34:28] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-06-04 17:34:28] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-06-04 17:34:29] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-06-04 17:34:29] [INFO ] Deduced a trap composed of 5 places in 94 ms
[2020-06-04 17:34:29] [INFO ] Deduced a trap composed of 5 places in 83 ms
[2020-06-04 17:34:30] [INFO ] Deduced a trap composed of 5 places in 71 ms
[2020-06-04 17:34:30] [INFO ] Deduced a trap composed of 5 places in 64 ms
[2020-06-04 17:34:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4250 ms
Attempting to minimize the solution found.
Minimization took 123 ms.
Incomplete Parikh walk after 213200 steps, including 1021 resets, run finished after 2076 ms. (steps per millisecond=102 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 39 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 29 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:34:32] [INFO ] Computed 450 place invariants in 11 ms
[2020-06-04 17:34:36] [INFO ] Implicit Places using invariants in 3524 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:34:36] [INFO ] Computed 450 place invariants in 15 ms
[2020-06-04 17:34:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:34:52] [INFO ] Implicit Places using invariants and state equation in 15960 ms returned []
Implicit Place search using SMT with State Equation took 19492 ms to find 0 implicit places.
[2020-06-04 17:34:52] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:34:52] [INFO ] Computed 450 place invariants in 13 ms
[2020-06-04 17:34:55] [INFO ] Dead Transitions using invariants and state equation in 3275 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1201/1201 transitions.
Incomplete random walk after 100000 steps, including 17 resets, run finished after 1008 ms. (steps per millisecond=99 ) properties seen :[0]
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:34:56] [INFO ] Computed 450 place invariants in 12 ms
[2020-06-04 17:34:57] [INFO ] [Real]Absence check using 449 positive place invariants in 324 ms returned sat
[2020-06-04 17:34:57] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 13 ms returned sat
[2020-06-04 17:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:35:00] [INFO ] [Real]Absence check using state equation in 2765 ms returned sat
[2020-06-04 17:35:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:35:00] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:35:00] [INFO ] Deduced a trap composed of 5 places in 176 ms
[2020-06-04 17:35:00] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2020-06-04 17:35:00] [INFO ] Deduced a trap composed of 12 places in 139 ms
[2020-06-04 17:35:00] [INFO ] Deduced a trap composed of 5 places in 119 ms
[2020-06-04 17:35:00] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-04 17:35:01] [INFO ] Deduced a trap composed of 5 places in 73 ms
[2020-06-04 17:35:01] [INFO ] Deduced a trap composed of 18 places in 70 ms
[2020-06-04 17:35:01] [INFO ] Deduced a trap composed of 5 places in 54 ms
[2020-06-04 17:35:01] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1150 ms
[2020-06-04 17:35:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:35:01] [INFO ] [Nat]Absence check using 449 positive place invariants in 295 ms returned sat
[2020-06-04 17:35:01] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 17:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:35:05] [INFO ] [Nat]Absence check using state equation in 3276 ms returned sat
[2020-06-04 17:35:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-04 17:35:05] [INFO ] Deduced a trap composed of 15 places in 218 ms
[2020-06-04 17:35:05] [INFO ] Deduced a trap composed of 5 places in 188 ms
[2020-06-04 17:35:05] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 9 places in 145 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 5 places in 100 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 6 places in 115 ms
[2020-06-04 17:35:06] [INFO ] Deduced a trap composed of 18 places in 97 ms
[2020-06-04 17:35:07] [INFO ] Deduced a trap composed of 12 places in 82 ms
[2020-06-04 17:35:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1921 ms
[2020-06-04 17:35:07] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 82 ms.
[2020-06-04 17:35:21] [INFO ] Added : 555 causal constraints over 111 iterations in 14296 ms. Result :unknown
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1250 transition count 1201
Applied a total of 1 rules in 99 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
// Phase 1: matrix 1201 rows 1250 cols
[2020-06-04 17:35:21] [INFO ] Computed 450 place invariants in 17 ms
[2020-06-04 17:35:21] [INFO ] [Real]Absence check using 449 positive place invariants in 240 ms returned sat
[2020-06-04 17:35:21] [INFO ] [Real]Absence check using 449 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-04 17:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 17:35:24] [INFO ] [Real]Absence check using state equation in 2911 ms returned sat
[2020-06-04 17:35:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 17:35:24] [INFO ] [Real]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-04 17:35:25] [INFO ] Deduced a trap composed of 26 places in 196 ms
[2020-06-04 17:35:25] [INFO ] Deduced a trap composed of 21 places in 165 ms
[2020-06-04 17:35:25] [INFO ] Deduced a trap composed of 26 places in 153 ms
[2020-06-04 17:35:25] [INFO ] Deduced a trap composed of 15 places in 133 ms
[2020-06-04 17:35:25] [INFO ] Deduced a trap composed of 8 places in 116 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 15 places in 115 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 5 places in 108 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 18 places in 120 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 21 places in 107 ms
[2020-06-04 17:35:26] [INFO ] Deduced a trap composed of 26 places in 104 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 5 places in 88 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 5 places in 90 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 15 places in 91 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 5 places in 58 ms
[2020-06-04 17:35:27] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-06-04 17:35:27] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2876 ms
[2020-06-04 17:35:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 17:35:28] [INFO ] [Nat]Absence check using 449 positive place invariants in 323 ms returned sat
[2020-06-04 17:35:28] [INFO ] [Nat]Absence check using 449 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-04 17:35:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 17:35:31] [INFO ] [Nat]Absence check using state equation in 2677 ms returned sat
[2020-06-04 17:35:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-04 17:35:31] [INFO ] Deduced a trap composed of 26 places in 184 ms
[2020-06-04 17:35:31] [INFO ] Deduced a trap composed of 21 places in 174 ms
[2020-06-04 17:35:31] [INFO ] Deduced a trap composed of 21 places in 142 ms
[2020-06-04 17:35:31] [INFO ] Deduced a trap composed of 15 places in 178 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 8 places in 170 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 18 places in 166 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 5 places in 168 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 26 places in 140 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 5 places in 157 ms
[2020-06-04 17:35:32] [INFO ] Deduced a trap composed of 5 places in 117 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 5 places in 133 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 5 places in 110 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-06-04 17:35:33] [INFO ] Deduced a trap composed of 15 places in 42 ms
[2020-06-04 17:35:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2833 ms
[2020-06-04 17:35:33] [INFO ] Computed and/alt/rep : 1200/7792/1200 causal constraints in 86 ms.
[2020-06-04 17:35:53] [INFO ] Added : 680 causal constraints over 136 iterations in 20108 ms.(timeout) Result :sat
[2020-06-04 17:35:54] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-06-04 17:35:54] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-06-04 17:35:54] [INFO ] Deduced a trap composed of 5 places in 97 ms
[2020-06-04 17:35:54] [INFO ] Deduced a trap composed of 6 places in 76 ms
[2020-06-04 17:35:55] [INFO ] Deduced a trap composed of 5 places in 62 ms
[2020-06-04 17:35:55] [INFO ] Deduced a trap composed of 6 places in 60 ms
[2020-06-04 17:35:55] [INFO ] Deduced a trap composed of 5 places in 59 ms
[2020-06-04 17:35:55] [INFO ] Deduced a trap composed of 9 places in 69 ms
[2020-06-04 17:35:55] [INFO ] Deduced a trap composed of 5 places in 60 ms
[2020-06-04 17:35:56] [INFO ] Deduced a trap composed of 9 places in 50 ms
[2020-06-04 17:35:56] [INFO ] Deduced a trap composed of 5 places in 48 ms
[2020-06-04 17:35:56] [INFO ] Deduced a trap composed of 9 places in 46 ms
[2020-06-04 17:35:56] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2625 ms
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-06-04 17:35:56] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-04 17:35:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2020-06-04 17:35:57] [INFO ] Flatten gal took : 307 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldIIPs-PT-050A @ 3570 seconds
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS SYMMETRIES TOPOLOGICAL USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3560
rslt: Output for ReachabilityFireability @ ShieldIIPs-PT-050A
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 17:35:57 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 30044,
"runtime": 10.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 12,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p113) AND (1 <= p123) AND (1 <= p125) AND (1 <= p811) AND (1 <= p817) AND (1 <= p826) AND (1 <= p1038) AND (1 <= p1048) AND (1 <= p1052) AND (1 <= p1211) AND (1 <= p1215) AND (1 <= p1226))))",
"processed_size": 203,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 6133,
"conflict_clusters": 152,
"places": 1250,
"places_significant": 800,
"singleton_clusters": 0,
"transitions": 1201
},
"result":
{
"edges": 131,
"markings": 132,
"produced_by": "state space",
"value": true
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 12,
"problems": 12
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 2451/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 40000
lola: finding significant places
lola: 1250 places, 1201 transitions, 800 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p113 <= 1)
lola: LP says that atomic proposition is always true: (p123 <= 1)
lola: LP says that atomic proposition is always true: (p125 <= 1)
lola: LP says that atomic proposition is always true: (p811 <= 1)
lola: LP says that atomic proposition is always true: (p817 <= 1)
lola: LP says that atomic proposition is always true: (p826 <= 1)
lola: LP says that atomic proposition is always true: (p1038 <= 1)
lola: LP says that atomic proposition is always true: (p1048 <= 1)
lola: LP says that atomic proposition is always true: (p1052 <= 1)
lola: LP says that atomic proposition is always true: (p1211 <= 1)
lola: LP says that atomic proposition is always true: (p1215 <= 1)
lola: LP says that atomic proposition is always true: (p1226 <= 1)
lola: E (F (((1 <= p113) AND (1 <= p123) AND (1 <= p125) AND (1 <= p811) AND (1 <= p817) AND (1 <= p826) AND (1 <= p1038) AND (1 <= p1048) AND (1 <= p1052) AND (1 <= p1211) AND (1 <= p1215) AND (1 <= p1226))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p113) AND (1 <= p123) AND (1 <= p125) AND (1 <= p811) AND (1 <= p817) AND (1 <= p826) AND (1 <= p1038) AND (1 <= p1048) AND (1 <= p1052) AND (1 <= p1211) AND (1 <= p1215) AND (1 <= p1226))))
lola: processed formula length: 203
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p113) AND (1 <= p123) AND (1 <= p125) AND (1 <= p811) AND (1 <= p817) AND (1 <= p826) AND (1 <= p1038) AND (1 <= p1048) AND (1 <= p1052) AND (1 <= p1211) AND (1 <= p1215) AND (1 <= p1226))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: local time limit reached - aborting
lola: RESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 132 markings, 131 edges
lola: memory consumption: 30044 KB
lola: time consumption: 10 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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-4028"
echo " Executing tool itslola"
echo " Input is ShieldIIPs-PT-050A, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477100191"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-050A.tgz
mv ShieldIIPs-PT-050A execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;