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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 2.9K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 26 08:18 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 115K 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-40b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-40b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591194716641

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 14:31:59] [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 14:31:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 14:31:59] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-06-03 14:32:00] [INFO ] Transformed 439 places.
[2020-06-03 14:32:00] [INFO ] Transformed 390 transitions.
[2020-06-03 14:32:00] [INFO ] Found NUPN structural information;
[2020-06-03 14:32:00] [INFO ] Parsed PT model containing 439 places and 390 transitions in 243 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-40b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 1, 1]
FORMULA DES-PT-40b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0]
// Phase 1: matrix 390 rows 439 cols
[2020-06-03 14:32:00] [INFO ] Computed 65 place invariants in 57 ms
[2020-06-03 14:32:00] [INFO ] [Real]Absence check using 39 positive place invariants in 70 ms returned sat
[2020-06-03 14:32:00] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 46 ms returned sat
[2020-06-03 14:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:01] [INFO ] [Real]Absence check using state equation in 1003 ms returned sat
[2020-06-03 14:32:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:32:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 103 ms returned sat
[2020-06-03 14:32:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-06-03 14:32:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:03] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2020-06-03 14:32:03] [INFO ] Deduced a trap composed of 24 places in 376 ms
[2020-06-03 14:32:03] [INFO ] Deduced a trap composed of 45 places in 154 ms
[2020-06-03 14:32:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2020-06-03 14:32:04] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 50 ms.
[2020-06-03 14:32:06] [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 (=> (> t92 0) (and (> t384 0) (< o384 o92)))") while checking expression at index 0
[2020-06-03 14:32:07] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 14:32:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-06-03 14:32:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:08] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2020-06-03 14:32:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:32:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 117 ms returned sat
[2020-06-03 14:32:08] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 57 ms returned sat
[2020-06-03 14:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:10] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2020-06-03 14:32:10] [INFO ] Deduced a trap composed of 15 places in 302 ms
[2020-06-03 14:32:10] [INFO ] Deduced a trap composed of 15 places in 260 ms
[2020-06-03 14:32:11] [INFO ] Deduced a trap composed of 16 places in 298 ms
[2020-06-03 14:32:11] [INFO ] Deduced a trap composed of 19 places in 286 ms
[2020-06-03 14:32:11] [INFO ] Deduced a trap composed of 8 places in 259 ms
[2020-06-03 14:32:11] [INFO ] Deduced a trap composed of 19 places in 247 ms
[2020-06-03 14:32:12] [INFO ] Deduced a trap composed of 23 places in 243 ms
[2020-06-03 14:32:12] [INFO ] Deduced a trap composed of 25 places in 226 ms
[2020-06-03 14:32:12] [INFO ] Deduced a trap composed of 23 places in 126 ms
[2020-06-03 14:32:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2792 ms
[2020-06-03 14:32:12] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 44 ms.
[2020-06-03 14:32:13] [INFO ] Added : 15 causal constraints over 3 iterations in 605 ms. Result :unknown
[2020-06-03 14:32:13] [INFO ] [Real]Absence check using 39 positive place invariants in 49 ms returned sat
[2020-06-03 14:32:13] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 14:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:15] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2020-06-03 14:32:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:32:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 121 ms returned sat
[2020-06-03 14:32:15] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 93 ms returned sat
[2020-06-03 14:32:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:32:16] [INFO ] [Nat]Absence check using state equation in 1294 ms returned sat
[2020-06-03 14:32:17] [INFO ] Deduced a trap composed of 16 places in 275 ms
[2020-06-03 14:32:17] [INFO ] Deduced a trap composed of 15 places in 239 ms
[2020-06-03 14:32:17] [INFO ] Deduced a trap composed of 15 places in 187 ms
[2020-06-03 14:32:17] [INFO ] Deduced a trap composed of 18 places in 187 ms
[2020-06-03 14:32:18] [INFO ] Deduced a trap composed of 27 places in 214 ms
[2020-06-03 14:32:18] [INFO ] Deduced a trap composed of 17 places in 174 ms
[2020-06-03 14:32:18] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-06-03 14:32:18] [INFO ] Deduced a trap composed of 19 places in 129 ms
[2020-06-03 14:32:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1976 ms
[2020-06-03 14:32:18] [INFO ] Computed and/alt/rep : 389/997/389 causal constraints in 45 ms.
[2020-06-03 14:32:20] [INFO ] Added : 70 causal constraints over 14 iterations in 1388 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 346200 steps, including 3717 resets, run finished after 1400 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 15 out of 439 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 439/439 places, 390/390 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 978 edges and 439 vertex of which 428 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.20 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 428 transition count 362
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 407 transition count 362
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 45 place count 407 transition count 356
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 57 place count 401 transition count 356
Symmetric choice reduction at 2 with 19 rule applications. Total rules 76 place count 401 transition count 356
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 114 place count 382 transition count 337
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 382 transition count 336
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 381 transition count 336
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 381 transition count 336
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 366 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 176 place count 366 transition count 306
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 179 place count 364 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 179 place count 364 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 362 transition count 303
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 327 place count 290 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 331 place count 288 transition count 233
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 333 place count 288 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 334 place count 287 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 286 transition count 232
Applied a total of 335 rules in 351 ms. Remains 286 /439 variables (removed 153) and now considering 232/390 (removed 158) transitions.
Finished structural reductions, in 1 iterations. Remains : 286/439 places, 232/390 transitions.
Incomplete random walk after 1000000 steps, including 34692 resets, run finished after 4181 ms. (steps per millisecond=239 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6112 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6346 resets, run finished after 2113 ms. (steps per millisecond=473 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4805 resets, run finished after 2182 ms. (steps per millisecond=458 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 8284390 steps, run timeout after 30001 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0]
Probabilistic random walk after 8284390 steps, saw 1088158 distinct states, run finished after 30001 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0]
// Phase 1: matrix 232 rows 286 cols
[2020-06-03 14:33:02] [INFO ] Computed 60 place invariants in 13 ms
[2020-06-03 14:33:02] [INFO ] [Real]Absence check using 36 positive place invariants in 65 ms returned sat
[2020-06-03 14:33:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 14:33:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:02] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2020-06-03 14:33:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:33:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 14:33:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 14:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:03] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2020-06-03 14:33:03] [INFO ] Deduced a trap composed of 7 places in 72 ms
[2020-06-03 14:33:04] [INFO ] Deduced a trap composed of 10 places in 62 ms
[2020-06-03 14:33:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 265 ms
[2020-06-03 14:33:04] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 30 ms.
[2020-06-03 14:33:05] [INFO ] Added : 148 causal constraints over 30 iterations in 1503 ms. Result :sat
[2020-06-03 14:33:05] [INFO ] Deduced a trap composed of 19 places in 121 ms
[2020-06-03 14:33:05] [INFO ] Deduced a trap composed of 18 places in 136 ms
[2020-06-03 14:33:06] [INFO ] Deduced a trap composed of 12 places in 162 ms
[2020-06-03 14:33:06] [INFO ] Deduced a trap composed of 40 places in 96 ms
[2020-06-03 14:33:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 814 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 14:33:06] [INFO ] [Real]Absence check using 36 positive place invariants in 29 ms returned sat
[2020-06-03 14:33:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2020-06-03 14:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:07] [INFO ] [Real]Absence check using state equation in 929 ms returned sat
[2020-06-03 14:33:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:33:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-06-03 14:33:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 65 ms returned sat
[2020-06-03 14:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:08] [INFO ] [Nat]Absence check using state equation in 652 ms returned sat
[2020-06-03 14:33:08] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 37 ms.
[2020-06-03 14:33:10] [INFO ] Added : 180 causal constraints over 36 iterations in 2223 ms. Result :sat
[2020-06-03 14:33:10] [INFO ] Deduced a trap composed of 15 places in 119 ms
[2020-06-03 14:33:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 14:33:11] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 14:33:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2020-06-03 14:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:12] [INFO ] [Real]Absence check using state equation in 1116 ms returned sat
[2020-06-03 14:33:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:33:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 14:33:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 473 ms returned sat
[2020-06-03 14:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:13] [INFO ] [Nat]Absence check using state equation in 968 ms returned sat
[2020-06-03 14:33:13] [INFO ] Deduced a trap composed of 8 places in 88 ms
[2020-06-03 14:33:14] [INFO ] Deduced a trap composed of 13 places in 134 ms
[2020-06-03 14:33:14] [INFO ] Deduced a trap composed of 12 places in 119 ms
[2020-06-03 14:33:14] [INFO ] Deduced a trap composed of 8 places in 57 ms
[2020-06-03 14:33:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 548 ms
[2020-06-03 14:33:14] [INFO ] Computed and/alt/rep : 227/852/227 causal constraints in 29 ms.
[2020-06-03 14:33:15] [INFO ] Added : 145 causal constraints over 29 iterations in 1412 ms. Result :unsat
FORMULA DES-PT-40b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 146500 steps, including 5337 resets, run finished after 634 ms. (steps per millisecond=231 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 176900 steps, including 6795 resets, run finished after 756 ms. (steps per millisecond=233 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 286 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 286/286 places, 232/232 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 286 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 284 transition count 230
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 280 transition count 226
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 279 transition count 225
Applied a total of 13 rules in 64 ms. Remains 279 /286 variables (removed 7) and now considering 225/232 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/286 places, 225/232 transitions.
Incomplete random walk after 1000000 steps, including 45178 resets, run finished after 4254 ms. (steps per millisecond=235 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8602 resets, run finished after 1899 ms. (steps per millisecond=526 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8933 resets, run finished after 2051 ms. (steps per millisecond=487 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 8669535 steps, run timeout after 30001 ms. (steps per millisecond=288 ) properties seen :[0, 0]
Probabilistic random walk after 8669535 steps, saw 1218946 distinct states, run finished after 30001 ms. (steps per millisecond=288 ) properties seen :[0, 0]
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:33:55] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 14:33:55] [INFO ] [Real]Absence check using 36 positive place invariants in 42 ms returned sat
[2020-06-03 14:33:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2020-06-03 14:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:56] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2020-06-03 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:33:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 14:33:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 14:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:56] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2020-06-03 14:33:57] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 37 ms.
[2020-06-03 14:33:58] [INFO ] Added : 141 causal constraints over 29 iterations in 1502 ms. Result :sat
[2020-06-03 14:33:58] [INFO ] Deduced a trap composed of 40 places in 48 ms
[2020-06-03 14:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 14:33:58] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 14:33:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 31 ms returned sat
[2020-06-03 14:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:33:59] [INFO ] [Real]Absence check using state equation in 751 ms returned sat
[2020-06-03 14:33:59] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:33:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 14:33:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 82 ms returned sat
[2020-06-03 14:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:00] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2020-06-03 14:34:00] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 31 ms.
[2020-06-03 14:34:02] [INFO ] Added : 179 causal constraints over 36 iterations in 2122 ms. Result :sat
[2020-06-03 14:34:02] [INFO ] Deduced a trap composed of 40 places in 50 ms
[2020-06-03 14:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 181000 steps, including 6008 resets, run finished after 783 ms. (steps per millisecond=231 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 157600 steps, including 5252 resets, run finished after 696 ms. (steps per millisecond=226 ) properties seen :[0, 0] could not realise parikh vector
Support contains 7 out of 279 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 28 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 225/225 transitions.
Starting structural reductions, iteration 0 : 279/279 places, 225/225 transitions.
Applied a total of 0 rules in 21 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:34:04] [INFO ] Computed 60 place invariants in 7 ms
[2020-06-03 14:34:05] [INFO ] Implicit Places using invariants in 999 ms returned []
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:34:05] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 14:34:08] [INFO ] Implicit Places using invariants and state equation in 3363 ms returned []
Implicit Place search using SMT with State Equation took 4364 ms to find 0 implicit places.
[2020-06-03 14:34:08] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:34:08] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 14:34:09] [INFO ] Dead Transitions using invariants and state equation in 767 ms returned []
Finished structural reductions, in 1 iterations. Remains : 279/279 places, 225/225 transitions.
Incomplete random walk after 100000 steps, including 4552 resets, run finished after 455 ms. (steps per millisecond=219 ) properties seen :[0, 0]
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:34:09] [INFO ] Computed 60 place invariants in 6 ms
[2020-06-03 14:34:10] [INFO ] [Real]Absence check using 36 positive place invariants in 39 ms returned sat
[2020-06-03 14:34:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 14:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:10] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2020-06-03 14:34:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:34:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 28 ms returned sat
[2020-06-03 14:34:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 14:34:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:11] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2020-06-03 14:34:11] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 30 ms.
[2020-06-03 14:34:12] [INFO ] Added : 141 causal constraints over 29 iterations in 1475 ms. Result :sat
[2020-06-03 14:34:12] [INFO ] Deduced a trap composed of 40 places in 31 ms
[2020-06-03 14:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2020-06-03 14:34:13] [INFO ] [Real]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-06-03 14:34:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 14:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:13] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2020-06-03 14:34:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:34:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 14:34:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 69 ms returned sat
[2020-06-03 14:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:14] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2020-06-03 14:34:14] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 33 ms.
[2020-06-03 14:34:17] [INFO ] Added : 179 causal constraints over 36 iterations in 2253 ms. Result :sat
[2020-06-03 14:34:17] [INFO ] Deduced a trap composed of 40 places in 34 ms
[2020-06-03 14:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 225
Applied a total of 1 rules in 38 ms. Remains 279 /279 variables (removed 0) and now considering 225/225 (removed 0) transitions.
// Phase 1: matrix 225 rows 279 cols
[2020-06-03 14:34:17] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 14:34:17] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 14:34:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 14:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:17] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2020-06-03 14:34:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:34:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-06-03 14:34:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2020-06-03 14:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:18] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2020-06-03 14:34:18] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 28 ms.
[2020-06-03 14:34:20] [INFO ] Added : 140 causal constraints over 28 iterations in 2220 ms. Result :sat
[2020-06-03 14:34:21] [INFO ] Deduced a trap composed of 18 places in 137 ms
[2020-06-03 14:34:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 14:34:21] [INFO ] [Real]Absence check using 36 positive place invariants in 30 ms returned sat
[2020-06-03 14:34:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 14:34:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:22] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2020-06-03 14:34:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 14:34:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 14:34:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2020-06-03 14:34:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 14:34:23] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2020-06-03 14:34:23] [INFO ] Computed and/alt/rep : 221/836/221 causal constraints in 28 ms.
[2020-06-03 14:34:24] [INFO ] Added : 179 causal constraints over 36 iterations in 1742 ms. Result :sat
[2020-06-03 14:34:24] [INFO ] Deduced a trap composed of 46 places in 140 ms
[2020-06-03 14:34:25] [INFO ] Deduced a trap composed of 15 places in 93 ms
[2020-06-03 14:34:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-06-03 14:34:25] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 14:34:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 14 ms.
[2020-06-03 14:34:25] [INFO ] Flatten gal took : 142 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-40b @ 3570 seconds

FORMULA DES-PT-40b-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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 14:34:26 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1782
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 2,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p149)) AND ((p182 <= 0)))))",
"processed_size": 41,
"rewrites": 1
},
"result":
{
"edges": 95675,
"markings": 74656,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "reachability",
"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": 3,
"adisj": 5,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p16)) AND ((p217 <= 0)) AND (((1 <= p249)) OR (((1 <= p205)) AND ((p45 <= 0)))))))",
"processed_size": 97,
"rewrites": 1
},
"result":
{
"edges": 43705448,
"markings": 27600079,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 7,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 19828,
"runtime": 205.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 1092,
"conflict_clusters": 50,
"places": 279,
"places_significant": 219,
"singleton_clusters": 0,
"transitions": 225
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"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: 504/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 279
lola: finding significant places
lola: 279 places, 225 transitions, 219 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: (p182 <= 1)
lola: LP says that atomic proposition is always true: (p217 <= 1)
lola: LP says that atomic proposition is always true: (p249 <= 1)
lola: LP says that atomic proposition is always true: (p45 <= 1)
lola: E (F ((((1 <= p149)) AND ((p182 <= 0))))) : E (F ((((1 <= p16)) AND ((p217 <= 0)) AND (((1 <= p249)) OR (((1 <= p205)) AND ((p45 <= 0)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p149)) AND ((p182 <= 0)))))
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 <= p149)) AND ((p182 <= 0)))))
lola: processed formula length: 41
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 <= p149)) AND ((p182 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 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: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 74656 markings, 95675 edges
lola: ========================================
lola: subprocess 1 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p16)) AND ((p217 <= 0)) AND (((1 <= p249)) OR (((1 <= p205)) AND ((p45 <= 0)))))))
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 <= p16)) AND ((p217 <= 0)) AND (((1 <= p249)) OR (((1 <= p205)) AND ((p45 <= 0)))))))
lola: processed formula length: 97
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 <= p16)) AND ((p217 <= 0)) AND (((1 <= p249)) OR (((1 <= p205)) AND ((p45 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 7 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: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 744882 markings, 1118004 edges, 148976 markings/sec, 0 secs
lola: sara is running 5 secs || 1449714 markings, 2222654 edges, 140966 markings/sec, 5 secs
lola: sara is running 10 secs || 2162396 markings, 3327756 edges, 142536 markings/sec, 10 secs
lola: sara is running 15 secs || 2869467 markings, 4434926 edges, 141414 markings/sec, 15 secs
lola: sara is running 20 secs || 3579251 markings, 5540389 edges, 141957 markings/sec, 20 secs
lola: sara is running 25 secs || 4274315 markings, 6629194 edges, 139013 markings/sec, 25 secs
lola: sara is running 30 secs || 4974263 markings, 7728028 edges, 139990 markings/sec, 30 secs
lola: sara is running 35 secs || 5664685 markings, 8819842 edges, 138084 markings/sec, 35 secs
lola: sara is running 40 secs || 6349713 markings, 9908051 edges, 137006 markings/sec, 40 secs
lola: sara is running 45 secs || 7043153 markings, 11000801 edges, 138688 markings/sec, 45 secs
lola: sara is running 50 secs || 7728100 markings, 12086889 edges, 136989 markings/sec, 50 secs
lola: sara is running 55 secs || 8402781 markings, 13170406 edges, 134936 markings/sec, 55 secs
lola: sara is running 60 secs || 9095550 markings, 14264132 edges, 138554 markings/sec, 60 secs
lola: sara is running 65 secs || 9770562 markings, 15347609 edges, 135002 markings/sec, 65 secs
lola: sara is running 70 secs || 10461204 markings, 16442290 edges, 138128 markings/sec, 70 secs
lola: sara is running 75 secs || 11146689 markings, 17527131 edges, 137097 markings/sec, 75 secs
lola: sara is running 80 secs || 11826563 markings, 18614909 edges, 135975 markings/sec, 80 secs
lola: sara is running 85 secs || 12527915 markings, 19720160 edges, 140270 markings/sec, 85 secs
lola: sara is running 90 secs || 13197731 markings, 20801005 edges, 133963 markings/sec, 90 secs
lola: sara is running 95 secs || 13886324 markings, 21894540 edges, 137719 markings/sec, 95 secs
lola: sara is running 100 secs || 14575842 markings, 22984468 edges, 137904 markings/sec, 100 secs
lola: sara is running 105 secs || 15258311 markings, 24073065 edges, 136494 markings/sec, 105 secs
lola: sara is running 110 secs || 15957985 markings, 25182840 edges, 139935 markings/sec, 110 secs
lola: sara is running 115 secs || 16647547 markings, 26273741 edges, 137912 markings/sec, 115 secs
lola: sara is running 120 secs || 17330658 markings, 27365441 edges, 136622 markings/sec, 120 secs
lola: sara is running 125 secs || 18028710 markings, 28465349 edges, 139610 markings/sec, 125 secs
lola: sara is running 130 secs || 18697525 markings, 29545140 edges, 133763 markings/sec, 130 secs
lola: sara is running 135 secs || 19390008 markings, 30644705 edges, 138497 markings/sec, 135 secs
lola: sara is running 140 secs || 20086180 markings, 31743273 edges, 139234 markings/sec, 140 secs
lola: sara is running 145 secs || 20761980 markings, 32826494 edges, 135160 markings/sec, 145 secs
lola: sara is running 150 secs || 21462070 markings, 33926340 edges, 140018 markings/sec, 150 secs
lola: sara is running 155 secs || 22137076 markings, 35015216 edges, 135001 markings/sec, 155 secs
lola: sara is running 160 secs || 22822612 markings, 36106155 edges, 137107 markings/sec, 160 secs
lola: sara is running 165 secs || 23517325 markings, 37207773 edges, 138943 markings/sec, 165 secs
lola: sara is running 170 secs || 24201149 markings, 38295954 edges, 136765 markings/sec, 170 secs
lola: sara is running 175 secs || 24901224 markings, 39402480 edges, 140015 markings/sec, 175 secs
lola: sara is running 180 secs || 25591978 markings, 40497817 edges, 138151 markings/sec, 180 secs
lola: sara is running 185 secs || 26242787 markings, 41541442 edges, 130162 markings/sec, 185 secs
lola: sara is running 190 secs || 26949809 markings, 42651298 edges, 141404 markings/sec, 190 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27600079 markings, 43705448 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 19828 KB
lola: time consumption: 205 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-40b"
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-40b, 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-158987900000302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40b.tgz
mv DES-PT-40b 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 ;