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-159033477500503.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 ShieldPPPs-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033477500503
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 3.3K May 14 01:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 14 01:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 19:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 13:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 13:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 13 08:39 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 349K 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 ShieldPPPs-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591309928985

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 22:32:10] [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 22:32:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 22:32:10] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2020-06-04 22:32:10] [INFO ] Transformed 1363 places.
[2020-06-04 22:32:10] [INFO ] Transformed 1263 transitions.
[2020-06-04 22:32:10] [INFO ] Found NUPN structural information;
[2020-06-04 22:32:10] [INFO ] Parsed PT model containing 1363 places and 1263 transitions in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1263 rows 1363 cols
[2020-06-04 22:32:11] [INFO ] Computed 221 place invariants in 30 ms
[2020-06-04 22:32:11] [INFO ] [Real]Absence check using 221 positive place invariants in 175 ms returned sat
[2020-06-04 22:32:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:14] [INFO ] [Real]Absence check using state equation in 3020 ms returned sat
[2020-06-04 22:32:15] [INFO ] Deduced a trap composed of 22 places in 727 ms
[2020-06-04 22:32:16] [INFO ] Deduced a trap composed of 21 places in 605 ms
[2020-06-04 22:32:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s1162 s1163 s1164 s1173 s1174 s1179 s1187 s1188 s1189 s1192 s1193 s1205 s1206 s1207 s1208 s1215 s1216 s1217) 0)") while checking expression at index 0
[2020-06-04 22:32:16] [INFO ] [Real]Absence check using 221 positive place invariants in 165 ms returned sat
[2020-06-04 22:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:19] [INFO ] [Real]Absence check using state equation in 3250 ms returned sat
[2020-06-04 22:32:20] [INFO ] Deduced a trap composed of 24 places in 601 ms
[2020-06-04 22:32:21] [INFO ] Deduced a trap composed of 24 places in 580 ms
[2020-06-04 22:32:21] [INFO ] Deduced a trap composed of 14 places in 431 ms
[2020-06-04 22:32:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s1028 s1029 s1030 s1031 s1036 s1037 s1038 s1070 s1073) 0)") while checking expression at index 1
[2020-06-04 22:32:22] [INFO ] [Real]Absence check using 221 positive place invariants in 151 ms returned sat
[2020-06-04 22:32:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:25] [INFO ] [Real]Absence check using state equation in 3326 ms returned sat
[2020-06-04 22:32:26] [INFO ] Deduced a trap composed of 26 places in 638 ms
[2020-06-04 22:32:26] [INFO ] Deduced a trap composed of 19 places in 611 ms
[2020-06-04 22:32:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 22:32:27] [INFO ] Deduced a trap composed of 16 places in 772 ms
[2020-06-04 22:32:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1173 s1174 s1175 s1178 s1179) 0)") while checking expression at index 2
[2020-06-04 22:32:27] [INFO ] [Real]Absence check using 221 positive place invariants in 185 ms returned sat
[2020-06-04 22:32:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:31] [INFO ] [Real]Absence check using state equation in 3117 ms returned sat
[2020-06-04 22:32:31] [INFO ] Deduced a trap composed of 18 places in 658 ms
[2020-06-04 22:32:32] [INFO ] Deduced a trap composed of 33 places in 693 ms
[2020-06-04 22:32:33] [INFO ] Deduced a trap composed of 16 places in 986 ms
[2020-06-04 22:32:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s1162 s1163 s1164 s1165 s1166 s1167 s1168 s1169 s1173 s1174 s1175 s1178 s1179) 0)") while checking expression at index 3
[2020-06-04 22:32:33] [INFO ] [Real]Absence check using 221 positive place invariants in 220 ms returned sat
[2020-06-04 22:32:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:37] [INFO ] [Real]Absence check using state equation in 3234 ms returned sat
[2020-06-04 22:32:37] [INFO ] Deduced a trap composed of 16 places in 608 ms
[2020-06-04 22:32:38] [INFO ] Deduced a trap composed of 30 places in 452 ms
[2020-06-04 22:32:38] [INFO ] Deduced a trap composed of 16 places in 441 ms
[2020-06-04 22:32:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s1095 s1096 s1097 s1098 s1099 s1100 s1101 s1102 s1106 s1138 s1139 s1140) 0)") while checking expression at index 4
Support contains 39 out of 1363 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 1363 transition count 1122
Reduce places removed 141 places and 0 transitions.
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 1222 transition count 1122
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 282 place count 1222 transition count 1024
Deduced a syphon composed of 98 places in 5 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 478 place count 1124 transition count 1024
Symmetric choice reduction at 2 with 135 rule applications. Total rules 613 place count 1124 transition count 1024
Deduced a syphon composed of 135 places in 4 ms
Reduce places removed 135 places and 135 transitions.
Iterating global reduction 2 with 270 rules applied. Total rules applied 883 place count 989 transition count 889
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 883 place count 989 transition count 832
Deduced a syphon composed of 57 places in 2 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 2 with 114 rules applied. Total rules applied 997 place count 932 transition count 832
Performed 282 Post agglomeration using F-continuation condition.Transition count delta: 282
Deduced a syphon composed of 282 places in 1 ms
Reduce places removed 282 places and 0 transitions.
Iterating global reduction 2 with 564 rules applied. Total rules applied 1561 place count 650 transition count 550
Partial Free-agglomeration rule applied 163 times.
Drop transitions removed 163 transitions
Iterating global reduction 2 with 163 rules applied. Total rules applied 1724 place count 650 transition count 550
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 1726 place count 650 transition count 550
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1727 place count 649 transition count 549
Applied a total of 1727 rules in 449 ms. Remains 649 /1363 variables (removed 714) and now considering 549/1263 (removed 714) transitions.
Finished structural reductions, in 1 iterations. Remains : 649/1363 places, 549/1263 transitions.
Incomplete random walk after 1000000 steps, including 403 resets, run finished after 6331 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0, 1, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 41 resets, run finished after 3452 ms. (steps per millisecond=289 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 66 resets, run finished after 2998 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 41 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties seen :[0, 0, 1]
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 549 rows 649 cols
[2020-06-04 22:32:55] [INFO ] Computed 221 place invariants in 15 ms
[2020-06-04 22:32:55] [INFO ] [Real]Absence check using 208 positive place invariants in 831 ms returned sat
[2020-06-04 22:32:56] [INFO ] [Real]Absence check using 208 positive and 13 generalized place invariants in 6 ms returned sat
[2020-06-04 22:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:56] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2020-06-04 22:32:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:32:57] [INFO ] [Nat]Absence check using 208 positive place invariants in 134 ms returned sat
[2020-06-04 22:32:57] [INFO ] [Nat]Absence check using 208 positive and 13 generalized place invariants in 10 ms returned sat
[2020-06-04 22:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:32:57] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 8 places in 131 ms
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 9 places in 110 ms
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 4 places in 145 ms
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2020-06-04 22:32:58] [INFO ] Deduced a trap composed of 6 places in 105 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 15 places in 113 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 9 places in 116 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 5 places in 106 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-04 22:32:59] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 4 places in 113 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 7 places in 100 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 6 places in 111 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 8 places in 130 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 4 places in 118 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 12 places in 143 ms
[2020-06-04 22:33:00] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 8 places in 112 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 4 places in 116 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 11 places in 82 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2020-06-04 22:33:01] [INFO ] Deduced a trap composed of 9 places in 82 ms
[2020-06-04 22:33:02] [INFO ] Deduced a trap composed of 8 places in 84 ms
[2020-06-04 22:33:02] [INFO ] Deduced a trap composed of 8 places in 80 ms
[2020-06-04 22:33:02] [INFO ] Deduced a trap composed of 13 places in 57 ms
[2020-06-04 22:33:02] [INFO ] Deduced a trap composed of 12 places in 99 ms
[2020-06-04 22:33:02] [INFO ] Deduced a trap composed of 7 places in 80 ms
[2020-06-04 22:33:02] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 4497 ms
[2020-06-04 22:33:02] [INFO ] Computed and/alt/rep : 542/1669/542 causal constraints in 47 ms.
[2020-06-04 22:33:14] [INFO ] Added : 503 causal constraints over 102 iterations in 12201 ms. Result :unknown
[2020-06-04 22:33:14] [INFO ] [Real]Absence check using 208 positive place invariants in 116 ms returned sat
[2020-06-04 22:33:14] [INFO ] [Real]Absence check using 208 positive and 13 generalized place invariants in 14 ms returned sat
[2020-06-04 22:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:33:15] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2020-06-04 22:33:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:33:16] [INFO ] [Nat]Absence check using 208 positive place invariants in 79 ms returned sat
[2020-06-04 22:33:16] [INFO ] [Nat]Absence check using 208 positive and 13 generalized place invariants in 6 ms returned sat
[2020-06-04 22:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:33:16] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2020-06-04 22:33:16] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 8 places in 135 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 10 places in 108 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 6 places in 101 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 8 places in 94 ms
[2020-06-04 22:33:17] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2020-06-04 22:33:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 1051 ms
FORMULA ShieldPPPs-PT-020B-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 50300 steps, including 664 resets, run finished after 340 ms. (steps per millisecond=147 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 649 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 649/649 places, 549/549 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 649 transition count 548
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 648 transition count 548
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 648 transition count 546
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 646 transition count 546
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 36 place count 631 transition count 531
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 631 transition count 531
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 47 place count 631 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 630 transition count 530
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 629 transition count 529
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 628 transition count 528
Applied a total of 50 rules in 219 ms. Remains 628 /649 variables (removed 21) and now considering 528/549 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/649 places, 528/549 transitions.
Incomplete random walk after 1000000 steps, including 240 resets, run finished after 5996 ms. (steps per millisecond=166 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 22 resets, run finished after 2992 ms. (steps per millisecond=334 ) properties seen :[0]
Interrupted probabilistic random walk after 4211083 steps, run timeout after 30001 ms. (steps per millisecond=140 ) properties seen :[0]
Probabilistic random walk after 4211083 steps, saw 492168 distinct states, run finished after 30001 ms. (steps per millisecond=140 ) properties seen :[0]
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:33:57] [INFO ] Computed 221 place invariants in 14 ms
[2020-06-04 22:33:57] [INFO ] [Real]Absence check using 214 positive place invariants in 111 ms returned sat
[2020-06-04 22:33:57] [INFO ] [Real]Absence check using 214 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-04 22:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:33:58] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2020-06-04 22:33:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:33:58] [INFO ] [Nat]Absence check using 214 positive place invariants in 111 ms returned sat
[2020-06-04 22:33:58] [INFO ] [Nat]Absence check using 214 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-04 22:33:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:33:59] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2020-06-04 22:33:59] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-06-04 22:34:00] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-06-04 22:34:00] [INFO ] Deduced a trap composed of 5 places in 191 ms
[2020-06-04 22:34:00] [INFO ] Deduced a trap composed of 7 places in 193 ms
[2020-06-04 22:34:00] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-06-04 22:34:00] [INFO ] Deduced a trap composed of 4 places in 188 ms
[2020-06-04 22:34:01] [INFO ] Deduced a trap composed of 4 places in 179 ms
[2020-06-04 22:34:01] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-06-04 22:34:01] [INFO ] Deduced a trap composed of 4 places in 208 ms
[2020-06-04 22:34:01] [INFO ] Deduced a trap composed of 4 places in 178 ms
[2020-06-04 22:34:01] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2020-06-04 22:34:02] [INFO ] Deduced a trap composed of 5 places in 165 ms
[2020-06-04 22:34:02] [INFO ] Deduced a trap composed of 4 places in 182 ms
[2020-06-04 22:34:02] [INFO ] Deduced a trap composed of 14 places in 192 ms
[2020-06-04 22:34:02] [INFO ] Deduced a trap composed of 8 places in 173 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 5 places in 168 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 4 places in 163 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 6 places in 140 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2020-06-04 22:34:03] [INFO ] Deduced a trap composed of 5 places in 144 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 4 places in 156 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 6 places in 197 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 4 places in 122 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 8 places in 123 ms
[2020-06-04 22:34:04] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 6 places in 138 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 6 places in 132 ms
[2020-06-04 22:34:05] [INFO ] Deduced a trap composed of 17 places in 128 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 9 places in 103 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 6 places in 104 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 6 places in 122 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 4 places in 95 ms
[2020-06-04 22:34:06] [INFO ] Deduced a trap composed of 4 places in 109 ms
[2020-06-04 22:34:06] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7118 ms
[2020-06-04 22:34:06] [INFO ] Computed and/alt/rep : 524/1575/524 causal constraints in 50 ms.
[2020-06-04 22:34:19] [INFO ] Added : 485 causal constraints over 101 iterations in 12916 ms. Result :unknown
Incomplete Parikh walk after 46800 steps, including 755 resets, run finished after 321 ms. (steps per millisecond=145 ) properties seen :[0] could not realise parikh vector
Support contains 12 out of 628 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 628/628 places, 528/528 transitions.
Applied a total of 0 rules in 17 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 528/528 transitions.
Starting structural reductions, iteration 0 : 628/628 places, 528/528 transitions.
Applied a total of 0 rules in 17 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:34:20] [INFO ] Computed 221 place invariants in 19 ms
[2020-06-04 22:34:21] [INFO ] Implicit Places using invariants in 1744 ms returned []
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:34:21] [INFO ] Computed 221 place invariants in 3 ms
[2020-06-04 22:34:25] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 5802 ms to find 0 implicit places.
[2020-06-04 22:34:25] [INFO ] Redundant transitions in 71 ms returned []
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:34:25] [INFO ] Computed 221 place invariants in 6 ms
[2020-06-04 22:34:27] [INFO ] Dead Transitions using invariants and state equation in 1055 ms returned []
Finished structural reductions, in 1 iterations. Remains : 628/628 places, 528/528 transitions.
Incomplete random walk after 100000 steps, including 24 resets, run finished after 538 ms. (steps per millisecond=185 ) properties seen :[0]
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:34:27] [INFO ] Computed 221 place invariants in 3 ms
[2020-06-04 22:34:27] [INFO ] [Real]Absence check using 214 positive place invariants in 110 ms returned sat
[2020-06-04 22:34:27] [INFO ] [Real]Absence check using 214 positive and 7 generalized place invariants in 5 ms returned sat
[2020-06-04 22:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:34:28] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2020-06-04 22:34:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:34:28] [INFO ] [Nat]Absence check using 214 positive place invariants in 109 ms returned sat
[2020-06-04 22:34:28] [INFO ] [Nat]Absence check using 214 positive and 7 generalized place invariants in 4 ms returned sat
[2020-06-04 22:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:34:29] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2020-06-04 22:34:30] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-06-04 22:34:30] [INFO ] Deduced a trap composed of 6 places in 204 ms
[2020-06-04 22:34:30] [INFO ] Deduced a trap composed of 5 places in 189 ms
[2020-06-04 22:34:30] [INFO ] Deduced a trap composed of 7 places in 208 ms
[2020-06-04 22:34:30] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-06-04 22:34:31] [INFO ] Deduced a trap composed of 4 places in 193 ms
[2020-06-04 22:34:31] [INFO ] Deduced a trap composed of 4 places in 168 ms
[2020-06-04 22:34:31] [INFO ] Deduced a trap composed of 4 places in 139 ms
[2020-06-04 22:34:31] [INFO ] Deduced a trap composed of 4 places in 204 ms
[2020-06-04 22:34:31] [INFO ] Deduced a trap composed of 4 places in 192 ms
[2020-06-04 22:34:32] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-06-04 22:34:32] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2020-06-04 22:34:32] [INFO ] Deduced a trap composed of 4 places in 176 ms
[2020-06-04 22:34:32] [INFO ] Deduced a trap composed of 14 places in 189 ms
[2020-06-04 22:34:32] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-06-04 22:34:33] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-06-04 22:34:33] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-06-04 22:34:33] [INFO ] Deduced a trap composed of 4 places in 178 ms
[2020-06-04 22:34:33] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-06-04 22:34:33] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 5 places in 168 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 4 places in 144 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 6 places in 137 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 11 places in 140 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 4 places in 161 ms
[2020-06-04 22:34:34] [INFO ] Deduced a trap composed of 8 places in 124 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 8 places in 126 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 6 places in 124 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 6 places in 125 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 6 places in 149 ms
[2020-06-04 22:34:35] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 17 places in 150 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 9 places in 122 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 6 places in 145 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-06-04 22:34:36] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-06-04 22:34:37] [INFO ] Deduced a trap composed of 4 places in 125 ms
[2020-06-04 22:34:37] [INFO ] Trap strengthening (SAT) tested/added 40/39 trap constraints in 7276 ms
[2020-06-04 22:34:37] [INFO ] Computed and/alt/rep : 524/1575/524 causal constraints in 34 ms.
[2020-06-04 22:34:48] [INFO ] Added : 485 causal constraints over 101 iterations in 11583 ms. Result :unknown
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 628 transition count 528
Applied a total of 2 rules in 55 ms. Remains 628 /628 variables (removed 0) and now considering 528/528 (removed 0) transitions.
// Phase 1: matrix 528 rows 628 cols
[2020-06-04 22:34:48] [INFO ] Computed 221 place invariants in 6 ms
[2020-06-04 22:34:48] [INFO ] [Real]Absence check using 215 positive place invariants in 111 ms returned sat
[2020-06-04 22:34:48] [INFO ] [Real]Absence check using 215 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-04 22:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 22:34:49] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2020-06-04 22:34:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-04 22:34:49] [INFO ] [Real]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 4 places in 184 ms
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 6 places in 154 ms
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 4 places in 158 ms
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 6 places in 191 ms
[2020-06-04 22:34:50] [INFO ] Deduced a trap composed of 7 places in 185 ms
[2020-06-04 22:34:51] [INFO ] Deduced a trap composed of 9 places in 170 ms
[2020-06-04 22:34:51] [INFO ] Deduced a trap composed of 26 places in 166 ms
[2020-06-04 22:34:51] [INFO ] Deduced a trap composed of 12 places in 164 ms
[2020-06-04 22:34:51] [INFO ] Deduced a trap composed of 4 places in 127 ms
[2020-06-04 22:34:51] [INFO ] Deduced a trap composed of 23 places in 129 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 14 places in 113 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 6 places in 136 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 23 places in 119 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 5 places in 141 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 20 places in 117 ms
[2020-06-04 22:34:52] [INFO ] Deduced a trap composed of 27 places in 121 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 17 places in 145 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 29 places in 152 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 27 places in 145 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 39 places in 133 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 33 places in 94 ms
[2020-06-04 22:34:53] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2020-06-04 22:34:54] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2020-06-04 22:34:54] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2020-06-04 22:34:54] [INFO ] Deduced a trap composed of 30 places in 109 ms
[2020-06-04 22:34:54] [INFO ] Deduced a trap composed of 33 places in 117 ms
[2020-06-04 22:34:54] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4743 ms
[2020-06-04 22:34:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 22:34:54] [INFO ] [Nat]Absence check using 215 positive place invariants in 108 ms returned sat
[2020-06-04 22:34:54] [INFO ] [Nat]Absence check using 215 positive and 6 generalized place invariants in 4 ms returned sat
[2020-06-04 22:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 22:34:55] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2020-06-04 22:34:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-06-04 22:34:55] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-06-04 22:34:55] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 6 places in 98 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 4 places in 94 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 6 places in 119 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2020-06-04 22:34:56] [INFO ] Deduced a trap composed of 6 places in 90 ms
[2020-06-04 22:34:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1127 ms
[2020-06-04 22:34:56] [INFO ] Computed and/alt/rep : 524/1584/524 causal constraints in 37 ms.
[2020-06-04 22:35:08] [INFO ] Added : 483 causal constraints over 97 iterations in 11995 ms. Result :unknown
[2020-06-04 22:35:08] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2020-06-04 22:35:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
[2020-06-04 22:35:09] [INFO ] Flatten gal took : 140 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-020B @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-020B

{
"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 22:35:09 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 23204,
"runtime": 4.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": 5,
"adisj": 3,
"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 <= p21) AND (1 <= p417) AND (1 <= p439) AND ((p244 <= 0)) AND (1 <= p192) AND (((1 <= p378)) OR ((1 <= p40) AND (1 <= p62))) AND (((1 <= p39) AND (1 <= p41)) OR ((1 <= p51) AND (1 <= p61))))))",
"processed_size": 204,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2331,
"conflict_clusters": 113,
"places": 628,
"places_significant": 407,
"singleton_clusters": 0,
"transitions": 528
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 34,
"problems": 4
},
"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: 1156/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 20096
lola: finding significant places
lola: 628 places, 528 transitions, 407 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: (p21 <= 1)
lola: LP says that atomic proposition is always true: (p417 <= 1)
lola: LP says that atomic proposition is always true: (p439 <= 1)
lola: LP says that atomic proposition is always true: (p244 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p378 <= 1)
lola: LP says that atomic proposition is always true: (p40 <= 1)
lola: LP says that atomic proposition is always true: (p62 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p51 <= 1)
lola: LP says that atomic proposition is always true: (p61 <= 1)
lola: E (F (((1 <= p21) AND (1 <= p417) AND (1 <= p439) AND ((p244 <= 0)) AND (1 <= p192) AND (((1 <= p378)) OR ((1 <= p40) AND (1 <= p62))) AND (((1 <= p39) AND (1 <= p41)) OR ((1 <= p51) AND (1 <= p61))))))
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 <= p21) AND (1 <= p417) AND (1 <= p439) AND ((p244 <= 0)) AND (1 <= p192) AND (((1 <= p378)) OR ((1 <= p40) AND (1 <= p62))) AND (((1 <= p39) AND (1 <= p41)) OR ((1 <= p51) AND (1 <= p61))))))
lola: processed formula length: 204
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: local time limit reached - aborting
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 <= p21) AND (1 <= p417) AND (1 <= p439) AND ((p244 <= 0)) AND (1 <= p192) AND (((1 <= p378)) OR ((1 <= p40) AND (1 <= p62))) AND (((1 <= p39) AND (1 <= p41)) OR ((1 <= p51) AND (1 <= p61))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: memory consumption: 23204 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
lola: state equation: calling and running sara
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="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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-159033477500503"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-020B.tgz
mv ShieldPPPs-PT-020B 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;