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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:21 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.4K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:19 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 139K 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-60b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591203051148

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:50:54] [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 16:50:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:50:55] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2020-06-03 16:50:55] [INFO ] Transformed 519 places.
[2020-06-03 16:50:55] [INFO ] Transformed 470 transitions.
[2020-06-03 16:50:55] [INFO ] Found NUPN structural information;
[2020-06-03 16:50:55] [INFO ] Parsed PT model containing 519 places and 470 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 68 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-60b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 88 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1]
FORMULA DES-PT-60b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-60b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 470 rows 519 cols
[2020-06-03 16:50:55] [INFO ] Computed 65 place invariants in 74 ms
[2020-06-03 16:50:56] [INFO ] [Real]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-06-03 16:50:56] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:50:57] [INFO ] [Real]Absence check using state equation in 1520 ms returned sat
[2020-06-03 16:50:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:50:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 111 ms returned sat
[2020-06-03 16:50:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 234 ms returned sat
[2020-06-03 16:50:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 16:51:02] [INFO ] [Nat]Absence check using state equation in 4438 ms returned (error "Failed to check-sat")
[2020-06-03 16:51:03] [INFO ] [Real]Absence check using 39 positive place invariants in 58 ms returned sat
[2020-06-03 16:51:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 60 ms returned sat
[2020-06-03 16:51:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:04] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2020-06-03 16:51:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:05] [INFO ] [Nat]Absence check using 39 positive place invariants in 74 ms returned sat
[2020-06-03 16:51:05] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 69 ms returned sat
[2020-06-03 16:51:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:06] [INFO ] [Nat]Absence check using state equation in 1469 ms returned sat
[2020-06-03 16:51:07] [INFO ] Deduced a trap composed of 8 places in 425 ms
[2020-06-03 16:51:07] [INFO ] Deduced a trap composed of 24 places in 439 ms
[2020-06-03 16:51:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1120 ms
[2020-06-03 16:51:07] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 74 ms.
[2020-06-03 16:51:09] [INFO ] Added : 75 causal constraints over 15 iterations in 2159 ms. Result :unknown
[2020-06-03 16:51:10] [INFO ] [Real]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:51:10] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 75 ms returned sat
[2020-06-03 16:51:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:12] [INFO ] [Real]Absence check using state equation in 2479 ms returned sat
[2020-06-03 16:51:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:12] [INFO ] [Nat]Absence check using 39 positive place invariants in 82 ms returned sat
[2020-06-03 16:51:13] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 123 ms returned sat
[2020-06-03 16:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:16] [INFO ] [Nat]Absence check using state equation in 2944 ms returned sat
[2020-06-03 16:51:16] [INFO ] Deduced a trap composed of 18 places in 379 ms
[2020-06-03 16:51:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2020-06-03 16:51:16] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 78 ms.
[2020-06-03 16:51:17] [INFO ] Added : 35 causal constraints over 7 iterations in 1234 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:51:17] [INFO ] [Real]Absence check using 39 positive place invariants in 55 ms returned sat
[2020-06-03 16:51:17] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-06-03 16:51:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:19] [INFO ] [Real]Absence check using state equation in 1484 ms returned sat
[2020-06-03 16:51:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:19] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:51:19] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-06-03 16:51:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:21] [INFO ] [Nat]Absence check using state equation in 1689 ms returned sat
[2020-06-03 16:51:21] [INFO ] Deduced a trap composed of 20 places in 372 ms
[2020-06-03 16:51:22] [INFO ] Deduced a trap composed of 13 places in 762 ms
[2020-06-03 16:51:23] [INFO ] Deduced a trap composed of 12 places in 682 ms
[2020-06-03 16:51:24] [INFO ] Deduced a trap composed of 28 places in 549 ms
[2020-06-03 16:51:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2657 ms
[2020-06-03 16:51:24] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 56 ms.
[2020-06-03 16:51:24] [INFO ] Added : 15 causal constraints over 3 iterations in 391 ms. Result :unknown
[2020-06-03 16:51:24] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:51:24] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-06-03 16:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:27] [INFO ] [Real]Absence check using state equation in 3038 ms returned sat
[2020-06-03 16:51:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 75 ms returned sat
[2020-06-03 16:51:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 201 ms returned sat
[2020-06-03 16:51:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:30] [INFO ] [Nat]Absence check using state equation in 2152 ms returned sat
[2020-06-03 16:51:31] [INFO ] Deduced a trap composed of 15 places in 594 ms
[2020-06-03 16:51:31] [INFO ] Deduced a trap composed of 39 places in 204 ms
[2020-06-03 16:51:31] [INFO ] Deduced a trap composed of 17 places in 416 ms
[2020-06-03 16:51:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1431 ms
[2020-06-03 16:51:31] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 149 ms.
[2020-06-03 16:51:32] [INFO ] Added : 25 causal constraints over 5 iterations in 1039 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 16:51:33] [INFO ] [Real]Absence check using 39 positive place invariants in 54 ms returned sat
[2020-06-03 16:51:33] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 53 ms returned sat
[2020-06-03 16:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:34] [INFO ] [Real]Absence check using state equation in 1537 ms returned sat
[2020-06-03 16:51:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-06-03 16:51:35] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 91 ms returned sat
[2020-06-03 16:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:36] [INFO ] [Nat]Absence check using state equation in 1571 ms returned sat
[2020-06-03 16:51:36] [INFO ] Deduced a trap composed of 19 places in 286 ms
[2020-06-03 16:51:37] [INFO ] Deduced a trap composed of 18 places in 271 ms
[2020-06-03 16:51:37] [INFO ] Deduced a trap composed of 15 places in 217 ms
[2020-06-03 16:51:37] [INFO ] Deduced a trap composed of 15 places in 205 ms
[2020-06-03 16:51:38] [INFO ] Deduced a trap composed of 14 places in 205 ms
[2020-06-03 16:51:38] [INFO ] Deduced a trap composed of 16 places in 198 ms
[2020-06-03 16:51:38] [INFO ] Deduced a trap composed of 10 places in 171 ms
[2020-06-03 16:51:38] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1977 ms
[2020-06-03 16:51:38] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 61 ms.
[2020-06-03 16:51:39] [INFO ] Added : 15 causal constraints over 3 iterations in 1172 ms. Result :unknown
[2020-06-03 16:51:39] [INFO ] [Real]Absence check using 39 positive place invariants in 52 ms returned sat
[2020-06-03 16:51:40] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 55 ms returned sat
[2020-06-03 16:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:41] [INFO ] [Real]Absence check using state equation in 1629 ms returned sat
[2020-06-03 16:51:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:51:41] [INFO ] [Nat]Absence check using 39 positive place invariants in 84 ms returned sat
[2020-06-03 16:51:41] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 85 ms returned sat
[2020-06-03 16:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:51:43] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2020-06-03 16:51:44] [INFO ] Deduced a trap composed of 12 places in 269 ms
[2020-06-03 16:51:44] [INFO ] Deduced a trap composed of 22 places in 285 ms
[2020-06-03 16:51:44] [INFO ] Deduced a trap composed of 21 places in 256 ms
[2020-06-03 16:51:45] [INFO ] Deduced a trap composed of 41 places in 251 ms
[2020-06-03 16:51:45] [INFO ] Deduced a trap composed of 24 places in 203 ms
[2020-06-03 16:51:45] [INFO ] Deduced a trap composed of 30 places in 185 ms
[2020-06-03 16:51:45] [INFO ] Deduced a trap composed of 19 places in 134 ms
[2020-06-03 16:51:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1969 ms
[2020-06-03 16:51:45] [INFO ] Computed and/alt/rep : 469/1297/469 causal constraints in 48 ms.
[2020-06-03 16:51:46] [INFO ] Added : 15 causal constraints over 3 iterations in 873 ms. Result :unknown
Incomplete Parikh walk after 514200 steps, including 5506 resets, run finished after 2261 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36200 steps, including 337 resets, run finished after 167 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 689800 steps, including 7288 resets, run finished after 2725 ms. (steps per millisecond=253 ) properties seen :[0, 0, 0, 0, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-60b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 52900 steps, including 882 resets, run finished after 236 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 15 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.18 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 508 transition count 444
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 489 transition count 444
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 41 place count 489 transition count 435
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 59 place count 480 transition count 435
Symmetric choice reduction at 2 with 19 rule applications. Total rules 78 place count 480 transition count 435
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 116 place count 461 transition count 416
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 461 transition count 415
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 460 transition count 415
Symmetric choice reduction at 2 with 14 rule applications. Total rules 132 place count 460 transition count 415
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 14 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 160 place count 446 transition count 401
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 174 place count 446 transition count 387
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 177 place count 444 transition count 386
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 177 place count 444 transition count 384
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 181 place count 442 transition count 384
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 2 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 333 place count 366 transition count 308
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
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 339 place count 363 transition count 311
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 363 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 362 transition count 310
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 343 place count 362 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 345 place count 360 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 346 place count 359 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 347 place count 358 transition count 307
Applied a total of 347 rules in 461 ms. Remains 358 /519 variables (removed 161) and now considering 307/470 (removed 163) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/519 places, 307/470 transitions.
Incomplete random walk after 1000000 steps, including 44384 resets, run finished after 5447 ms. (steps per millisecond=183 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA DES-PT-60b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 8230 resets, run finished after 2013 ms. (steps per millisecond=496 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8313 resets, run finished after 2213 ms. (steps per millisecond=451 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 8126 resets, run finished after 2189 ms. (steps per millisecond=456 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7913 resets, run finished after 2445 ms. (steps per millisecond=408 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8197 resets, run finished after 2016 ms. (steps per millisecond=496 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:52:08] [INFO ] Computed 60 place invariants in 15 ms
[2020-06-03 16:52:09] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:52:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 16:52:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:10] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2020-06-03 16:52:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 16:52:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 193 ms returned sat
[2020-06-03 16:52:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:11] [INFO ] [Nat]Absence check using state equation in 1289 ms returned sat
[2020-06-03 16:52:11] [INFO ] Deduced a trap composed of 20 places in 131 ms
[2020-06-03 16:52:12] [INFO ] Deduced a trap composed of 19 places in 157 ms
[2020-06-03 16:52:12] [INFO ] Deduced a trap composed of 19 places in 139 ms
[2020-06-03 16:52:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 556 ms
[2020-06-03 16:52:12] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 33 ms.
[2020-06-03 16:52:16] [INFO ] Added : 257 causal constraints over 52 iterations in 3862 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
[2020-06-03 16:52:16] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 16:52:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 16:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:18] [INFO ] [Real]Absence check using state equation in 2139 ms returned sat
[2020-06-03 16:52:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 42 ms returned sat
[2020-06-03 16:52:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 3040 ms returned sat
[2020-06-03 16:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:22] [INFO ] [Nat]Absence check using state equation in 1150 ms returned sat
[2020-06-03 16:52:22] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 37 ms.
[2020-06-03 16:52:26] [INFO ] Added : 258 causal constraints over 52 iterations in 3272 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-06-03 16:52:26] [INFO ] [Real]Absence check using 36 positive place invariants in 49 ms returned sat
[2020-06-03 16:52:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 16:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:27] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2020-06-03 16:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 16:52:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 179 ms returned sat
[2020-06-03 16:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:28] [INFO ] [Nat]Absence check using state equation in 1174 ms returned sat
[2020-06-03 16:52:28] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 46 ms.
[2020-06-03 16:52:32] [INFO ] Added : 302 causal constraints over 61 iterations in 3452 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 16:52:32] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:52:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 16:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:34] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2020-06-03 16:52:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:34] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 16:52:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 86 ms returned sat
[2020-06-03 16:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:36] [INFO ] [Nat]Absence check using state equation in 1691 ms returned sat
[2020-06-03 16:52:36] [INFO ] Deduced a trap composed of 6 places in 73 ms
[2020-06-03 16:52:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2020-06-03 16:52:36] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 38 ms.
[2020-06-03 16:52:40] [INFO ] Added : 234 causal constraints over 47 iterations in 3550 ms. Result :sat
[2020-06-03 16:52:40] [INFO ] Deduced a trap composed of 25 places in 208 ms
[2020-06-03 16:52:40] [INFO ] Deduced a trap composed of 25 places in 174 ms
[2020-06-03 16:52:41] [INFO ] Deduced a trap composed of 27 places in 166 ms
[2020-06-03 16:52:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 873 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 16:52:41] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:52:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 16:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:42] [INFO ] [Real]Absence check using state equation in 1015 ms returned sat
[2020-06-03 16:52:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:52:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:52:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 94 ms returned sat
[2020-06-03 16:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:52:43] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2020-06-03 16:52:44] [INFO ] Deduced a trap composed of 16 places in 282 ms
[2020-06-03 16:52:44] [INFO ] Deduced a trap composed of 6 places in 63 ms
[2020-06-03 16:52:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 471 ms
[2020-06-03 16:52:44] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 40 ms.
[2020-06-03 16:52:48] [INFO ] Added : 233 causal constraints over 47 iterations in 3818 ms. Result :sat
[2020-06-03 16:52:48] [INFO ] Deduced a trap composed of 17 places in 112 ms
[2020-06-03 16:52:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 186800 steps, including 8656 resets, run finished after 1053 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195100 steps, including 8750 resets, run finished after 1081 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298400 steps, including 13580 resets, run finished after 1783 ms. (steps per millisecond=167 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 306300 steps, including 14315 resets, run finished after 1723 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 259600 steps, including 12063 resets, run finished after 1458 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 358 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 358/358 places, 307/307 transitions.
Applied a total of 0 rules in 25 ms. Remains 358 /358 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 307/307 transitions.
Incomplete random walk after 1000000 steps, including 44443 resets, run finished after 5379 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8156 resets, run finished after 2049 ms. (steps per millisecond=488 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8158 resets, run finished after 2252 ms. (steps per millisecond=444 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8125 resets, run finished after 2165 ms. (steps per millisecond=461 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8038 resets, run finished after 2342 ms. (steps per millisecond=426 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8077 resets, run finished after 2053 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 6751510 steps, run timeout after 30001 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 6751510 steps, saw 870870 distinct states, run finished after 30001 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:53:41] [INFO ] Computed 60 place invariants in 14 ms
[2020-06-03 16:53:41] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:53:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 16:53:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:53:43] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2020-06-03 16:53:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:53:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 16:53:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 176 ms returned sat
[2020-06-03 16:53:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:53:44] [INFO ] [Nat]Absence check using state equation in 1313 ms returned sat
[2020-06-03 16:53:44] [INFO ] Deduced a trap composed of 20 places in 167 ms
[2020-06-03 16:53:45] [INFO ] Deduced a trap composed of 19 places in 164 ms
[2020-06-03 16:53:45] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2020-06-03 16:53:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 589 ms
[2020-06-03 16:53:45] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 31 ms.
[2020-06-03 16:53:49] [INFO ] Added : 257 causal constraints over 52 iterations in 4004 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-06-03 16:53:49] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 16:53:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 16:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:53:51] [INFO ] [Real]Absence check using state equation in 2160 ms returned sat
[2020-06-03 16:53:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:53:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 16:53:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 3124 ms returned sat
[2020-06-03 16:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:53:57] [INFO ] [Nat]Absence check using state equation in 2043 ms returned sat
[2020-06-03 16:53:57] [INFO ] Deduced a trap composed of 19 places in 234 ms
[2020-06-03 16:53:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 309 ms
[2020-06-03 16:53:57] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 40 ms.
[2020-06-03 16:54:00] [INFO ] Added : 262 causal constraints over 53 iterations in 3104 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-06-03 16:54:00] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 16:54:00] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 51 ms returned sat
[2020-06-03 16:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:01] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2020-06-03 16:54:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2020-06-03 16:54:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 175 ms returned sat
[2020-06-03 16:54:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:03] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2020-06-03 16:54:03] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 32 ms.
[2020-06-03 16:54:06] [INFO ] Added : 302 causal constraints over 61 iterations in 3422 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 16:54:06] [INFO ] [Real]Absence check using 36 positive place invariants in 39 ms returned sat
[2020-06-03 16:54:06] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 16:54:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:08] [INFO ] [Real]Absence check using state equation in 2137 ms returned sat
[2020-06-03 16:54:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 16:54:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 131 ms returned sat
[2020-06-03 16:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:11] [INFO ] [Nat]Absence check using state equation in 1864 ms returned sat
[2020-06-03 16:54:11] [INFO ] Deduced a trap composed of 6 places in 53 ms
[2020-06-03 16:54:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2020-06-03 16:54:11] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 31 ms.
[2020-06-03 16:54:14] [INFO ] Added : 234 causal constraints over 47 iterations in 3428 ms. Result :sat
[2020-06-03 16:54:14] [INFO ] Deduced a trap composed of 25 places in 221 ms
[2020-06-03 16:54:15] [INFO ] Deduced a trap composed of 25 places in 182 ms
[2020-06-03 16:54:15] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-06-03 16:54:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 829 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 16:54:15] [INFO ] [Real]Absence check using 36 positive place invariants in 36 ms returned sat
[2020-06-03 16:54:15] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 16:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:16] [INFO ] [Real]Absence check using state equation in 1002 ms returned sat
[2020-06-03 16:54:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-06-03 16:54:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 111 ms returned sat
[2020-06-03 16:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:18] [INFO ] [Nat]Absence check using state equation in 1072 ms returned sat
[2020-06-03 16:54:18] [INFO ] Deduced a trap composed of 16 places in 249 ms
[2020-06-03 16:54:18] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-06-03 16:54:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2020-06-03 16:54:18] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 32 ms.
[2020-06-03 16:54:22] [INFO ] Added : 233 causal constraints over 47 iterations in 3710 ms. Result :sat
[2020-06-03 16:54:22] [INFO ] Deduced a trap composed of 17 places in 114 ms
[2020-06-03 16:54:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 258 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
Incomplete Parikh walk after 186800 steps, including 8736 resets, run finished after 1044 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 195100 steps, including 8805 resets, run finished after 1093 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298400 steps, including 13534 resets, run finished after 1665 ms. (steps per millisecond=179 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 317700 steps, including 14811 resets, run finished after 1776 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 259600 steps, including 12059 resets, run finished after 1419 ms. (steps per millisecond=182 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 358 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 358/358 places, 307/307 transitions.
Applied a total of 0 rules in 24 ms. Remains 358 /358 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 307/307 transitions.
Starting structural reductions, iteration 0 : 358/358 places, 307/307 transitions.
Applied a total of 0 rules in 23 ms. Remains 358 /358 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:54:29] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 16:54:31] [INFO ] Implicit Places using invariants in 1634 ms returned []
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:54:31] [INFO ] Computed 60 place invariants in 15 ms
[2020-06-03 16:54:37] [INFO ] Implicit Places using invariants and state equation in 6017 ms returned []
Implicit Place search using SMT with State Equation took 7654 ms to find 0 implicit places.
[2020-06-03 16:54:37] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:54:37] [INFO ] Computed 60 place invariants in 13 ms
[2020-06-03 16:54:38] [INFO ] Dead Transitions using invariants and state equation in 1382 ms returned []
Finished structural reductions, in 1 iterations. Remains : 358/358 places, 307/307 transitions.
Incomplete random walk after 100000 steps, including 4397 resets, run finished after 640 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:54:39] [INFO ] Computed 60 place invariants in 10 ms
[2020-06-03 16:54:39] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 16:54:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 32 ms returned sat
[2020-06-03 16:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:40] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2020-06-03 16:54:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 16:54:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 178 ms returned sat
[2020-06-03 16:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:42] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2020-06-03 16:54:42] [INFO ] Deduced a trap composed of 20 places in 156 ms
[2020-06-03 16:54:42] [INFO ] Deduced a trap composed of 19 places in 162 ms
[2020-06-03 16:54:42] [INFO ] Deduced a trap composed of 19 places in 120 ms
[2020-06-03 16:54:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 570 ms
[2020-06-03 16:54:42] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 29 ms.
[2020-06-03 16:54:46] [INFO ] Added : 257 causal constraints over 52 iterations in 3707 ms. Result :sat
[2020-06-03 16:54:46] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 16:54:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2020-06-03 16:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:48] [INFO ] [Real]Absence check using state equation in 2437 ms returned sat
[2020-06-03 16:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-06-03 16:54:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 3072 ms returned sat
[2020-06-03 16:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:53] [INFO ] [Nat]Absence check using state equation in 1723 ms returned sat
[2020-06-03 16:54:53] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 37 ms.
[2020-06-03 16:54:57] [INFO ] Added : 262 causal constraints over 53 iterations in 3408 ms. Result :sat
[2020-06-03 16:54:57] [INFO ] [Real]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 16:54:57] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 16:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:54:58] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2020-06-03 16:54:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:54:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 37 ms returned sat
[2020-06-03 16:54:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 181 ms returned sat
[2020-06-03 16:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:00] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2020-06-03 16:55:00] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 43 ms.
[2020-06-03 16:55:03] [INFO ] Added : 302 causal constraints over 61 iterations in 3740 ms. Result :sat
[2020-06-03 16:55:03] [INFO ] [Real]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-06-03 16:55:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 16:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:06] [INFO ] [Real]Absence check using state equation in 2248 ms returned sat
[2020-06-03 16:55:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:06] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:55:06] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2020-06-03 16:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:08] [INFO ] [Nat]Absence check using state equation in 1821 ms returned sat
[2020-06-03 16:55:08] [INFO ] Deduced a trap composed of 6 places in 75 ms
[2020-06-03 16:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2020-06-03 16:55:08] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 34 ms.
[2020-06-03 16:55:12] [INFO ] Added : 234 causal constraints over 47 iterations in 3848 ms. Result :sat
[2020-06-03 16:55:12] [INFO ] Deduced a trap composed of 25 places in 239 ms
[2020-06-03 16:55:12] [INFO ] Deduced a trap composed of 25 places in 236 ms
[2020-06-03 16:55:13] [INFO ] Deduced a trap composed of 27 places in 183 ms
[2020-06-03 16:55:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 955 ms
[2020-06-03 16:55:13] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:55:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 16:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:14] [INFO ] [Real]Absence check using state equation in 1075 ms returned sat
[2020-06-03 16:55:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 16:55:14] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2020-06-03 16:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:15] [INFO ] [Nat]Absence check using state equation in 1024 ms returned sat
[2020-06-03 16:55:16] [INFO ] Deduced a trap composed of 16 places in 290 ms
[2020-06-03 16:55:16] [INFO ] Deduced a trap composed of 6 places in 65 ms
[2020-06-03 16:55:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2020-06-03 16:55:16] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 41 ms.
[2020-06-03 16:55:20] [INFO ] Added : 233 causal constraints over 47 iterations in 3925 ms. Result :sat
[2020-06-03 16:55:20] [INFO ] Deduced a trap composed of 17 places in 107 ms
[2020-06-03 16:55:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
Applied a total of 0 rules in 38 ms. Remains 358 /358 variables (removed 0) and now considering 307/307 (removed 0) transitions.
// Phase 1: matrix 307 rows 358 cols
[2020-06-03 16:55:20] [INFO ] Computed 60 place invariants in 8 ms
[2020-06-03 16:55:20] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:55:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 42 ms returned sat
[2020-06-03 16:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:21] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2020-06-03 16:55:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 46 ms returned sat
[2020-06-03 16:55:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 202 ms returned sat
[2020-06-03 16:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:23] [INFO ] [Nat]Absence check using state equation in 1464 ms returned sat
[2020-06-03 16:55:23] [INFO ] Deduced a trap composed of 20 places in 151 ms
[2020-06-03 16:55:24] [INFO ] Deduced a trap composed of 19 places in 125 ms
[2020-06-03 16:55:24] [INFO ] Deduced a trap composed of 19 places in 140 ms
[2020-06-03 16:55:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 597 ms
[2020-06-03 16:55:24] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 22 ms.
[2020-06-03 16:55:28] [INFO ] Added : 257 causal constraints over 52 iterations in 4114 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 55 ms.
[2020-06-03 16:55:28] [INFO ] [Real]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-06-03 16:55:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2020-06-03 16:55:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:30] [INFO ] [Real]Absence check using state equation in 2190 ms returned sat
[2020-06-03 16:55:30] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 16:55:34] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 3058 ms returned sat
[2020-06-03 16:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:35] [INFO ] [Nat]Absence check using state equation in 1487 ms returned sat
[2020-06-03 16:55:35] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 29 ms.
[2020-06-03 16:55:39] [INFO ] Added : 262 causal constraints over 53 iterations in 3497 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 16:55:39] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:55:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 16:55:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:40] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2020-06-03 16:55:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 31 ms returned sat
[2020-06-03 16:55:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 177 ms returned sat
[2020-06-03 16:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:41] [INFO ] [Nat]Absence check using state equation in 1206 ms returned sat
[2020-06-03 16:55:41] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 48 ms.
[2020-06-03 16:55:45] [INFO ] Added : 302 causal constraints over 61 iterations in 3585 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 16:55:45] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:55:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 16:55:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:47] [INFO ] [Real]Absence check using state equation in 2176 ms returned sat
[2020-06-03 16:55:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-06-03 16:55:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 92 ms returned sat
[2020-06-03 16:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:50] [INFO ] [Nat]Absence check using state equation in 1978 ms returned sat
[2020-06-03 16:55:50] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2020-06-03 16:55:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2020-06-03 16:55:50] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 29 ms.
[2020-06-03 16:55:53] [INFO ] Added : 234 causal constraints over 47 iterations in 3761 ms. Result :sat
[2020-06-03 16:55:54] [INFO ] Deduced a trap composed of 25 places in 221 ms
[2020-06-03 16:55:54] [INFO ] Deduced a trap composed of 25 places in 231 ms
[2020-06-03 16:55:54] [INFO ] Deduced a trap composed of 27 places in 153 ms
[2020-06-03 16:55:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 875 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-03 16:55:55] [INFO ] [Real]Absence check using 36 positive place invariants in 44 ms returned sat
[2020-06-03 16:55:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 16:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:56] [INFO ] [Real]Absence check using state equation in 1198 ms returned sat
[2020-06-03 16:55:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:55:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 16:55:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 122 ms returned sat
[2020-06-03 16:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:55:57] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2020-06-03 16:55:58] [INFO ] Deduced a trap composed of 16 places in 251 ms
[2020-06-03 16:55:58] [INFO ] Deduced a trap composed of 6 places in 67 ms
[2020-06-03 16:55:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 417 ms
[2020-06-03 16:55:58] [INFO ] Computed and/alt/rep : 304/1184/304 causal constraints in 34 ms.
[2020-06-03 16:56:02] [INFO ] Added : 233 causal constraints over 47 iterations in 3942 ms. Result :sat
[2020-06-03 16:56:02] [INFO ] Deduced a trap composed of 17 places in 129 ms
[2020-06-03 16:56:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 267 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 16:56:02] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2020-06-03 16:56:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2020-06-03 16:56:03] [INFO ] Flatten gal took : 190 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-60b @ 3570 seconds

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

FORMULA DES-PT-60b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60b-ReachabilityCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3405
rslt: Output for ReachabilityCardinality @ DES-PT-60b

{
"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 16:56:03 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p198 <= 0))))",
"processed_size": 21,
"rewrites": 2
},
"result":
{
"edges": 822549,
"markings": 588071,
"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": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 889
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p24))))",
"processed_size": 20,
"rewrites": 1
},
"result":
{
"edges": 26081665,
"markings": 17432055,
"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": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1135
},
"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 <= p120)) AND ((p67 <= 0)))))",
"processed_size": 40,
"rewrites": 1
},
"result":
{
"edges": 26136,
"markings": 20325,
"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": 2,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1703
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 2,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((((p161 <= 0)) OR ((1 <= p259))) AND (((p219 <= 0)) OR ((1 <= p115))))))",
"processed_size": 81,
"rewrites": 2
},
"result":
{
"edges": 4530,
"markings": 2722,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"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": 3406
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 7,
"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 ((((p355 <= 0)) OR ((1 <= p247)) OR ((((p206 <= 0)) OR ((1 <= p322))) AND (((p110 <= 0)) OR ((1 <= p353)))))))",
"processed_size": 119,
"rewrites": 2
},
"result":
{
"edges": 179379,
"markings": 119468,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22652,
"runtime": 165.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 1479,
"conflict_clusters": 49,
"places": 358,
"places_significant": 298,
"singleton_clusters": 0,
"transitions": 307
},
"result":
{
"preliminary_value": "no no yes no yes ",
"value": "no no yes no 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: 665/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 358
lola: finding significant places
lola: 358 places, 307 transitions, 298 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: (p198 <= 1)
lola: LP says that atomic proposition is always true: (p259 <= 1)
lola: LP says that atomic proposition is always true: (p115 <= 1)
lola: LP says that atomic proposition is always true: (p67 <= 1)
lola: LP says that atomic proposition is always true: (p247 <= 1)
lola: LP says that atomic proposition is always true: (p322 <= 1)
lola: LP says that atomic proposition is always true: (p353 <= 1)
lola: LP says that atomic proposition is always true: (p24 <= 1)
lola: A (G (((p198 <= 0)))) : A (G (((((p161 <= 0)) OR ((1 <= p259))) AND (((p219 <= 0)) OR ((1 <= p115)))))) : E (F ((((1 <= p120)) AND ((p67 <= 0))))) : A (G ((((p355 <= 0)) OR ((1 <= p247)) OR ((((p206 <= 0)) OR ((1 <= p322))) AND (((p110 <= 0)) OR ((1 <= p353))))))) : E (F (((1 <= p24))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p198 <= 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 (((p198 <= 0))))
lola: processed formula length: 21
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 <= p198))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 588071 markings, 822549 edges
lola: ========================================
lola: subprocess 1 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p24))))
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 <= p24))))
lola: processed formula length: 20
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 <= p24))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 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: sara is running 0 secs || 578748 markings, 841689 edges, 115750 markings/sec, 0 secs
lola: sara is running 5 secs || 1163944 markings, 1695519 edges, 117039 markings/sec, 5 secs
lola: sara is running 10 secs || 1754592 markings, 2555659 edges, 118130 markings/sec, 10 secs
lola: sara is running 15 secs || 2324662 markings, 3414298 edges, 114014 markings/sec, 15 secs
lola: sara is running 20 secs || 2887050 markings, 4264753 edges, 112478 markings/sec, 20 secs
lola: sara is running 25 secs || 3470568 markings, 5135675 edges, 116704 markings/sec, 25 secs
lola: sara is running 30 secs || 4038455 markings, 5985219 edges, 113577 markings/sec, 30 secs
lola: sara is running 35 secs || 4616639 markings, 6853347 edges, 115637 markings/sec, 35 secs
lola: sara is running 40 secs || 5199187 markings, 7723269 edges, 116510 markings/sec, 40 secs
lola: sara is running 45 secs || 5782905 markings, 8591501 edges, 116744 markings/sec, 45 secs
lola: sara is running 50 secs || 6365922 markings, 9467651 edges, 116603 markings/sec, 50 secs
lola: sara is running 55 secs || 6949198 markings, 10341942 edges, 116655 markings/sec, 55 secs
lola: sara is running 60 secs || 7529041 markings, 11214091 edges, 115969 markings/sec, 60 secs
lola: sara is running 65 secs || 8106405 markings, 12082746 edges, 115473 markings/sec, 65 secs
lola: sara is running 70 secs || 8689671 markings, 12958859 edges, 116653 markings/sec, 70 secs
lola: sara is running 75 secs || 9267658 markings, 13829683 edges, 115597 markings/sec, 75 secs
lola: sara is running 80 secs || 9835598 markings, 14687625 edges, 113588 markings/sec, 80 secs
lola: sara is running 85 secs || 10400618 markings, 15529465 edges, 113004 markings/sec, 85 secs
lola: sara is running 90 secs || 10953127 markings, 16358358 edges, 110502 markings/sec, 90 secs
lola: sara is running 95 secs || 11516879 markings, 17199428 edges, 112750 markings/sec, 95 secs
lola: sara is running 100 secs || 12086931 markings, 18049556 edges, 114010 markings/sec, 100 secs
lola: sara is running 105 secs || 12653975 markings, 18899103 edges, 113409 markings/sec, 105 secs
lola: sara is running 110 secs || 13214469 markings, 19741912 edges, 112099 markings/sec, 110 secs
lola: sara is running 115 secs || 13777685 markings, 20588562 edges, 112643 markings/sec, 115 secs
lola: sara is running 120 secs || 14338271 markings, 21434776 edges, 112117 markings/sec, 120 secs
lola: sara is running 125 secs || 14889930 markings, 22269353 edges, 110332 markings/sec, 125 secs
lola: sara is running 130 secs || 15450393 markings, 23103229 edges, 112093 markings/sec, 130 secs
lola: sara is running 135 secs || 15997848 markings, 23924769 edges, 109491 markings/sec, 135 secs
lola: sara is running 140 secs || 16557881 markings, 24762449 edges, 112007 markings/sec, 140 secs
lola: sara is running 145 secs || 17130901 markings, 25613383 edges, 114604 markings/sec, 145 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17432055 markings, 26081665 edges
lola: ========================================
lola: subprocess 2 will run for 1135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p120)) AND ((p67 <= 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 <= p120)) AND ((p67 <= 0)))))
lola: processed formula length: 40
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 <= p120)) AND ((p67 <= 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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-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: 20325 markings, 26136 edges
lola: ========================================
lola: subprocess 3 will run for 1703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p161 <= 0)) OR ((1 <= p259))) AND (((p219 <= 0)) OR ((1 <= p115))))))
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 (((((p161 <= 0)) OR ((1 <= p259))) AND (((p219 <= 0)) OR ((1 <= p115))))))
lola: processed formula length: 81
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 <= p161)) AND ((p259 <= 0))) OR (((1 <= p219)) AND ((p115 <= 0))))
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-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2722 markings, 4530 edges
lola: ========================================
lola: subprocess 4 will run for 3406 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p355 <= 0)) OR ((1 <= p247)) OR ((((p206 <= 0)) OR ((1 <= p322))) AND (((p110 <= 0)) OR ((1 <= p353)))))))
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 ((((p355 <= 0)) OR ((1 <= p247)) OR ((((p206 <= 0)) OR ((1 <= p322))) AND (((p110 <= 0)) OR ((1 <= p353)))))))
lola: processed formula length: 119
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 <= p355)) AND ((p247 <= 0)) AND ((((1 <= p206)) AND ((p322 <= 0))) OR (((1 <= p110)) AND ((p353 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-4-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 119468 markings, 179379 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes
lola:
preliminary result: no no yes no yes
lola: memory consumption: 22652 KB
lola: time consumption: 165 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-60b"
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-60b, 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-158987900100334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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