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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 3.5K May 14 02:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 14 02:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 19:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 19:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.9K May 13 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 13 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 13 09:16 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 625K 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 ShieldRVs-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldRVs-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591333602011

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 05:06:45] [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-05 05:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 05:06:45] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2020-06-05 05:06:45] [INFO ] Transformed 2003 places.
[2020-06-05 05:06:45] [INFO ] Transformed 2253 transitions.
[2020-06-05 05:06:45] [INFO ] Found NUPN structural information;
[2020-06-05 05:06:45] [INFO ] Parsed PT model containing 2003 places and 2253 transitions in 332 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 132 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 158 ms. (steps per millisecond=63 ) properties seen :[1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 34 ms. (steps per millisecond=294 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 2253 rows 2003 cols
[2020-06-05 05:06:46] [INFO ] Computed 201 place invariants in 121 ms
[2020-06-05 05:06:47] [INFO ] [Real]Absence check using 201 positive place invariants in 228 ms returned sat
[2020-06-05 05:06:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:51] [INFO ] [Real]Absence check using state equation in 4006 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 05:06:51] [INFO ] [Real]Absence check using 201 positive place invariants in 307 ms returned sat
[2020-06-05 05:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:06:56] [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: Broken pipe (= s1251 (- t982 t983))") while checking expression at index 1
[2020-06-05 05:06:56] [INFO ] [Real]Absence check using 201 positive place invariants in 334 ms returned sat
[2020-06-05 05:06:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:07:01] [INFO ] [Real]Absence check using state equation in 4299 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 05:07:01] [INFO ] [Real]Absence check using 201 positive place invariants in 217 ms returned sat
[2020-06-05 05:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:07:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 05:07:06] [INFO ] [Real]Absence check using state equation in 4502 ms returned (error "Failed to check-sat")
Support contains 40 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 197 place count 2003 transition count 2056
Reduce places removed 197 places and 0 transitions.
Iterating post reduction 1 with 197 rules applied. Total rules applied 394 place count 1806 transition count 2056
Performed 245 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 245 Pre rules applied. Total rules applied 394 place count 1806 transition count 1811
Deduced a syphon composed of 245 places in 7 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 2 with 490 rules applied. Total rules applied 884 place count 1561 transition count 1811
Symmetric choice reduction at 2 with 341 rule applications. Total rules 1225 place count 1561 transition count 1811
Deduced a syphon composed of 341 places in 10 ms
Reduce places removed 341 places and 341 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1907 place count 1220 transition count 1470
Performed 138 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 138 Pre rules applied. Total rules applied 1907 place count 1220 transition count 1332
Deduced a syphon composed of 138 places in 8 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 2183 place count 1082 transition count 1332
Performed 347 Post agglomeration using F-continuation condition.Transition count delta: 347
Deduced a syphon composed of 347 places in 2 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 2 with 694 rules applied. Total rules applied 2877 place count 735 transition count 985
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 2 with 100 rules applied. Total rules applied 2977 place count 735 transition count 985
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2978 place count 734 transition count 984
Applied a total of 2978 rules in 730 ms. Remains 734 /2003 variables (removed 1269) and now considering 984/2253 (removed 1269) transitions.
Finished structural reductions, in 1 iterations. Remains : 734/2003 places, 984/2253 transitions.
Incomplete random walk after 1000000 steps, including 1589 resets, run finished after 4339 ms. (steps per millisecond=230 ) properties seen :[0, 1, 1, 0]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 162 resets, run finished after 2637 ms. (steps per millisecond=379 ) properties seen :[1, 0]
FORMULA ShieldRVs-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 148 resets, run finished after 2501 ms. (steps per millisecond=399 ) properties seen :[0]
// Phase 1: matrix 984 rows 734 cols
[2020-06-05 05:07:16] [INFO ] Computed 201 place invariants in 4 ms
[2020-06-05 05:07:16] [INFO ] [Real]Absence check using 201 positive place invariants in 114 ms returned sat
[2020-06-05 05:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:07:18] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 14 places in 106 ms
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 6 places in 108 ms
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 14 places in 112 ms
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 18 places in 90 ms
[2020-06-05 05:07:18] [INFO ] Deduced a trap composed of 14 places in 81 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 21 places in 60 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 14 places in 104 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 6 places in 102 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 10 places in 64 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 7 places in 90 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 9 places in 48 ms
[2020-06-05 05:07:19] [INFO ] Deduced a trap composed of 10 places in 58 ms
[2020-06-05 05:07:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1794 ms
[2020-06-05 05:07:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:07:20] [INFO ] [Nat]Absence check using 201 positive place invariants in 86 ms returned sat
[2020-06-05 05:07:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:07:21] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2020-06-05 05:07:21] [INFO ] Deduced a trap composed of 6 places in 94 ms
[2020-06-05 05:07:21] [INFO ] Deduced a trap composed of 16 places in 135 ms
[2020-06-05 05:07:21] [INFO ] Deduced a trap composed of 12 places in 167 ms
[2020-06-05 05:07:21] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 16 places in 107 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 12 places in 135 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 14 places in 123 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 9 places in 127 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 17 places in 84 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 18 places in 104 ms
[2020-06-05 05:07:22] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2020-06-05 05:07:23] [INFO ] Deduced a trap composed of 7 places in 83 ms
[2020-06-05 05:07:23] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2020-06-05 05:07:23] [INFO ] Deduced a trap composed of 10 places in 93 ms
[2020-06-05 05:07:23] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-05 05:07:23] [INFO ] Deduced a trap composed of 10 places in 63 ms
[2020-06-05 05:07:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2313 ms
[2020-06-05 05:07:23] [INFO ] Computed and/alt/rep : 977/6803/977 causal constraints in 80 ms.
[2020-06-05 05:07:44] [INFO ] Added : 625 causal constraints over 125 iterations in 20430 ms.(timeout) Result :sat
[2020-06-05 05:07:44] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-06-05 05:07:44] [INFO ] Deduced a trap composed of 15 places in 97 ms
[2020-06-05 05:07:44] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2020-06-05 05:07:45] [INFO ] Deduced a trap composed of 20 places in 74 ms
[2020-06-05 05:07:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1241 ms
Attempting to minimize the solution found.
Minimization took 130 ms.
Incomplete Parikh walk after 116100 steps, including 680 resets, run finished after 752 ms. (steps per millisecond=154 ) properties seen :[0] could not realise parikh vector
Support contains 19 out of 734 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 734/734 places, 984/984 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 734 transition count 983
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 733 transition count 983
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 733 transition count 977
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 727 transition count 977
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 719 transition count 969
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 719 transition count 969
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 718 transition count 968
Applied a total of 33 rules in 469 ms. Remains 718 /734 variables (removed 16) and now considering 968/984 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 718/734 places, 968/984 transitions.
Incomplete random walk after 1000000 steps, including 1666 resets, run finished after 3798 ms. (steps per millisecond=263 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 156 resets, run finished after 2799 ms. (steps per millisecond=357 ) properties seen :[0]
Interrupted probabilistic random walk after 2897605 steps, run timeout after 30001 ms. (steps per millisecond=96 ) properties seen :[0]
Probabilistic random walk after 2897605 steps, saw 502544 distinct states, run finished after 30003 ms. (steps per millisecond=96 ) properties seen :[0]
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:08:23] [INFO ] Computed 201 place invariants in 9 ms
[2020-06-05 05:08:23] [INFO ] [Real]Absence check using 201 positive place invariants in 88 ms returned sat
[2020-06-05 05:08:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:08:24] [INFO ] [Real]Absence check using state equation in 1435 ms returned sat
[2020-06-05 05:08:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:08:25] [INFO ] [Nat]Absence check using 201 positive place invariants in 113 ms returned sat
[2020-06-05 05:08:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:08:26] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2020-06-05 05:08:26] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-06-05 05:08:26] [INFO ] Deduced a trap composed of 10 places in 111 ms
[2020-06-05 05:08:26] [INFO ] Deduced a trap composed of 10 places in 102 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 11 places in 75 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 10 places in 107 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 10 places in 99 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 20 places in 61 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 15 places in 70 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 12 places in 72 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 7 places in 92 ms
[2020-06-05 05:08:27] [INFO ] Deduced a trap composed of 11 places in 73 ms
[2020-06-05 05:08:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1543 ms
[2020-06-05 05:08:28] [INFO ] Computed and/alt/rep : 963/6843/963 causal constraints in 82 ms.
[2020-06-05 05:08:48] [INFO ] Added : 605 causal constraints over 121 iterations in 20263 ms.(timeout) Result :sat
[2020-06-05 05:08:48] [INFO ] Deduced a trap composed of 6 places in 142 ms
[2020-06-05 05:08:48] [INFO ] Deduced a trap composed of 16 places in 85 ms
[2020-06-05 05:08:49] [INFO ] Deduced a trap composed of 6 places in 95 ms
[2020-06-05 05:08:49] [INFO ] Deduced a trap composed of 7 places in 71 ms
[2020-06-05 05:08:49] [INFO ] Deduced a trap composed of 7 places in 26 ms
[2020-06-05 05:08:49] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1356 ms
Attempting to minimize the solution found.
Minimization took 143 ms.
Incomplete Parikh walk after 98900 steps, including 719 resets, run finished after 620 ms. (steps per millisecond=159 ) properties seen :[0] could not realise parikh vector
Support contains 19 out of 718 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 718/718 places, 968/968 transitions.
Applied a total of 0 rules in 29 ms. Remains 718 /718 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 718/718 places, 968/968 transitions.
Starting structural reductions, iteration 0 : 718/718 places, 968/968 transitions.
Applied a total of 0 rules in 188 ms. Remains 718 /718 variables (removed 0) and now considering 968/968 (removed 0) transitions.
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:08:50] [INFO ] Computed 201 place invariants in 10 ms
[2020-06-05 05:08:52] [INFO ] Implicit Places using invariants in 1326 ms returned []
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:08:52] [INFO ] Computed 201 place invariants in 5 ms
[2020-06-05 05:08:56] [INFO ] Implicit Places using invariants and state equation in 4693 ms returned []
Implicit Place search using SMT with State Equation took 6023 ms to find 0 implicit places.
[2020-06-05 05:08:57] [INFO ] Redundant transitions in 483 ms returned []
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:08:57] [INFO ] Computed 201 place invariants in 4 ms
[2020-06-05 05:08:58] [INFO ] Dead Transitions using invariants and state equation in 1453 ms returned []
Finished structural reductions, in 1 iterations. Remains : 718/718 places, 968/968 transitions.
Incomplete random walk after 100000 steps, including 166 resets, run finished after 370 ms. (steps per millisecond=270 ) properties seen :[0]
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:08:59] [INFO ] Computed 201 place invariants in 4 ms
[2020-06-05 05:08:59] [INFO ] [Real]Absence check using 201 positive place invariants in 117 ms returned sat
[2020-06-05 05:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:09:00] [INFO ] [Real]Absence check using state equation in 1308 ms returned sat
[2020-06-05 05:09:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:09:00] [INFO ] [Nat]Absence check using 201 positive place invariants in 110 ms returned sat
[2020-06-05 05:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:09:02] [INFO ] [Nat]Absence check using state equation in 1314 ms returned sat
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 6 places in 93 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 10 places in 76 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 10 places in 69 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 11 places in 86 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 10 places in 60 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 10 places in 50 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 12 places in 57 ms
[2020-06-05 05:09:02] [INFO ] Deduced a trap composed of 20 places in 64 ms
[2020-06-05 05:09:03] [INFO ] Deduced a trap composed of 15 places in 60 ms
[2020-06-05 05:09:03] [INFO ] Deduced a trap composed of 12 places in 60 ms
[2020-06-05 05:09:03] [INFO ] Deduced a trap composed of 7 places in 45 ms
[2020-06-05 05:09:03] [INFO ] Deduced a trap composed of 11 places in 41 ms
[2020-06-05 05:09:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1070 ms
[2020-06-05 05:09:03] [INFO ] Computed and/alt/rep : 963/6843/963 causal constraints in 69 ms.
[2020-06-05 05:09:20] [INFO ] Added : 580 causal constraints over 116 iterations in 17401 ms. Result :(error "Failed to check-sat")
Applied a total of 0 rules in 22 ms. Remains 718 /718 variables (removed 0) and now considering 968/968 (removed 0) transitions.
// Phase 1: matrix 968 rows 718 cols
[2020-06-05 05:09:20] [INFO ] Computed 201 place invariants in 4 ms
[2020-06-05 05:09:20] [INFO ] [Real]Absence check using 201 positive place invariants in 121 ms returned sat
[2020-06-05 05:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 05:09:22] [INFO ] [Real]Absence check using state equation in 1300 ms returned sat
[2020-06-05 05:09:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 05:09:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 81 ms returned sat
[2020-06-05 05:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 05:09:23] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2020-06-05 05:09:23] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-06-05 05:09:23] [INFO ] Deduced a trap composed of 10 places in 79 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 10 places in 108 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 11 places in 58 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 10 places in 54 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 12 places in 64 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 20 places in 104 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 15 places in 55 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 12 places in 49 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 7 places in 73 ms
[2020-06-05 05:09:24] [INFO ] Deduced a trap composed of 11 places in 113 ms
[2020-06-05 05:09:24] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1295 ms
[2020-06-05 05:09:25] [INFO ] Computed and/alt/rep : 963/6843/963 causal constraints in 65 ms.
[2020-06-05 05:09:45] [INFO ] Added : 655 causal constraints over 131 iterations in 20245 ms.(timeout) Result :sat
[2020-06-05 05:09:45] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-06-05 05:09:45] [INFO ] Deduced a trap composed of 6 places in 54 ms
[2020-06-05 05:09:46] [INFO ] Deduced a trap composed of 9 places in 72 ms
[2020-06-05 05:09:46] [INFO ] Deduced a trap composed of 7 places in 76 ms
[2020-06-05 05:09:46] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-06-05 05:09:46] [INFO ] Deduced a trap composed of 7 places in 29 ms
[2020-06-05 05:09:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1782 ms
Attempting to minimize the solution found.
Minimization took 165 ms.
[2020-06-05 05:09:47] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-05 05:09:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2020-06-05 05:09:47] [INFO ] Flatten gal took : 231 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVs-PT-050B @ 3570 seconds
vrfy: finished
info: timeLeft: 3564
rslt: Output for ReachabilityFireability @ ShieldRVs-PT-050B

{
"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": "Fri Jun 5 05:09:48 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 32412,
"runtime": 6.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": 7,
"adisj": 3,
"aneg": 0,
"comp": 19,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 19,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p509) AND (1 <= p322) AND (1 <= p324) AND (1 <= p328) AND (1 <= p145) AND (1 <= p109) AND (1 <= p110) AND (1 <= p115) AND (1 <= p32) AND ((p69 <= 0) OR (p75 <= 0) OR (p83 <= 0)) AND (((1 <= p450)) OR ((1 <= p455) AND (1 <= p461))) AND (((1 <= p351)) OR ((1 <= p363)) OR ((1 <= p612)) OR ((1 <= p347))))))",
"processed_size": 323,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 4735,
"conflict_clusters": 68,
"places": 718,
"places_significant": 517,
"singleton_clusters": 0,
"transitions": 968
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 300,
"problems": 24
},
"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: 1686/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 22976
lola: finding significant places
lola: 718 places, 968 transitions, 517 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: (p509 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p324 <= 1)
lola: LP says that atomic proposition is always true: (p328 <= 1)
lola: LP says that atomic proposition is always true: (p145 <= 1)
lola: LP says that atomic proposition is always true: (p109 <= 1)
lola: LP says that atomic proposition is always true: (p110 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p69 <= 1)
lola: LP says that atomic proposition is always true: (p75 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p450 <= 1)
lola: LP says that atomic proposition is always true: (p455 <= 1)
lola: LP says that atomic proposition is always true: (p461 <= 1)
lola: LP says that atomic proposition is always true: (p351 <= 1)
lola: LP says that atomic proposition is always true: (p363 <= 1)
lola: LP says that atomic proposition is always true: (p612 <= 1)
lola: LP says that atomic proposition is always true: (p347 <= 1)
lola: E (F (((1 <= p509) AND (1 <= p322) AND (1 <= p324) AND (1 <= p328) AND (1 <= p145) AND (1 <= p109) AND (1 <= p110) AND (1 <= p115) AND (1 <= p32) AND ((p69 <= 0) OR (p75 <= 0) OR (p83 <= 0)) AND (((1 <= p450)) OR ((1 <= p455) AND (1 <= p461))) AND (((1 <= p351)) OR ((1 <= p363)) OR ((1 <= p612)) OR ((1 <= p347))))))
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 <= p509) AND (1 <= p322) AND (1 <= p324) AND (1 <= p328) AND (1 <= p145) AND (1 <= p109) AND (1 <= p110) AND (1 <= p115) AND (1 <= p32) AND ((p69 <= 0) OR (p75 <= 0) OR (p83 <= 0)) AND (((1 <= p450)) OR ((1 <= p455) AND (1 <= p461))) AND (((1 <= p351)) OR ((1 <= p363)) OR ((1 <= p612)) OR ((1 <= p347))))))
lola: processed formula length: 323
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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p509) AND (1 <= p322) AND (1 <= p324) AND (1 <= p328) AND (1 <= p145) AND (1 <= p109) AND (1 <= p110) AND (1 <= p115) AND (1 <= p32) AND ((p69 <= 0) OR (p75 <= 0) OR (p83 <= 0)) AND (((1 <= p450)) OR ((1 <= p455) AND (1 <= p461))) AND (((1 <= p351)) OR ((1 <= p363)) OR ((1 <= p612)) OR ((1 <= p347))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 300 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
lola: memory consumption: 32412 KB
lola: time consumption: 6 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="ShieldRVs-PT-050B"
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 ShieldRVs-PT-050B, 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-159033478100903"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-050B.tgz
mv ShieldRVs-PT-050B 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 ;