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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 3.4K Mar 30 01:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 30 01:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:20 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.2K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 127K 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-50b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591198964606

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 15:42:47] [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 15:42:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 15:42:48] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-06-03 15:42:48] [INFO ] Transformed 479 places.
[2020-06-03 15:42:48] [INFO ] Transformed 430 transitions.
[2020-06-03 15:42:48] [INFO ] Found NUPN structural information;
[2020-06-03 15:42:48] [INFO ] Parsed PT model containing 479 places and 430 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 72 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-50b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 87 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[1, 0, 1, 1, 0, 0, 0, 0, 0]
FORMULA DES-PT-50b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 430 rows 479 cols
[2020-06-03 15:42:48] [INFO ] Computed 65 place invariants in 64 ms
[2020-06-03 15:42:49] [INFO ] [Real]Absence check using 40 positive place invariants in 79 ms returned sat
[2020-06-03 15:42:49] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 54 ms returned sat
[2020-06-03 15:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:42:50] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-06-03 15:42:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:42:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 175 ms returned sat
[2020-06-03 15:42:51] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 163 ms returned sat
[2020-06-03 15:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:42:52] [INFO ] [Nat]Absence check using state equation in 1841 ms returned sat
[2020-06-03 15:42:53] [INFO ] Deduced a trap composed of 12 places in 487 ms
[2020-06-03 15:42:53] [INFO ] Deduced a trap composed of 47 places in 464 ms
[2020-06-03 15:42:54] [INFO ] Deduced a trap composed of 36 places in 573 ms
[2020-06-03 15:42:54] [INFO ] Deduced a trap composed of 30 places in 283 ms
[2020-06-03 15:42:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2116 ms
[2020-06-03 15:42:55] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 68 ms.
020)
^^^
(error "Incorrect format for a number - no leading zeros allowed: 020")
[2020-06-03 15:42:55] [INFO ] Added : 35 causal constraints over 7 iterations in 615 ms. Result :(error "Failed to check-sat")
[2020-06-03 15:42:55] [INFO ] [Real]Absence check using 40 positive place invariants in 55 ms returned sat
[2020-06-03 15:42:55] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 15:42:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:42:57] [INFO ] [Real]Absence check using state equation in 1626 ms returned sat
[2020-06-03 15:42:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:42:57] [INFO ] [Nat]Absence check using 40 positive place invariants in 78 ms returned sat
[2020-06-03 15:42:57] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 111 ms returned sat
[2020-06-03 15:42:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:42:59] [INFO ] [Nat]Absence check using state equation in 1331 ms returned sat
[2020-06-03 15:42:59] [INFO ] Deduced a trap composed of 8 places in 313 ms
[2020-06-03 15:42:59] [INFO ] Deduced a trap composed of 20 places in 258 ms
[2020-06-03 15:43:00] [INFO ] Deduced a trap composed of 12 places in 214 ms
[2020-06-03 15:43:00] [INFO ] Deduced a trap composed of 17 places in 168 ms
[2020-06-03 15:43:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1171 ms
[2020-06-03 15:43:00] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 45 ms.
[2020-06-03 15:43:02] [INFO ] Added : 125 causal constraints over 25 iterations in 2236 ms. Result :(error "Failed to check-sat")
[2020-06-03 15:43:02] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2020-06-03 15:43:02] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 15:43:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:03] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2020-06-03 15:43:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 79 ms returned sat
[2020-06-03 15:43:04] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 15:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:06] [INFO ] [Nat]Absence check using state equation in 2012 ms returned sat
[2020-06-03 15:43:06] [INFO ] Deduced a trap composed of 14 places in 217 ms
[2020-06-03 15:43:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
[2020-06-03 15:43:06] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 52 ms.
[2020-06-03 15:43:09] [INFO ] Added : 135 causal constraints over 27 iterations in 2458 ms. Result :(error "Failed to check-sat")
[2020-06-03 15:43:09] [INFO ] [Real]Absence check using 40 positive place invariants in 72 ms returned sat
[2020-06-03 15:43:09] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 57 ms returned sat
[2020-06-03 15:43:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:10] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2020-06-03 15:43:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:11] [INFO ] [Nat]Absence check using 40 positive place invariants in 95 ms returned sat
[2020-06-03 15:43:11] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 70 ms returned sat
[2020-06-03 15:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:13] [INFO ] [Nat]Absence check using state equation in 1893 ms returned sat
[2020-06-03 15:43:13] [INFO ] Deduced a trap composed of 12 places in 303 ms
[2020-06-03 15:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 421 ms
[2020-06-03 15:43:13] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 64 ms.
[2020-06-03 15:43:15] [INFO ] Added : 75 causal constraints over 15 iterations in 2139 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 15:43:16] [INFO ] [Real]Absence check using 40 positive place invariants in 142 ms returned sat
[2020-06-03 15:43:16] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 119 ms returned sat
[2020-06-03 15:43:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:17] [INFO ] [Real]Absence check using state equation in 1347 ms returned sat
[2020-06-03 15:43:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 126 ms returned sat
[2020-06-03 15:43:18] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 97 ms returned sat
[2020-06-03 15:43:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:20] [INFO ] [Nat]Absence check using state equation in 2035 ms returned sat
[2020-06-03 15:43:20] [INFO ] Deduced a trap composed of 12 places in 437 ms
[2020-06-03 15:43:21] [INFO ] Deduced a trap composed of 19 places in 784 ms
[2020-06-03 15:43:22] [INFO ] Deduced a trap composed of 15 places in 536 ms
[2020-06-03 15:43:22] [INFO ] Deduced a trap composed of 15 places in 249 ms
[2020-06-03 15:43:22] [INFO ] Deduced a trap composed of 13 places in 245 ms
[2020-06-03 15:43:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s208 s209 s210 s211 s222 s223 s224 s225 s226 s227 s228 s254) 0)") while checking expression at index 4
[2020-06-03 15:43:22] [INFO ] [Real]Absence check using 40 positive place invariants in 52 ms returned sat
[2020-06-03 15:43:23] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 91 ms returned sat
[2020-06-03 15:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:26] [INFO ] [Real]Absence check using state equation in 2972 ms returned sat
[2020-06-03 15:43:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 98 ms returned sat
[2020-06-03 15:43:26] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 74 ms returned sat
[2020-06-03 15:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:28] [INFO ] [Nat]Absence check using state equation in 2129 ms returned sat
[2020-06-03 15:43:28] [INFO ] Deduced a trap composed of 13 places in 315 ms
[2020-06-03 15:43:29] [INFO ] Deduced a trap composed of 12 places in 298 ms
[2020-06-03 15:43:29] [INFO ] Deduced a trap composed of 36 places in 358 ms
[2020-06-03 15:43:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1225 ms
[2020-06-03 15:43:29] [INFO ] Computed and/alt/rep : 429/1147/429 causal constraints in 80 ms.
[2020-06-03 15:43:31] [INFO ] Added : 60 causal constraints over 12 iterations in 1352 ms. Result :(error "Failed to check-sat")
Support contains 21 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (complete) has 1098 edges and 479 vertex of which 470 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.22 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 470 transition count 409
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 36 place count 453 transition count 409
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 36 place count 453 transition count 398
Deduced a syphon composed of 11 places in 5 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 58 place count 442 transition count 398
Symmetric choice reduction at 2 with 18 rule applications. Total rules 76 place count 442 transition count 398
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 112 place count 424 transition count 380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 112 place count 424 transition count 379
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 423 transition count 379
Symmetric choice reduction at 2 with 13 rule applications. Total rules 127 place count 423 transition count 379
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 13 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 153 place count 410 transition count 366
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 166 place count 410 transition count 353
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 169 place count 408 transition count 352
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 169 place count 408 transition count 350
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 173 place count 406 transition count 350
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 299 place count 343 transition count 287
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 4 with 8 rules applied. Total rules applied 307 place count 339 transition count 291
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 308 place count 339 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 309 place count 338 transition count 290
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 311 place count 338 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 313 place count 336 transition count 288
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 316 place count 336 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 317 place count 335 transition count 287
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 318 place count 334 transition count 287
Applied a total of 318 rules in 487 ms. Remains 334 /479 variables (removed 145) and now considering 287/430 (removed 143) transitions.
Finished structural reductions, in 1 iterations. Remains : 334/479 places, 287/430 transitions.
Incomplete random walk after 1000000 steps, including 30797 resets, run finished after 4321 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA DES-PT-50b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4693 resets, run finished after 1699 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4708 resets, run finished after 1577 ms. (steps per millisecond=634 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 4699 resets, run finished after 1832 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5669 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4718 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 287 rows 334 cols
[2020-06-03 15:43:44] [INFO ] Computed 59 place invariants in 13 ms
[2020-06-03 15:43:44] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:43:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:45] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2020-06-03 15:43:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 72 ms returned sat
[2020-06-03 15:43:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 189 ms returned sat
[2020-06-03 15:43:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:47] [INFO ] [Nat]Absence check using state equation in 1081 ms returned sat
[2020-06-03 15:43:47] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-06-03 15:43:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2020-06-03 15:43:47] [INFO ] Computed and/alt/rep : 282/1186/282 causal constraints in 42 ms.
[2020-06-03 15:43:49] [INFO ] Added : 165 causal constraints over 33 iterations in 2461 ms. Result :sat
[2020-06-03 15:43:49] [INFO ] Deduced a trap composed of 50 places in 49 ms
[2020-06-03 15:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:43:50] [INFO ] [Real]Absence check using 35 positive place invariants in 49 ms returned sat
[2020-06-03 15:43:50] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:43:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:51] [INFO ] [Real]Absence check using state equation in 1065 ms returned sat
[2020-06-03 15:43:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 78 ms returned sat
[2020-06-03 15:43:52] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 464 ms returned sat
[2020-06-03 15:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:53] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2020-06-03 15:43:53] [INFO ] Deduced a trap composed of 9 places in 190 ms
[2020-06-03 15:43:53] [INFO ] Deduced a trap composed of 9 places in 146 ms
[2020-06-03 15:43:54] [INFO ] Deduced a trap composed of 12 places in 89 ms
[2020-06-03 15:43:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 580 ms
[2020-06-03 15:43:54] [INFO ] Computed and/alt/rep : 282/1186/282 causal constraints in 34 ms.
[2020-06-03 15:43:57] [INFO ] Added : 156 causal constraints over 32 iterations in 3024 ms. Result :sat
[2020-06-03 15:43:57] [INFO ] Deduced a trap composed of 17 places in 87 ms
[2020-06-03 15:43:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-06-03 15:43:57] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:43:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 15:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:58] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2020-06-03 15:43:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:43:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-06-03 15:43:58] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 137 ms returned sat
[2020-06-03 15:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:43:59] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2020-06-03 15:43:59] [INFO ] Deduced a trap composed of 6 places in 88 ms
[2020-06-03 15:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2020-06-03 15:43:59] [INFO ] Computed and/alt/rep : 282/1186/282 causal constraints in 37 ms.
[2020-06-03 15:44:03] [INFO ] Added : 244 causal constraints over 49 iterations in 3492 ms. Result :sat
[2020-06-03 15:44:03] [INFO ] Deduced a trap composed of 52 places in 79 ms
[2020-06-03 15:44:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 15:44:03] [INFO ] [Real]Absence check using 35 positive place invariants in 46 ms returned sat
[2020-06-03 15:44:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2020-06-03 15:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:04] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2020-06-03 15:44:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 48 ms returned sat
[2020-06-03 15:44:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 170 ms returned sat
[2020-06-03 15:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:05] [INFO ] [Nat]Absence check using state equation in 1037 ms returned sat
[2020-06-03 15:44:05] [INFO ] Computed and/alt/rep : 282/1186/282 causal constraints in 33 ms.
[2020-06-03 15:44:09] [INFO ] Added : 201 causal constraints over 41 iterations in 3655 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 15:44:09] [INFO ] [Real]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 15:44:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:44:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:10] [INFO ] [Real]Absence check using state equation in 720 ms returned sat
[2020-06-03 15:44:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:44:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:44:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 221 ms returned sat
[2020-06-03 15:44:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:44:11] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2020-06-03 15:44:12] [INFO ] Computed and/alt/rep : 282/1186/282 causal constraints in 37 ms.
[2020-06-03 15:44:15] [INFO ] Added : 211 causal constraints over 43 iterations in 3430 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 193400 steps, including 7470 resets, run finished after 1084 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 146700 steps, including 5871 resets, run finished after 787 ms. (steps per millisecond=186 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 298900 steps, including 11776 resets, run finished after 1459 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 63000 steps, including 2273 resets, run finished after 303 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 228600 steps, including 8925 resets, run finished after 1114 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 334 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 334/334 places, 287/287 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 329 transition count 282
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 329 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 3 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 328 transition count 279
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 17 place count 328 transition count 275
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 327 transition count 274
Applied a total of 18 rules in 90 ms. Remains 327 /334 variables (removed 7) and now considering 274/287 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 327/334 places, 274/287 transitions.
Incomplete random walk after 1000000 steps, including 36308 resets, run finished after 4611 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6060 resets, run finished after 1924 ms. (steps per millisecond=519 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 6033 resets, run finished after 1900 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 6078 resets, run finished after 2012 ms. (steps per millisecond=497 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 7001 resets, run finished after 1989 ms. (steps per millisecond=502 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5974 resets, run finished after 1944 ms. (steps per millisecond=514 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7416543 steps, run timeout after 30001 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 7416543 steps, saw 994657 distinct states, run finished after 30001 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:45:04] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:45:04] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:45:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 15:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:05] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-06-03 15:45:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 15:45:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2020-06-03 15:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:06] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2020-06-03 15:45:07] [INFO ] Deduced a trap composed of 21 places in 141 ms
[2020-06-03 15:45:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2020-06-03 15:45:07] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 36 ms.
[2020-06-03 15:45:09] [INFO ] Added : 144 causal constraints over 29 iterations in 2231 ms. Result :sat
[2020-06-03 15:45:09] [INFO ] Deduced a trap composed of 14 places in 98 ms
[2020-06-03 15:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-03 15:45:09] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 15:45:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:10] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2020-06-03 15:45:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 15:45:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 148 ms returned sat
[2020-06-03 15:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:11] [INFO ] [Nat]Absence check using state equation in 903 ms returned sat
[2020-06-03 15:45:11] [INFO ] Deduced a trap composed of 15 places in 139 ms
[2020-06-03 15:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2020-06-03 15:45:11] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 33 ms.
[2020-06-03 15:45:14] [INFO ] Added : 143 causal constraints over 29 iterations in 2331 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-06-03 15:45:14] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:45:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2020-06-03 15:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:15] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2020-06-03 15:45:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:45:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:45:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:16] [INFO ] [Nat]Absence check using state equation in 1055 ms returned sat
[2020-06-03 15:45:16] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 32 ms.
[2020-06-03 15:45:18] [INFO ] Added : 233 causal constraints over 47 iterations in 2537 ms. Result :sat
[2020-06-03 15:45:19] [INFO ] Deduced a trap composed of 7 places in 101 ms
[2020-06-03 15:45:19] [INFO ] Deduced a trap composed of 52 places in 66 ms
[2020-06-03 15:45:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 15:45:19] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:45:19] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2020-06-03 15:45:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:20] [INFO ] [Real]Absence check using state equation in 740 ms returned sat
[2020-06-03 15:45:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:45:20] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2020-06-03 15:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:21] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2020-06-03 15:45:21] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 32 ms.
[2020-06-03 15:45:24] [INFO ] Added : 193 causal constraints over 39 iterations in 3649 ms. Result :sat
[2020-06-03 15:45:25] [INFO ] Deduced a trap composed of 50 places in 54 ms
[2020-06-03 15:45:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 15:45:25] [INFO ] [Real]Absence check using 35 positive place invariants in 31 ms returned sat
[2020-06-03 15:45:25] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:25] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2020-06-03 15:45:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:45:26] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 105 ms returned sat
[2020-06-03 15:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:27] [INFO ] [Nat]Absence check using state equation in 1030 ms returned sat
[2020-06-03 15:45:27] [INFO ] Deduced a trap composed of 7 places in 49 ms
[2020-06-03 15:45:27] [INFO ] Deduced a trap composed of 6 places in 58 ms
[2020-06-03 15:45:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2020-06-03 15:45:27] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 27 ms.
[2020-06-03 15:45:29] [INFO ] Added : 165 causal constraints over 34 iterations in 1837 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 170100 steps, including 5118 resets, run finished after 874 ms. (steps per millisecond=194 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232500 steps, including 6881 resets, run finished after 1045 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 270900 steps, including 8042 resets, run finished after 1260 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 60200 steps, including 1670 resets, run finished after 265 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 65800 steps, including 1814 resets, run finished after 326 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 327 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 327/327 places, 274/274 transitions.
Applied a total of 0 rules in 23 ms. Remains 327 /327 variables (removed 0) and now considering 274/274 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 327/327 places, 274/274 transitions.
Starting structural reductions, iteration 0 : 327/327 places, 274/274 transitions.
Applied a total of 0 rules in 21 ms. Remains 327 /327 variables (removed 0) and now considering 274/274 (removed 0) transitions.
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:45:33] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:45:34] [INFO ] Implicit Places using invariants in 1424 ms returned []
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:45:34] [INFO ] Computed 59 place invariants in 10 ms
[2020-06-03 15:45:37] [INFO ] Implicit Places using invariants and state equation in 2972 ms returned []
Implicit Place search using SMT with State Equation took 4401 ms to find 0 implicit places.
[2020-06-03 15:45:37] [INFO ] Redundant transitions in 47 ms returned []
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:45:37] [INFO ] Computed 59 place invariants in 9 ms
[2020-06-03 15:45:38] [INFO ] Dead Transitions using invariants and state equation in 1170 ms returned []
Finished structural reductions, in 1 iterations. Remains : 327/327 places, 274/274 transitions.
Incomplete random walk after 100000 steps, including 3655 resets, run finished after 444 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:45:39] [INFO ] Computed 59 place invariants in 7 ms
[2020-06-03 15:45:39] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:45:39] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:40] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2020-06-03 15:45:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 49 ms returned sat
[2020-06-03 15:45:40] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2020-06-03 15:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:41] [INFO ] [Nat]Absence check using state equation in 1173 ms returned sat
[2020-06-03 15:45:41] [INFO ] Deduced a trap composed of 21 places in 149 ms
[2020-06-03 15:45:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-06-03 15:45:41] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 97 ms.
[2020-06-03 15:45:44] [INFO ] Added : 144 causal constraints over 29 iterations in 2412 ms. Result :sat
[2020-06-03 15:45:44] [INFO ] Deduced a trap composed of 14 places in 121 ms
[2020-06-03 15:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2020-06-03 15:45:44] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:45:44] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 36 ms returned sat
[2020-06-03 15:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:45] [INFO ] [Real]Absence check using state equation in 670 ms returned sat
[2020-06-03 15:45:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 15:45:45] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 150 ms returned sat
[2020-06-03 15:45:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:46] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2020-06-03 15:45:46] [INFO ] Deduced a trap composed of 15 places in 128 ms
[2020-06-03 15:45:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2020-06-03 15:45:46] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 30 ms.
[2020-06-03 15:45:48] [INFO ] Added : 143 causal constraints over 29 iterations in 2280 ms. Result :sat
[2020-06-03 15:45:48] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:49] [INFO ] [Real]Absence check using state equation in 942 ms returned sat
[2020-06-03 15:45:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 15:45:50] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 40 ms returned sat
[2020-06-03 15:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:51] [INFO ] [Nat]Absence check using state equation in 1105 ms returned sat
[2020-06-03 15:45:51] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 30 ms.
[2020-06-03 15:45:53] [INFO ] Added : 233 causal constraints over 47 iterations in 2667 ms. Result :sat
[2020-06-03 15:45:54] [INFO ] Deduced a trap composed of 7 places in 86 ms
[2020-06-03 15:45:54] [INFO ] Deduced a trap composed of 52 places in 54 ms
[2020-06-03 15:45:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 297 ms
[2020-06-03 15:45:54] [INFO ] [Real]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:45:54] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 37 ms returned sat
[2020-06-03 15:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:55] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2020-06-03 15:45:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:45:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 15:45:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2020-06-03 15:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:45:56] [INFO ] [Nat]Absence check using state equation in 812 ms returned sat
[2020-06-03 15:45:56] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 31 ms.
[2020-06-03 15:45:59] [INFO ] Added : 193 causal constraints over 39 iterations in 3664 ms. Result :sat
[2020-06-03 15:45:59] [INFO ] Deduced a trap composed of 50 places in 59 ms
[2020-06-03 15:45:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2020-06-03 15:46:00] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 15:46:00] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 33 ms returned sat
[2020-06-03 15:46:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:00] [INFO ] [Real]Absence check using state equation in 820 ms returned sat
[2020-06-03 15:46:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:46:01] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 104 ms returned sat
[2020-06-03 15:46:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:02] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2020-06-03 15:46:02] [INFO ] Deduced a trap composed of 7 places in 70 ms
[2020-06-03 15:46:02] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-06-03 15:46:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2020-06-03 15:46:02] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 97 ms.
[2020-06-03 15:46:04] [INFO ] Added : 165 causal constraints over 34 iterations in 2057 ms. Result :sat
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 327 transition count 274
Applied a total of 1 rules in 52 ms. Remains 327 /327 variables (removed 0) and now considering 274/274 (removed 0) transitions.
// Phase 1: matrix 274 rows 327 cols
[2020-06-03 15:46:04] [INFO ] Computed 59 place invariants in 8 ms
[2020-06-03 15:46:04] [INFO ] [Real]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 15:46:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 38 ms returned sat
[2020-06-03 15:46:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:05] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-06-03 15:46:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 33 ms returned sat
[2020-06-03 15:46:05] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2020-06-03 15:46:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:06] [INFO ] [Nat]Absence check using state equation in 1065 ms returned sat
[2020-06-03 15:46:06] [INFO ] Deduced a trap composed of 20 places in 142 ms
[2020-06-03 15:46:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2020-06-03 15:46:06] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 32 ms.
[2020-06-03 15:46:09] [INFO ] Added : 152 causal constraints over 31 iterations in 2512 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:46:09] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 15:46:09] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:10] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2020-06-03 15:46:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 15:46:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 149 ms returned sat
[2020-06-03 15:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:11] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2020-06-03 15:46:11] [INFO ] Deduced a trap composed of 17 places in 157 ms
[2020-06-03 15:46:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-06-03 15:46:11] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 26 ms.
[2020-06-03 15:46:13] [INFO ] Added : 145 causal constraints over 30 iterations in 2208 ms. Result :sat
[2020-06-03 15:46:14] [INFO ] Deduced a trap composed of 15 places in 184 ms
[2020-06-03 15:46:14] [INFO ] Deduced a trap composed of 15 places in 148 ms
[2020-06-03 15:46:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 501 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 15:46:14] [INFO ] [Real]Absence check using 35 positive place invariants in 32 ms returned sat
[2020-06-03 15:46:14] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:15] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2020-06-03 15:46:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 15:46:15] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 69 ms returned sat
[2020-06-03 15:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:16] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2020-06-03 15:46:16] [INFO ] Deduced a trap composed of 6 places in 185 ms
[2020-06-03 15:46:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
[2020-06-03 15:46:16] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 29 ms.
[2020-06-03 15:46:19] [INFO ] Added : 233 causal constraints over 47 iterations in 2903 ms. Result :sat
[2020-06-03 15:46:19] [INFO ] Deduced a trap composed of 6 places in 87 ms
[2020-06-03 15:46:19] [INFO ] Deduced a trap composed of 52 places in 50 ms
[2020-06-03 15:46:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 276 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-06-03 15:46:20] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 15:46:20] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 39 ms returned sat
[2020-06-03 15:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:20] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2020-06-03 15:46:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 66 ms returned sat
[2020-06-03 15:46:21] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 94 ms returned sat
[2020-06-03 15:46:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:22] [INFO ] [Nat]Absence check using state equation in 1425 ms returned sat
[2020-06-03 15:46:22] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 124 ms.
[2020-06-03 15:46:26] [INFO ] Added : 194 causal constraints over 40 iterations in 3276 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 15:46:26] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 15:46:26] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2020-06-03 15:46:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:27] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2020-06-03 15:46:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 15:46:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 15:46:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 112 ms returned sat
[2020-06-03 15:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 15:46:28] [INFO ] [Nat]Absence check using state equation in 907 ms returned sat
[2020-06-03 15:46:28] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2020-06-03 15:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2020-06-03 15:46:28] [INFO ] Computed and/alt/rep : 269/917/269 causal constraints in 57 ms.
[2020-06-03 15:46:31] [INFO ] Added : 206 causal constraints over 42 iterations in 2554 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-06-03 15:46:31] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 14 ms.
[2020-06-03 15:46:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 18 ms.
[2020-06-03 15:46:31] [INFO ] Flatten gal took : 160 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-50b @ 3570 seconds

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

FORMULA DES-PT-50b-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-50b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

{
"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 15:46:32 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 713
},
"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 (((p41 <= 0))))",
"processed_size": 20,
"rewrites": 2
},
"result":
{
"edges": 313427,
"markings": 242617,
"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": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G ((((p88 <= 0)) OR ((1 <= p277)))))",
"processed_size": 40,
"rewrites": 2
},
"result":
{
"edges": 193638,
"markings": 179447,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1187
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"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": "A (G ((((p19 <= 0)) OR ((1 <= p224)))))",
"processed_size": 40,
"rewrites": 2
},
"result":
{
"edges": 5820670,
"markings": 4607023,
"produced_by": "state space",
"value": false
},
"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": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1764
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"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": "E (F ((((1 <= p222)) AND ((p276 <= 0)) AND ((1 <= p131)) AND ((p216 <= 0)))))",
"processed_size": 77,
"rewrites": 1
},
"result":
{
"edges": 149126,
"markings": 89570,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3527
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 4,
"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 <= p74)) AND ((p317 <= 0)) AND ((p235 <= 0)) AND (((p200 <= 0)) OR ((1 <= p271))))))",
"processed_size": 96,
"rewrites": 1
},
"result":
{
"edges": 1840330,
"markings": 1683558,
"produced_by": "state space",
"value": true
},
"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": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 22384,
"runtime": 53.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1249,
"conflict_clusters": 57,
"places": 327,
"places_significant": 268,
"singleton_clusters": 0,
"transitions": 274
},
"result":
{
"preliminary_value": "no no yes yes no ",
"value": "no no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 601/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 327
lola: finding significant places
lola: 327 places, 274 transitions, 268 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: (p277 <= 1)
lola: LP says that atomic proposition is always true: (p41 <= 1)
lola: LP says that atomic proposition is always true: (p276 <= 1)
lola: LP says that atomic proposition is always true: (p216 <= 1)
lola: LP says that atomic proposition is always true: (p317 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p271 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: A (G ((((p88 <= 0)) OR ((1 <= p277))))) : A (G (((p41 <= 0)))) : E (F ((((1 <= p222)) AND ((p276 <= 0)) AND ((1 <= p131)) AND ((p216 <= 0))))) : E (F ((((1 <= p74)) AND ((p317 <= 0)) AND ((p235 <= 0)) AND (((p200 <= 0)) OR ((1 <= p271)))))) : A (G ((((p19 <= 0)) OR ((1 <= p224)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p41 <= 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 (((p41 <= 0))))
lola: processed formula length: 20
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 <= p41))
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: error: :1220: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 242617 markings, 313427 edges
lola: ========================================
lola: subprocess 1 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p88 <= 0)) OR ((1 <= p277)))))
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 ((((p88 <= 0)) OR ((1 <= p277)))))
lola: processed formula length: 40
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 <= p88)) AND ((p277 <= 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: error: :1220: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 179447 markings, 193638 edges
lola: ========================================
lola: subprocess 2 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p19 <= 0)) OR ((1 <= p224)))))
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 ((((p19 <= 0)) OR ((1 <= p224)))))
lola: processed formula length: 40
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 <= p19)) AND ((p224 <= 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: error: :1220: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 675927 markings, 849458 edges, 135185 markings/sec, 0 secs
lola: sara is running 5 secs || 1318556 markings, 1663024 edges, 128526 markings/sec, 5 secs
lola: sara is running 10 secs || 1971808 markings, 2490297 edges, 130650 markings/sec, 10 secs
lola: sara is running 15 secs || 2629145 markings, 3323804 edges, 131467 markings/sec, 15 secs
lola: sara is running 20 secs || 3295386 markings, 4168786 edges, 133248 markings/sec, 20 secs
lola: sara is running 25 secs || 3960052 markings, 5011267 edges, 132933 markings/sec, 25 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4607023 markings, 5820670 edges
lola: ========================================
lola: subprocess 3 will run for 1764 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p222)) AND ((p276 <= 0)) AND ((1 <= p131)) AND ((p216 <= 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 <= p222)) AND ((p276 <= 0)) AND ((1 <= p131)) AND ((p216 <= 0)))))
lola: processed formula length: 77
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 <= p222)) AND ((p276 <= 0)) AND ((1 <= p131)) AND ((p216 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 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.
sara: error: :1220: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 89570 markings, 149126 edges
lola: ========================================
lola: subprocess 4 will run for 3527 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p74)) AND ((p317 <= 0)) AND ((p235 <= 0)) AND (((p200 <= 0)) OR ((1 <= p271))))))
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 <= p74)) AND ((p317 <= 0)) AND ((p235 <= 0)) AND (((p200 <= 0)) OR ((1 <= p271))))))
lola: processed formula length: 96
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 <= p74)) AND ((p317 <= 0)) AND ((p235 <= 0)) AND (((p200 <= 0)) OR ((1 <= p271))))
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: error: :1220: error near 'TRANSITION': syntax error, unexpected KEY_TRANSITION, expecting SEMICOLON or COMMA
sara: error while reading Petri net from file -- aborting [#04]
sara: see manual for a documentation of this error
sara: last error message: No such file or directory
lola: state equation:solution unknown
lola: sara is running 0 secs || 818408 markings, 892904 edges, 163682 markings/sec, 0 secs
lola: sara is running 5 secs || 1643329 markings, 1796714 edges, 164984 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1683558 markings, 1840330 edges
lola: RESULT
lola:
SUMMARY: no no yes yes no
lola:
preliminary result: no no yes yes no
lola: ========================================
lola: memory consumption: 22384 KB
lola: time consumption: 53 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-50b"
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-50b, 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-158987900000318"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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