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.r180-ebro-158987899900254.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 DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900254
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 260K
-rw-r--r-- 1 mcc users 4.0K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 79K Mar 24 05:37 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 DES-PT-10b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591180767891

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 10:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 10:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 10:39:31] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2020-06-03 10:39:31] [INFO ] Transformed 320 places.
[2020-06-03 10:39:31] [INFO ] Transformed 271 transitions.
[2020-06-03 10:39:31] [INFO ] Found NUPN structural information;
[2020-06-03 10:39:31] [INFO ] Parsed PT model containing 320 places and 271 transitions in 244 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 62 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 88 resets, run finished after 157 ms. (steps per millisecond=63 ) properties seen :[1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1]
FORMULA DES-PT-10b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 271 rows 320 cols
[2020-06-03 10:39:31] [INFO ] Computed 65 place invariants in 43 ms
[2020-06-03 10:39:32] [INFO ] [Real]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-06-03 10:39:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 45 ms returned sat
[2020-06-03 10:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:33] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2020-06-03 10:39:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:39:33] [INFO ] [Nat]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-06-03 10:39:33] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2020-06-03 10:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:34] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2020-06-03 10:39:34] [INFO ] Deduced a trap composed of 18 places in 343 ms
[2020-06-03 10:39:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 490 ms
[2020-06-03 10:39:34] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 56 ms.
[2020-06-03 10:39:37] [INFO ] Added : 263 causal constraints over 54 iterations in 3044 ms. Result :sat
[2020-06-03 10:39:37] [INFO ] Deduced a trap composed of 30 places in 98 ms
[2020-06-03 10:39:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 10:39:38] [INFO ] [Real]Absence check using 39 positive place invariants in 36 ms returned unsat
[2020-06-03 10:39:38] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2020-06-03 10:39:38] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 10:39:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:39] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2020-06-03 10:39:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:39:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-06-03 10:39:39] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-06-03 10:39:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:40] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2020-06-03 10:39:40] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-03 10:39:40] [INFO ] Deduced a trap composed of 19 places in 144 ms
[2020-06-03 10:39:40] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-06-03 10:39:40] [INFO ] Deduced a trap composed of 21 places in 126 ms
[2020-06-03 10:39:40] [INFO ] Deduced a trap composed of 23 places in 120 ms
[2020-06-03 10:39:41] [INFO ] Deduced a trap composed of 42 places in 107 ms
[2020-06-03 10:39:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1063 ms
[2020-06-03 10:39:41] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 29 ms.
[2020-06-03 10:39:43] [INFO ] Added : 255 causal constraints over 52 iterations in 2675 ms. Result :sat
[2020-06-03 10:39:43] [INFO ] Deduced a trap composed of 56 places in 174 ms
[2020-06-03 10:39:44] [INFO ] Deduced a trap composed of 57 places in 321 ms
[2020-06-03 10:39:44] [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 s38 s70 s72 s74 s76 s77 s79 s81 s82 s83 s84 s85 s86 s87 s88 s90 s92 s112 s129 s130 s131 s132 s133 s134 s136 s137 s140 s143 s148 s150 s152 s154 s156 s157 s158 s159 s163 s181 s183 s191 s209 s238 s247 s248 s249 s250 s265 s272 s274 s277 s278 s279 s280 s283 s291) 0)") while checking expression at index 2
[2020-06-03 10:39:44] [INFO ] [Real]Absence check using 39 positive place invariants in 41 ms returned sat
[2020-06-03 10:39:44] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 32 ms returned sat
[2020-06-03 10:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:45] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2020-06-03 10:39:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:39:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-06-03 10:39:45] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2020-06-03 10:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:39:46] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2020-06-03 10:39:46] [INFO ] Deduced a trap composed of 24 places in 187 ms
[2020-06-03 10:39:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2020-06-03 10:39:46] [INFO ] Computed and/alt/rep : 270/550/270 causal constraints in 30 ms.
[2020-06-03 10:39:49] [INFO ] Added : 253 causal constraints over 52 iterations in 2984 ms. Result :sat
[2020-06-03 10:39:49] [INFO ] Deduced a trap composed of 34 places in 395 ms
[2020-06-03 10:39:49] [INFO ] Deduced a trap composed of 28 places in 65 ms
[2020-06-03 10:39:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 664 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
FORMULA DES-PT-10b-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 161800 steps, including 1692 resets, run finished after 735 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 256100 steps, including 2664 resets, run finished after 1108 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 320 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 320/320 places, 271/271 transitions.
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 621 edges and 320 vertex of which 313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.13 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 313 transition count 245
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 43 place count 293 transition count 245
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 43 place count 293 transition count 237
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 59 place count 285 transition count 237
Symmetric choice reduction at 2 with 19 rule applications. Total rules 78 place count 285 transition count 237
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 266 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 116 place count 266 transition count 217
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 265 transition count 217
Symmetric choice reduction at 2 with 14 rule applications. Total rules 132 place count 265 transition count 217
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 160 place count 251 transition count 203
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 173 place count 251 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 250 transition count 190
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 174 place count 250 transition count 187
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 180 place count 247 transition count 187
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 316 place count 179 transition count 119
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 320 place count 177 transition count 124
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 322 place count 177 transition count 122
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 324 place count 175 transition count 122
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 326 place count 175 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 327 place count 174 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 328 place count 173 transition count 121
Applied a total of 328 rules in 239 ms. Remains 173 /320 variables (removed 147) and now considering 121/271 (removed 150) transitions.
Finished structural reductions, in 1 iterations. Remains : 173/320 places, 121/271 transitions.
Incomplete random walk after 1000000 steps, including 34476 resets, run finished after 3942 ms. (steps per millisecond=253 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5906 resets, run finished after 2216 ms. (steps per millisecond=451 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5975 resets, run finished after 2151 ms. (steps per millisecond=464 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5606 resets, run finished after 1800 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 9835117 steps, run timeout after 30001 ms. (steps per millisecond=327 ) properties seen :[0, 0, 0]
Probabilistic random walk after 9835117 steps, saw 1268901 distinct states, run finished after 30003 ms. (steps per millisecond=327 ) properties seen :[0, 0, 0]
// Phase 1: matrix 121 rows 173 cols
[2020-06-03 10:40:32] [INFO ] Computed 63 place invariants in 29 ms
[2020-06-03 10:40:32] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:40:32] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 22 ms returned sat
[2020-06-03 10:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:32] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2020-06-03 10:40:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:40:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 10:40:32] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 123 ms returned sat
[2020-06-03 10:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:33] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2020-06-03 10:40:33] [INFO ] Computed and/alt/rep : 117/472/117 causal constraints in 21 ms.
[2020-06-03 10:40:33] [INFO ] Added : 113 causal constraints over 23 iterations in 646 ms. Result :sat
[2020-06-03 10:40:33] [INFO ] Deduced a trap composed of 16 places in 62 ms
[2020-06-03 10:40:33] [INFO ] Deduced a trap composed of 13 places in 63 ms
[2020-06-03 10:40:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 10:40:34] [INFO ] [Real]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 10:40:34] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 30 ms returned sat
[2020-06-03 10:40:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:34] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2020-06-03 10:40:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:40:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 10:40:34] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 75 ms returned sat
[2020-06-03 10:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:35] [INFO ] [Nat]Absence check using state equation in 364 ms returned sat
[2020-06-03 10:40:35] [INFO ] Deduced a trap composed of 5 places in 82 ms
[2020-06-03 10:40:35] [INFO ] Deduced a trap composed of 6 places in 86 ms
[2020-06-03 10:40:35] [INFO ] Deduced a trap composed of 15 places in 61 ms
[2020-06-03 10:40:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 308 ms
[2020-06-03 10:40:35] [INFO ] Computed and/alt/rep : 117/472/117 causal constraints in 19 ms.
[2020-06-03 10:40:36] [INFO ] Added : 99 causal constraints over 20 iterations in 727 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-03 10:40:36] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 10:40:36] [INFO ] [Real]Absence check using 35 positive and 28 generalized place invariants in 21 ms returned sat
[2020-06-03 10:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:36] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2020-06-03 10:40:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:40:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 10:40:36] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 69 ms returned sat
[2020-06-03 10:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:40:36] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
[2020-06-03 10:40:36] [INFO ] Computed and/alt/rep : 117/472/117 causal constraints in 20 ms.
[2020-06-03 10:40:37] [INFO ] Added : 110 causal constraints over 22 iterations in 630 ms. Result :sat
[2020-06-03 10:40:37] [INFO ] Deduced a trap composed of 7 places in 31 ms
[2020-06-03 10:40:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 45200 steps, including 1794 resets, run finished after 220 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 42100 steps, including 1788 resets, run finished after 191 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40000 steps, including 1620 resets, run finished after 178 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 173 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 173/173 places, 121/121 transitions.
Applied a total of 0 rules in 25 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 173/173 places, 121/121 transitions.
Starting structural reductions, iteration 0 : 173/173 places, 121/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 173 /173 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 173 cols
[2020-06-03 10:40:38] [INFO ] Computed 63 place invariants in 5 ms
[2020-06-03 10:40:38] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 121 rows 173 cols
[2020-06-03 10:40:38] [INFO ] Computed 63 place invariants in 5 ms
[2020-06-03 10:40:40] [INFO ] Implicit Places using invariants and state equation in 1386 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1912 ms to find 1 implicit places.
[2020-06-03 10:40:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:40:40] [INFO ] Computed 62 place invariants in 8 ms
[2020-06-03 10:40:40] [INFO ] Dead Transitions using invariants and state equation in 406 ms returned []
Starting structural reductions, iteration 1 : 172/173 places, 121/121 transitions.
Applied a total of 0 rules in 11 ms. Remains 172 /172 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2020-06-03 10:40:40] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:40:40] [INFO ] Computed 62 place invariants in 9 ms
[2020-06-03 10:40:41] [INFO ] Dead Transitions using invariants and state equation in 460 ms returned []
Finished structural reductions, in 2 iterations. Remains : 172/173 places, 121/121 transitions.
Incomplete random walk after 1000000 steps, including 34156 resets, run finished after 4017 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 5896 resets, run finished after 2040 ms. (steps per millisecond=490 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5985 resets, run finished after 2166 ms. (steps per millisecond=461 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5664 resets, run finished after 1856 ms. (steps per millisecond=538 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 9391144 steps, run timeout after 30001 ms. (steps per millisecond=313 ) properties seen :[0, 0, 0]
Probabilistic random walk after 9391144 steps, saw 1208433 distinct states, run finished after 30001 ms. (steps per millisecond=313 ) properties seen :[0, 0, 0]
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:21] [INFO ] Computed 62 place invariants in 6 ms
[2020-06-03 10:41:21] [INFO ] [Real]Absence check using 35 positive place invariants in 73 ms returned sat
[2020-06-03 10:41:21] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 86 ms returned sat
[2020-06-03 10:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:22] [INFO ] [Real]Absence check using state equation in 583 ms returned sat
[2020-06-03 10:41:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2020-06-03 10:41:22] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 105 ms returned sat
[2020-06-03 10:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:22] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2020-06-03 10:41:22] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 14 ms.
[2020-06-03 10:41:23] [INFO ] Added : 114 causal constraints over 23 iterations in 545 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2020-06-03 10:41:23] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 10:41:23] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 27 ms returned sat
[2020-06-03 10:41:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:23] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2020-06-03 10:41:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 127 ms returned sat
[2020-06-03 10:41:24] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 183 ms returned sat
[2020-06-03 10:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:24] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2020-06-03 10:41:24] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 14 ms.
[2020-06-03 10:41:25] [INFO ] Added : 108 causal constraints over 22 iterations in 709 ms. Result :sat
[2020-06-03 10:41:25] [INFO ] Deduced a trap composed of 16 places in 68 ms
[2020-06-03 10:41:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-06-03 10:41:25] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 10:41:25] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 37 ms returned sat
[2020-06-03 10:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:25] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2020-06-03 10:41:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 63 ms returned sat
[2020-06-03 10:41:26] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 99 ms returned sat
[2020-06-03 10:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:26] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2020-06-03 10:41:26] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-06-03 10:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2020-06-03 10:41:26] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 17 ms.
[2020-06-03 10:41:27] [INFO ] Added : 110 causal constraints over 22 iterations in 638 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 47200 steps, including 1964 resets, run finished after 243 ms. (steps per millisecond=194 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 34500 steps, including 1000 resets, run finished after 154 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 49900 steps, including 2112 resets, run finished after 226 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 172 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 172/172 places, 121/121 transitions.
Applied a total of 0 rules in 10 ms. Remains 172 /172 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 172/172 places, 121/121 transitions.
Starting structural reductions, iteration 0 : 172/172 places, 121/121 transitions.
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:27] [INFO ] Computed 62 place invariants in 3 ms
[2020-06-03 10:41:28] [INFO ] Implicit Places using invariants in 402 ms returned []
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:28] [INFO ] Computed 62 place invariants in 6 ms
[2020-06-03 10:41:29] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1465 ms to find 0 implicit places.
[2020-06-03 10:41:29] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:29] [INFO ] Computed 62 place invariants in 5 ms
[2020-06-03 10:41:29] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 172/172 places, 121/121 transitions.
Incomplete random walk after 100000 steps, including 3422 resets, run finished after 480 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0]
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:30] [INFO ] Computed 62 place invariants in 8 ms
[2020-06-03 10:41:30] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:41:30] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 25 ms returned sat
[2020-06-03 10:41:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:30] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2020-06-03 10:41:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 57 ms returned sat
[2020-06-03 10:41:30] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 95 ms returned sat
[2020-06-03 10:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:31] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2020-06-03 10:41:31] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 16 ms.
[2020-06-03 10:41:31] [INFO ] Added : 114 causal constraints over 23 iterations in 615 ms. Result :sat
[2020-06-03 10:41:32] [INFO ] [Real]Absence check using 35 positive place invariants in 58 ms returned sat
[2020-06-03 10:41:32] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 62 ms returned sat
[2020-06-03 10:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:32] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2020-06-03 10:41:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 10:41:33] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 181 ms returned sat
[2020-06-03 10:41:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:33] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2020-06-03 10:41:33] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 16 ms.
[2020-06-03 10:41:34] [INFO ] Added : 108 causal constraints over 22 iterations in 687 ms. Result :sat
[2020-06-03 10:41:34] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 10:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2020-06-03 10:41:34] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 10:41:34] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 30 ms returned sat
[2020-06-03 10:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:34] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2020-06-03 10:41:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 10:41:34] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 98 ms returned sat
[2020-06-03 10:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:35] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2020-06-03 10:41:35] [INFO ] Deduced a trap composed of 5 places in 49 ms
[2020-06-03 10:41:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2020-06-03 10:41:35] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 22 ms.
[2020-06-03 10:41:35] [INFO ] Added : 110 causal constraints over 22 iterations in 695 ms. Result :sat
Applied a total of 0 rules in 15 ms. Remains 172 /172 variables (removed 0) and now considering 121/121 (removed 0) transitions.
// Phase 1: matrix 121 rows 172 cols
[2020-06-03 10:41:35] [INFO ] Computed 62 place invariants in 6 ms
[2020-06-03 10:41:35] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:41:35] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 23 ms returned sat
[2020-06-03 10:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:36] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2020-06-03 10:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-06-03 10:41:36] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 83 ms returned sat
[2020-06-03 10:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:36] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2020-06-03 10:41:36] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 20 ms.
[2020-06-03 10:41:37] [INFO ] Added : 114 causal constraints over 23 iterations in 619 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 10:41:37] [INFO ] [Real]Absence check using 35 positive place invariants in 22 ms returned sat
[2020-06-03 10:41:37] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 27 ms returned sat
[2020-06-03 10:41:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:37] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2020-06-03 10:41:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 10:41:38] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 185 ms returned sat
[2020-06-03 10:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:38] [INFO ] [Nat]Absence check using state equation in 290 ms returned sat
[2020-06-03 10:41:38] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 28 ms.
[2020-06-03 10:41:39] [INFO ] Added : 108 causal constraints over 22 iterations in 630 ms. Result :sat
[2020-06-03 10:41:39] [INFO ] Deduced a trap composed of 16 places in 77 ms
[2020-06-03 10:41:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-03 10:41:39] [INFO ] [Real]Absence check using 35 positive place invariants in 24 ms returned sat
[2020-06-03 10:41:39] [INFO ] [Real]Absence check using 35 positive and 27 generalized place invariants in 24 ms returned sat
[2020-06-03 10:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:39] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2020-06-03 10:41:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 10:41:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 25 ms returned sat
[2020-06-03 10:41:39] [INFO ] [Nat]Absence check using 35 positive and 27 generalized place invariants in 98 ms returned sat
[2020-06-03 10:41:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 10:41:39] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2020-06-03 10:41:40] [INFO ] Deduced a trap composed of 5 places in 129 ms
[2020-06-03 10:41:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2020-06-03 10:41:40] [INFO ] Computed and/alt/rep : 117/471/117 causal constraints in 14 ms.
[2020-06-03 10:41:40] [INFO ] Added : 110 causal constraints over 22 iterations in 701 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 10:41:40] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2020-06-03 10:41:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 8 ms.
[2020-06-03 10:41:41] [INFO ] Flatten gal took : 145 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-10b @ 3570 seconds

FORMULA DES-PT-10b-ReachabilityCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10b-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3565
rslt: Output for ReachabilityCardinality @ DES-PT-10b

{
"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",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 10:41:41 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (((p39 <= 0) OR (((1 <= p121)) AND ((p114 <= 0))))))",
"processed_size": 58,
"rewrites": 2
},
"result":
{
"edges": 54830,
"markings": 43814,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p68 <= 0)) OR ((1 <= p152)) OR ((p24 <= 0)) OR ((1 <= p156)) OR (((1 <= p9)) AND ((p36 <= 0))))))",
"processed_size": 110,
"rewrites": 2
},
"result":
{
"edges": 110353,
"markings": 75811,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3565
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 3,
"aneg": 0,
"comp": 7,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p8) AND (((p131 <= 0)) OR ((1 <= p52)))) OR ((1 <= p1) AND (1 <= p25) AND (((p61 <= 0)) OR ((1 <= p140)))))))",
"processed_size": 126,
"rewrites": 1
},
"result":
{
"edges": 1426,
"markings": 1250,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22548,
"runtime": 5.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 606,
"conflict_clusters": 58,
"places": 172,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 121
},
"result":
{
"preliminary_value": "no yes no ",
"value": "no yes no "
},
"task":
{
"type": "compound"
}
}
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: 293/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 172
lola: finding significant places
lola: 172 places, 121 transitions, 110 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p152 <= 1)
lola: LP says that atomic proposition is always true: (p156 <= 1)
lola: LP says that atomic proposition is always true: (p36 <= 1)
lola: LP says that atomic proposition is always true: (p8 <= 1)
lola: LP says that atomic proposition is always true: (p52 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p25 <= 1)
lola: LP says that atomic proposition is always true: (p140 <= 1)
lola: LP says that atomic proposition is always true: (p39 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: A (G ((((p68 <= 0)) OR ((1 <= p152)) OR ((p24 <= 0)) OR ((1 <= p156)) OR (((1 <= p9)) AND ((p36 <= 0)))))) : E (F ((((1 <= p8) AND (((p131 <= 0)) OR ((1 <= p52)))) OR ((1 <= p1) AND (1 <= p25) AND (((p61 <= 0)) OR ((1 <= p140))))))) : A (G (((p39 <= 0) OR (((1 <= p121)) AND ((p114 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p39 <= 0) OR (((1 <= p121)) AND ((p114 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p39 <= 0) OR (((1 <= p121)) AND ((p114 <= 0))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p39) AND (((p121 <= 0)) OR ((1 <= p114))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :210: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 43814 markings, 54830 edges
lola: ========================================
lola: subprocess 1 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p68 <= 0)) OR ((1 <= p152)) OR ((p24 <= 0)) OR ((1 <= p156)) OR (((1 <= p9)) AND ((p36 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p68 <= 0)) OR ((1 <= p152)) OR ((p24 <= 0)) OR ((1 <= p156)) OR (((1 <= p9)) AND ((p36 <= 0))))))
lola: processed formula length: 110
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p68)) AND ((p152 <= 0)) AND ((1 <= p24)) AND ((p156 <= 0)) AND (((p9 <= 0)) OR ((1 <= p36))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: error: :210: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 75811 markings, 110353 edges
lola: ========================================
lola: subprocess 2 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p8) AND (((p131 <= 0)) OR ((1 <= p52)))) OR ((1 <= p1) AND (1 <= p25) AND (((p61 <= 0)) OR ((1 <= p140)))))))
lola: ========================================
lola: SUBTASK
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 <= p8) AND (((p131 <= 0)) OR ((1 <= p52)))) OR ((1 <= p1) AND (1 <= p25) AND (((p61 <= 0)) OR ((1 <= p140)))))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: 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 <= p8) AND (((p131 <= 0)) OR ((1 <= p52)))) OR ((1 <= p1) AND (1 <= p25) AND (((p61 <= 0)) OR ((1 <= p140)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1250 markings, 1426 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no
lola:
preliminary result: no yes no
lola: memory consumption: 22548 KB
lola: time consumption: 5 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="DES-PT-10b"
export BK_EXAMINATION="ReachabilityCardinality"
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 DES-PT-10b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r180-ebro-158987899900254"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;