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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 3.7K Mar 30 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 30 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.3K 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.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 08:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 08:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 26 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 110K 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-60a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-60a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591200401955

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 16:06:45] [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:06:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 16:06:45] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2020-06-03 16:06:45] [INFO ] Transformed 354 places.
[2020-06-03 16:06:45] [INFO ] Transformed 311 transitions.
[2020-06-03 16:06:45] [INFO ] Found NUPN structural information;
[2020-06-03 16:06:45] [INFO ] Parsed PT model containing 354 places and 311 transitions in 229 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-60a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 219 resets, run finished after 163 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0]
FORMULA DES-PT-60a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 297 rows 354 cols
[2020-06-03 16:06:46] [INFO ] Computed 59 place invariants in 55 ms
[2020-06-03 16:06:46] [INFO ] [Real]Absence check using 34 positive place invariants in 73 ms returned sat
[2020-06-03 16:06:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 16:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:06:48] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2020-06-03 16:06:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:06:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 62 ms returned sat
[2020-06-03 16:06:48] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 132 ms returned sat
[2020-06-03 16:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:06:50] [INFO ] [Nat]Absence check using state equation in 1541 ms returned sat
[2020-06-03 16:06:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 16:06:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 16:06:50] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 49 ms.
[2020-06-03 16:06:53] [INFO ] Added : 210 causal constraints over 42 iterations in 2644 ms. Result :unknown
[2020-06-03 16:06:53] [INFO ] [Real]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:06:53] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:06:55] [INFO ] [Real]Absence check using state equation in 1978 ms returned sat
[2020-06-03 16:06:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:06:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:06:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 185 ms returned sat
[2020-06-03 16:06:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:06:57] [INFO ] [Nat]Absence check using state equation in 1477 ms returned sat
[2020-06-03 16:06:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 16:06:57] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 35 ms.
[2020-06-03 16:06:59] [INFO ] Added : 138 causal constraints over 28 iterations in 2613 ms. Result :sat
[2020-06-03 16:07:00] [INFO ] Deduced a trap composed of 22 places in 267 ms
[2020-06-03 16:07:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 390 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 16:07:00] [INFO ] [Real]Absence check using 34 positive place invariants in 50 ms returned sat
[2020-06-03 16:07:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 73 ms returned sat
[2020-06-03 16:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:02] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2020-06-03 16:07:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-06-03 16:07:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 140 ms returned sat
[2020-06-03 16:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:04] [INFO ] [Nat]Absence check using state equation in 1495 ms returned sat
[2020-06-03 16:07:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-06-03 16:07:04] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 124 ms.
[2020-06-03 16:07:08] [INFO ] Added : 215 causal constraints over 43 iterations in 3203 ms. Result :(error "Failed to check-sat")
[2020-06-03 16:07:08] [INFO ] [Real]Absence check using 34 positive place invariants in 64 ms returned sat
[2020-06-03 16:07:08] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:09] [INFO ] [Real]Absence check using state equation in 1370 ms returned sat
[2020-06-03 16:07:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:07:10] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 354 ms returned sat
[2020-06-03 16:07:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:11] [INFO ] [Nat]Absence check using state equation in 1639 ms returned sat
[2020-06-03 16:07:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2020-06-03 16:07:11] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 44 ms.
[2020-06-03 16:07:14] [INFO ] Added : 170 causal constraints over 34 iterations in 2806 ms. Result :unknown
[2020-06-03 16:07:14] [INFO ] [Real]Absence check using 34 positive place invariants in 85 ms returned sat
[2020-06-03 16:07:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 16:07:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:16] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2020-06-03 16:07:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:16] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-06-03 16:07:16] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 432 ms returned sat
[2020-06-03 16:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:18] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2020-06-03 16:07:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 16:07:18] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 46 ms.
[2020-06-03 16:07:21] [INFO ] Added : 194 causal constraints over 39 iterations in 2967 ms. Result :sat
[2020-06-03 16:07:21] [INFO ] Deduced a trap composed of 10 places in 397 ms
[2020-06-03 16:07:21] [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 s277 s333 s335 s339 s342 s343 s344 s347 s348) 0)") while checking expression at index 4
[2020-06-03 16:07:21] [INFO ] [Real]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:07:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 16:07:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:22] [INFO ] [Real]Absence check using state equation in 1104 ms returned sat
[2020-06-03 16:07:22] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 34 ms returned sat
[2020-06-03 16:07:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 95 ms returned sat
[2020-06-03 16:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:24] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2020-06-03 16:07:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2020-06-03 16:07:24] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 145 ms.
[2020-06-03 16:07:27] [INFO ] Added : 150 causal constraints over 30 iterations in 2917 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-06-03 16:07:27] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-06-03 16:07:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 16:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:28] [INFO ] [Real]Absence check using state equation in 962 ms returned sat
[2020-06-03 16:07:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:28] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 16:07:28] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 52 ms returned sat
[2020-06-03 16:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:29] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2020-06-03 16:07:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2020-06-03 16:07:30] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 39 ms.
[2020-06-03 16:07:33] [INFO ] Added : 265 causal constraints over 53 iterations in 3533 ms. Result :unknown
[2020-06-03 16:07:33] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-06-03 16:07:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:07:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:35] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2020-06-03 16:07:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:07:35] [INFO ] [Nat]Absence check using 34 positive place invariants in 43 ms returned sat
[2020-06-03 16:07:35] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 218 ms returned sat
[2020-06-03 16:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:07:37] [INFO ] [Nat]Absence check using state equation in 1916 ms returned sat
[2020-06-03 16:07:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-06-03 16:07:37] [INFO ] Computed and/alt/rep : 296/1259/296 causal constraints in 98 ms.
[2020-06-03 16:07:40] [INFO ] Added : 141 causal constraints over 29 iterations in 2697 ms. Result :sat
[2020-06-03 16:07:40] [INFO ] Deduced a trap composed of 2 places in 284 ms
[2020-06-03 16:07:40] [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 s251) 0)") while checking expression at index 7
Incomplete Parikh walk after 310900 steps, including 7721 resets, run finished after 1676 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 122400 steps, including 2898 resets, run finished after 611 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232700 steps, including 5703 resets, run finished after 1091 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105400 steps, including 2324 resets, run finished after 493 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 284500 steps, including 7008 resets, run finished after 1319 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 27 out of 354 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 354/354 places, 297/297 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 354 transition count 296
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 354 transition count 296
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 353 transition count 295
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 353 transition count 295
Applied a total of 8 rules in 171 ms. Remains 353 /354 variables (removed 1) and now considering 295/297 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/354 places, 295/297 transitions.
Incomplete random walk after 1000000 steps, including 18008 resets, run finished after 4616 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3400 resets, run finished after 1974 ms. (steps per millisecond=506 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3419 resets, run finished after 2339 ms. (steps per millisecond=427 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3392 resets, run finished after 2185 ms. (steps per millisecond=457 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3476 resets, run finished after 2243 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3426 resets, run finished after 2125 ms. (steps per millisecond=470 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3426 resets, run finished after 2122 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3454 resets, run finished after 1995 ms. (steps per millisecond=501 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3528 resets, run finished after 2251 ms. (steps per millisecond=444 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7911480 steps, run timeout after 30001 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 7911480 steps, saw 946157 distinct states, run finished after 30001 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 295 rows 353 cols
[2020-06-03 16:08:37] [INFO ] Computed 60 place invariants in 27 ms
[2020-06-03 16:08:37] [INFO ] [Real]Absence check using 34 positive place invariants in 60 ms returned sat
[2020-06-03 16:08:37] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 129 ms returned sat
[2020-06-03 16:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:39] [INFO ] [Real]Absence check using state equation in 1485 ms returned sat
[2020-06-03 16:08:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:08:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-06-03 16:08:39] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 170 ms returned sat
[2020-06-03 16:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:40] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2020-06-03 16:08:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 16:08:41] [INFO ] [Nat]Added 4 Read/Feed constraints in 302 ms returned sat
[2020-06-03 16:08:41] [INFO ] Deduced a trap composed of 61 places in 75 ms
[2020-06-03 16:08:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2020-06-03 16:08:41] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 34 ms.
[2020-06-03 16:08:45] [INFO ] Added : 269 causal constraints over 55 iterations in 3968 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 16:08:45] [INFO ] [Real]Absence check using 34 positive place invariants in 49 ms returned sat
[2020-06-03 16:08:45] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 111 ms returned sat
[2020-06-03 16:08:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:47] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2020-06-03 16:08:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:08:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-06-03 16:08:48] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 90 ms returned sat
[2020-06-03 16:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:49] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2020-06-03 16:08:50] [INFO ] [Nat]Added 4 Read/Feed constraints in 279 ms returned sat
[2020-06-03 16:08:50] [INFO ] Deduced a trap composed of 61 places in 349 ms
[2020-06-03 16:08:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 458 ms
[2020-06-03 16:08:50] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 140 ms.
[2020-06-03 16:08:53] [INFO ] Added : 170 causal constraints over 35 iterations in 3239 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-06-03 16:08:53] [INFO ] [Real]Absence check using 34 positive place invariants in 38 ms returned sat
[2020-06-03 16:08:54] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 66 ms returned sat
[2020-06-03 16:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:56] [INFO ] [Real]Absence check using state equation in 2843 ms returned sat
[2020-06-03 16:08:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:08:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 83 ms returned sat
[2020-06-03 16:08:57] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 443 ms returned sat
[2020-06-03 16:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:08:59] [INFO ] [Nat]Absence check using state equation in 1400 ms returned sat
[2020-06-03 16:08:59] [INFO ] [Nat]Added 4 Read/Feed constraints in 179 ms returned sat
[2020-06-03 16:08:59] [INFO ] Deduced a trap composed of 61 places in 77 ms
[2020-06-03 16:08:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-06-03 16:08:59] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 32 ms.
[2020-06-03 16:09:03] [INFO ] Added : 260 causal constraints over 52 iterations in 4204 ms. Result :sat
[2020-06-03 16:09:03] [INFO ] Deduced a trap composed of 16 places in 98 ms
[2020-06-03 16:09:04] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-06-03 16:09:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 507 ms
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-03 16:09:04] [INFO ] [Real]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-06-03 16:09:04] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 65 ms returned sat
[2020-06-03 16:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:05] [INFO ] [Real]Absence check using state equation in 1149 ms returned sat
[2020-06-03 16:09:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:09:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 153 ms returned sat
[2020-06-03 16:09:06] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 163 ms returned sat
[2020-06-03 16:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:07] [INFO ] [Nat]Absence check using state equation in 1395 ms returned sat
[2020-06-03 16:09:07] [INFO ] [Nat]Added 4 Read/Feed constraints in 304 ms returned sat
[2020-06-03 16:09:08] [INFO ] Deduced a trap composed of 61 places in 126 ms
[2020-06-03 16:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2020-06-03 16:09:08] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 42 ms.
[2020-06-03 16:09:12] [INFO ] Added : 217 causal constraints over 44 iterations in 4092 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-03 16:09:12] [INFO ] [Real]Absence check using 34 positive place invariants in 35 ms returned sat
[2020-06-03 16:09:12] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 49 ms returned sat
[2020-06-03 16:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:13] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2020-06-03 16:09:13] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:09:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 16:09:13] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 97 ms returned sat
[2020-06-03 16:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:14] [INFO ] [Nat]Absence check using state equation in 1061 ms returned sat
[2020-06-03 16:09:15] [INFO ] [Nat]Added 4 Read/Feed constraints in 79 ms returned sat
[2020-06-03 16:09:15] [INFO ] Deduced a trap composed of 61 places in 52 ms
[2020-06-03 16:09:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2020-06-03 16:09:15] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 36 ms.
[2020-06-03 16:09:17] [INFO ] Added : 218 causal constraints over 44 iterations in 2510 ms. Result :sat
[2020-06-03 16:09:17] [INFO ] Deduced a trap composed of 10 places in 128 ms
[2020-06-03 16:09:18] [INFO ] Deduced a trap composed of 12 places in 168 ms
[2020-06-03 16:09:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
Attempting to minimize the solution found.
Minimization took 28 ms.
[2020-06-03 16:09:18] [INFO ] [Real]Absence check using 34 positive place invariants in 70 ms returned sat
[2020-06-03 16:09:18] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 95 ms returned sat
[2020-06-03 16:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:20] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2020-06-03 16:09:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:09:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 33 ms returned sat
[2020-06-03 16:09:20] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 180 ms returned sat
[2020-06-03 16:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:21] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2020-06-03 16:09:22] [INFO ] [Nat]Added 4 Read/Feed constraints in 436 ms returned sat
[2020-06-03 16:09:22] [INFO ] Deduced a trap composed of 9 places in 180 ms
[2020-06-03 16:09:23] [INFO ] Deduced a trap composed of 61 places in 434 ms
[2020-06-03 16:09:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 732 ms
[2020-06-03 16:09:23] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 31 ms.
[2020-06-03 16:09:25] [INFO ] Added : 178 causal constraints over 36 iterations in 2856 ms. Result :sat
[2020-06-03 16:09:26] [INFO ] Deduced a trap composed of 10 places in 103 ms
[2020-06-03 16:09:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 16:09:26] [INFO ] [Real]Absence check using 34 positive place invariants in 41 ms returned sat
[2020-06-03 16:09:26] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 47 ms returned sat
[2020-06-03 16:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:27] [INFO ] [Real]Absence check using state equation in 874 ms returned sat
[2020-06-03 16:09:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:09:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 37 ms returned sat
[2020-06-03 16:09:27] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 304 ms returned sat
[2020-06-03 16:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:29] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2020-06-03 16:09:29] [INFO ] [Nat]Added 4 Read/Feed constraints in 98 ms returned sat
[2020-06-03 16:09:29] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 42 ms.
[2020-06-03 16:09:33] [INFO ] Added : 280 causal constraints over 56 iterations in 4427 ms. Result :sat
[2020-06-03 16:09:34] [INFO ] Deduced a trap composed of 21 places in 456 ms
[2020-06-03 16:09:34] [INFO ] Deduced a trap composed of 18 places in 408 ms
[2020-06-03 16:09:35] [INFO ] Deduced a trap composed of 17 places in 812 ms
[2020-06-03 16:09:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2013 ms
Attempting to minimize the solution found.
Minimization took 34 ms.
[2020-06-03 16:09:35] [INFO ] [Real]Absence check using 34 positive place invariants in 155 ms returned sat
[2020-06-03 16:09:36] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 51 ms returned sat
[2020-06-03 16:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:37] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2020-06-03 16:09:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:09:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-06-03 16:09:37] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 124 ms returned sat
[2020-06-03 16:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:09:38] [INFO ] [Nat]Absence check using state equation in 1329 ms returned sat
[2020-06-03 16:09:38] [INFO ] [Nat]Added 4 Read/Feed constraints in 173 ms returned sat
[2020-06-03 16:09:39] [INFO ] Deduced a trap composed of 12 places in 253 ms
[2020-06-03 16:09:39] [INFO ] Deduced a trap composed of 61 places in 51 ms
[2020-06-03 16:09:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
[2020-06-03 16:09:39] [INFO ] Computed and/alt/rep : 294/1351/294 causal constraints in 31 ms.
[2020-06-03 16:09:41] [INFO ] Added : 135 causal constraints over 27 iterations in 1855 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 211600 steps, including 4381 resets, run finished after 1053 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 177900 steps, including 3672 resets, run finished after 985 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 224700 steps, including 5105 resets, run finished after 1110 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 258100 steps, including 5438 resets, run finished after 1278 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 222300 steps, including 4703 resets, run finished after 1097 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 277800 steps, including 5853 resets, run finished after 1352 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 102800 steps, including 2167 resets, run finished after 498 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 267800 steps, including 4868 resets, run finished after 1236 ms. (steps per millisecond=216 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 1] could not realise parikh vector
FORMULA DES-PT-60a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-60a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 14 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 295/295 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 294
Applied a total of 1 rules in 75 ms. Remains 353 /353 variables (removed 0) and now considering 294/295 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 294/295 transitions.
Incomplete random walk after 1000000 steps, including 15303 resets, run finished after 4468 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2839 resets, run finished after 2055 ms. (steps per millisecond=486 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2806 resets, run finished after 2092 ms. (steps per millisecond=478 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2795 resets, run finished after 2107 ms. (steps per millisecond=474 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2802 resets, run finished after 2009 ms. (steps per millisecond=497 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2820 resets, run finished after 1955 ms. (steps per millisecond=511 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7935286 steps, run timeout after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 7935286 steps, saw 1042332 distinct states, run finished after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 353 cols
[2020-06-03 16:10:34] [INFO ] Computed 61 place invariants in 20 ms
[2020-06-03 16:10:35] [INFO ] [Real]Absence check using 36 positive place invariants in 122 ms returned sat
[2020-06-03 16:10:35] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 103 ms returned sat
[2020-06-03 16:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:36] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2020-06-03 16:10:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:10:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 33 ms returned sat
[2020-06-03 16:10:36] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 124 ms returned sat
[2020-06-03 16:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:37] [INFO ] [Nat]Absence check using state equation in 939 ms returned sat
[2020-06-03 16:10:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-06-03 16:10:37] [INFO ] [Nat]Added 4 Read/Feed constraints in 252 ms returned sat
[2020-06-03 16:10:38] [INFO ] Deduced a trap composed of 12 places in 184 ms
[2020-06-03 16:10:38] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-06-03 16:10:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2020-06-03 16:10:38] [INFO ] Computed and/alt/rep : 293/1349/293 causal constraints in 93 ms.
[2020-06-03 16:10:43] [INFO ] Added : 275 causal constraints over 56 iterations in 4894 ms. Result :sat
[2020-06-03 16:10:43] [INFO ] Deduced a trap composed of 9 places in 94 ms
[2020-06-03 16:10:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:10:43] [INFO ] [Real]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-06-03 16:10:43] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:44] [INFO ] [Real]Absence check using state equation in 1246 ms returned sat
[2020-06-03 16:10:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:10:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 16:10:45] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 114 ms returned sat
[2020-06-03 16:10:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:45] [INFO ] [Nat]Absence check using state equation in 941 ms returned sat
[2020-06-03 16:10:46] [INFO ] [Nat]Added 4 Read/Feed constraints in 178 ms returned sat
[2020-06-03 16:10:46] [INFO ] Deduced a trap composed of 61 places in 117 ms
[2020-06-03 16:10:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2020-06-03 16:10:46] [INFO ] Computed and/alt/rep : 293/1349/293 causal constraints in 37 ms.
[2020-06-03 16:10:49] [INFO ] Added : 212 causal constraints over 43 iterations in 3356 ms. Result :sat
[2020-06-03 16:10:50] [INFO ] Deduced a trap composed of 9 places in 225 ms
[2020-06-03 16:10:50] [INFO ] Deduced a trap composed of 18 places in 437 ms
[2020-06-03 16:10:50] [INFO ] Deduced a trap composed of 18 places in 259 ms
[2020-06-03 16:10:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1408 ms
Attempting to minimize the solution found.
Minimization took 46 ms.
[2020-06-03 16:10:51] [INFO ] [Real]Absence check using 36 positive place invariants in 35 ms returned sat
[2020-06-03 16:10:51] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 16:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:52] [INFO ] [Real]Absence check using state equation in 1583 ms returned sat
[2020-06-03 16:10:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:10:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:10:53] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 247 ms returned sat
[2020-06-03 16:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:10:55] [INFO ] [Nat]Absence check using state equation in 2017 ms returned sat
[2020-06-03 16:10:55] [INFO ] [Nat]Added 4 Read/Feed constraints in 368 ms returned sat
[2020-06-03 16:10:56] [INFO ] Deduced a trap composed of 61 places in 354 ms
[2020-06-03 16:10:56] [INFO ] Deduced a trap composed of 10 places in 109 ms
[2020-06-03 16:10:56] [INFO ] Deduced a trap composed of 9 places in 101 ms
[2020-06-03 16:10:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 752 ms
[2020-06-03 16:10:56] [INFO ] Computed and/alt/rep : 293/1349/293 causal constraints in 49 ms.
[2020-06-03 16:11:00] [INFO ] Added : 248 causal constraints over 50 iterations in 4329 ms. Result :sat
[2020-06-03 16:11:01] [INFO ] Deduced a trap composed of 13 places in 185 ms
[2020-06-03 16:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:11:01] [INFO ] [Real]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-06-03 16:11:01] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 44 ms returned sat
[2020-06-03 16:11:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:11:02] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2020-06-03 16:11:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:11:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 69 ms returned sat
[2020-06-03 16:11:03] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 88 ms returned sat
[2020-06-03 16:11:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:11:04] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2020-06-03 16:11:04] [INFO ] [Nat]Added 4 Read/Feed constraints in 231 ms returned sat
[2020-06-03 16:11:04] [INFO ] Deduced a trap composed of 61 places in 55 ms
[2020-06-03 16:11:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2020-06-03 16:11:04] [INFO ] Computed and/alt/rep : 293/1349/293 causal constraints in 64 ms.
[2020-06-03 16:11:08] [INFO ] Added : 218 causal constraints over 44 iterations in 3362 ms. Result :sat
[2020-06-03 16:11:08] [INFO ] Deduced a trap composed of 19 places in 169 ms
[2020-06-03 16:11:08] [INFO ] Deduced a trap composed of 12 places in 148 ms
[2020-06-03 16:11:08] [INFO ] Deduced a trap composed of 13 places in 153 ms
[2020-06-03 16:11:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 697 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 16:11:09] [INFO ] [Real]Absence check using 36 positive place invariants in 43 ms returned sat
[2020-06-03 16:11:09] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:11:10] [INFO ] [Real]Absence check using state equation in 926 ms returned sat
[2020-06-03 16:11:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:11:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 45 ms returned sat
[2020-06-03 16:11:10] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:11:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:11:12] [INFO ] [Nat]Absence check using state equation in 1638 ms returned sat
[2020-06-03 16:11:12] [INFO ] [Nat]Added 4 Read/Feed constraints in 21 ms returned sat
[2020-06-03 16:11:12] [INFO ] Computed and/alt/rep : 293/1349/293 causal constraints in 42 ms.
[2020-06-03 16:11:17] [INFO ] Added : 284 causal constraints over 57 iterations in 5750 ms. Result :sat
[2020-06-03 16:11:18] [INFO ] Deduced a trap composed of 9 places in 167 ms
[2020-06-03 16:11:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 301 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 185200 steps, including 2687 resets, run finished after 879 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 258400 steps, including 3858 resets, run finished after 1252 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 275700 steps, including 4089 resets, run finished after 1311 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 244800 steps, including 3606 resets, run finished after 1073 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 269500 steps, including 3965 resets, run finished after 1185 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 353 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 32 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 353/353 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 353/353 places, 294/294 transitions.
Applied a total of 0 rules in 36 ms. Remains 353 /353 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 353 cols
[2020-06-03 16:11:24] [INFO ] Computed 61 place invariants in 17 ms
[2020-06-03 16:11:25] [INFO ] Implicit Places using invariants in 1629 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1634 ms to find 1 implicit places.
[2020-06-03 16:11:25] [INFO ] Redundant transitions in 55 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:11:25] [INFO ] Computed 60 place invariants in 12 ms
[2020-06-03 16:11:27] [INFO ] Dead Transitions using invariants and state equation in 1511 ms returned []
Starting structural reductions, iteration 1 : 352/353 places, 294/294 transitions.
Applied a total of 0 rules in 48 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2020-06-03 16:11:27] [INFO ] Redundant transitions in 23 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:11:27] [INFO ] Computed 60 place invariants in 15 ms
[2020-06-03 16:11:29] [INFO ] Dead Transitions using invariants and state equation in 2212 ms returned []
Finished structural reductions, in 2 iterations. Remains : 352/353 places, 294/294 transitions.
Incomplete random walk after 1000000 steps, including 15265 resets, run finished after 4474 ms. (steps per millisecond=223 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2827 resets, run finished after 1928 ms. (steps per millisecond=518 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2735 resets, run finished after 2060 ms. (steps per millisecond=485 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2772 resets, run finished after 2099 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2783 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2764 resets, run finished after 2079 ms. (steps per millisecond=481 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7908754 steps, run timeout after 30001 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 7908754 steps, saw 1037932 distinct states, run finished after 30012 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:12:14] [INFO ] Computed 60 place invariants in 9 ms
[2020-06-03 16:12:14] [INFO ] [Real]Absence check using 35 positive place invariants in 37 ms returned sat
[2020-06-03 16:12:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 118 ms returned sat
[2020-06-03 16:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:15] [INFO ] [Real]Absence check using state equation in 1334 ms returned sat
[2020-06-03 16:12:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 16:12:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 192 ms returned sat
[2020-06-03 16:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:17] [INFO ] [Nat]Absence check using state equation in 1324 ms returned sat
[2020-06-03 16:12:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:12:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 212 ms returned sat
[2020-06-03 16:12:18] [INFO ] Deduced a trap composed of 76 places in 153 ms
[2020-06-03 16:12:18] [INFO ] Deduced a trap composed of 61 places in 160 ms
[2020-06-03 16:12:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2020-06-03 16:12:18] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 32 ms.
[2020-06-03 16:12:22] [INFO ] Added : 276 causal constraints over 56 iterations in 3743 ms. Result :sat
[2020-06-03 16:12:22] [INFO ] Deduced a trap composed of 15 places in 132 ms
[2020-06-03 16:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
Attempting to minimize the solution found.
Minimization took 40 ms.
[2020-06-03 16:12:22] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:12:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 16:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:24] [INFO ] [Real]Absence check using state equation in 1946 ms returned sat
[2020-06-03 16:12:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:12:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 97 ms returned sat
[2020-06-03 16:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:25] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2020-06-03 16:12:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 158 ms returned sat
[2020-06-03 16:12:26] [INFO ] Deduced a trap composed of 18 places in 406 ms
[2020-06-03 16:12:26] [INFO ] Deduced a trap composed of 16 places in 365 ms
[2020-06-03 16:12:27] [INFO ] Deduced a trap composed of 17 places in 188 ms
[2020-06-03 16:12:27] [INFO ] Deduced a trap composed of 61 places in 256 ms
[2020-06-03 16:12:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1356 ms
[2020-06-03 16:12:27] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 101 ms.
[2020-06-03 16:12:31] [INFO ] Added : 261 causal constraints over 53 iterations in 4412 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-06-03 16:12:32] [INFO ] [Real]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:12:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 16:12:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:33] [INFO ] [Real]Absence check using state equation in 1505 ms returned sat
[2020-06-03 16:12:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 95 ms returned sat
[2020-06-03 16:12:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 155 ms returned sat
[2020-06-03 16:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:35] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2020-06-03 16:12:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 150 ms returned sat
[2020-06-03 16:12:35] [INFO ] Deduced a trap composed of 17 places in 244 ms
[2020-06-03 16:12:35] [INFO ] Deduced a trap composed of 61 places in 80 ms
[2020-06-03 16:12:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 439 ms
[2020-06-03 16:12:35] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 36 ms.
[2020-06-03 16:12:39] [INFO ] Added : 244 causal constraints over 49 iterations in 3643 ms. Result :sat
[2020-06-03 16:12:39] [INFO ] Deduced a trap composed of 12 places in 123 ms
[2020-06-03 16:12:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-06-03 16:12:40] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 16:12:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:41] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2020-06-03 16:12:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:12:41] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 103 ms returned sat
[2020-06-03 16:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:42] [INFO ] [Nat]Absence check using state equation in 1326 ms returned sat
[2020-06-03 16:12:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 338 ms returned sat
[2020-06-03 16:12:43] [INFO ] Deduced a trap composed of 61 places in 74 ms
[2020-06-03 16:12:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2020-06-03 16:12:43] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 36 ms.
[2020-06-03 16:12:46] [INFO ] Added : 218 causal constraints over 44 iterations in 3076 ms. Result :sat
[2020-06-03 16:12:46] [INFO ] Deduced a trap composed of 13 places in 125 ms
[2020-06-03 16:12:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:12:46] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:12:46] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 16:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:47] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2020-06-03 16:12:47] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:12:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:12:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 167 ms returned sat
[2020-06-03 16:12:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:12:49] [INFO ] [Nat]Absence check using state equation in 1269 ms returned sat
[2020-06-03 16:12:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 16:12:49] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 29 ms.
[2020-06-03 16:12:53] [INFO ] Added : 283 causal constraints over 57 iterations in 4569 ms. Result :sat
[2020-06-03 16:12:54] [INFO ] Deduced a trap composed of 18 places in 199 ms
[2020-06-03 16:12:54] [INFO ] Deduced a trap composed of 11 places in 117 ms
[2020-06-03 16:12:54] [INFO ] Deduced a trap composed of 15 places in 72 ms
[2020-06-03 16:12:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 656 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
Incomplete Parikh walk after 180500 steps, including 2767 resets, run finished after 861 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 258200 steps, including 3823 resets, run finished after 1139 ms. (steps per millisecond=226 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 221700 steps, including 3362 resets, run finished after 958 ms. (steps per millisecond=231 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 281300 steps, including 4169 resets, run finished after 1203 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 288100 steps, including 4277 resets, run finished after 1333 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 352 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 36 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Starting structural reductions, iteration 0 : 352/352 places, 294/294 transitions.
Applied a total of 0 rules in 30 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:13:00] [INFO ] Computed 60 place invariants in 11 ms
[2020-06-03 16:13:01] [INFO ] Implicit Places using invariants in 1618 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:13:01] [INFO ] Computed 60 place invariants in 12 ms
[2020-06-03 16:13:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:13:08] [INFO ] Implicit Places using invariants and state equation in 6153 ms returned []
Implicit Place search using SMT with State Equation took 7813 ms to find 0 implicit places.
[2020-06-03 16:13:08] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:13:08] [INFO ] Computed 60 place invariants in 23 ms
[2020-06-03 16:13:09] [INFO ] Dead Transitions using invariants and state equation in 1340 ms returned []
Finished structural reductions, in 1 iterations. Remains : 352/352 places, 294/294 transitions.
Incomplete random walk after 100000 steps, including 1498 resets, run finished after 494 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:13:09] [INFO ] Computed 60 place invariants in 16 ms
[2020-06-03 16:13:10] [INFO ] [Real]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:13:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2020-06-03 16:13:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:11] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2020-06-03 16:13:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 16:13:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2020-06-03 16:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:12] [INFO ] [Nat]Absence check using state equation in 1185 ms returned sat
[2020-06-03 16:13:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-03 16:13:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 265 ms returned sat
[2020-06-03 16:13:12] [INFO ] Deduced a trap composed of 76 places in 140 ms
[2020-06-03 16:13:13] [INFO ] Deduced a trap composed of 61 places in 66 ms
[2020-06-03 16:13:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2020-06-03 16:13:13] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 32 ms.
[2020-06-03 16:13:16] [INFO ] Added : 276 causal constraints over 56 iterations in 3654 ms. Result :sat
[2020-06-03 16:13:16] [INFO ] Deduced a trap composed of 15 places in 130 ms
[2020-06-03 16:13:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2020-06-03 16:13:17] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 16:13:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2020-06-03 16:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:19] [INFO ] [Real]Absence check using state equation in 1953 ms returned sat
[2020-06-03 16:13:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 45 ms returned sat
[2020-06-03 16:13:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 107 ms returned sat
[2020-06-03 16:13:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:20] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2020-06-03 16:13:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 157 ms returned sat
[2020-06-03 16:13:20] [INFO ] Deduced a trap composed of 18 places in 236 ms
[2020-06-03 16:13:21] [INFO ] Deduced a trap composed of 16 places in 232 ms
[2020-06-03 16:13:21] [INFO ] Deduced a trap composed of 17 places in 295 ms
[2020-06-03 16:13:21] [INFO ] Deduced a trap composed of 61 places in 219 ms
[2020-06-03 16:13:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1152 ms
[2020-06-03 16:13:21] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 31 ms.
[2020-06-03 16:13:26] [INFO ] Added : 261 causal constraints over 53 iterations in 4338 ms. Result :sat
[2020-06-03 16:13:26] [INFO ] [Real]Absence check using 35 positive place invariants in 34 ms returned sat
[2020-06-03 16:13:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2020-06-03 16:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:27] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2020-06-03 16:13:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 51 ms returned sat
[2020-06-03 16:13:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2020-06-03 16:13:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:29] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2020-06-03 16:13:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 149 ms returned sat
[2020-06-03 16:13:29] [INFO ] Deduced a trap composed of 17 places in 244 ms
[2020-06-03 16:13:29] [INFO ] Deduced a trap composed of 61 places in 77 ms
[2020-06-03 16:13:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2020-06-03 16:13:29] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 132 ms.
[2020-06-03 16:13:33] [INFO ] Added : 244 causal constraints over 49 iterations in 3903 ms. Result :sat
[2020-06-03 16:13:33] [INFO ] Deduced a trap composed of 12 places in 105 ms
[2020-06-03 16:13:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2020-06-03 16:13:34] [INFO ] [Real]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 16:13:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 45 ms returned sat
[2020-06-03 16:13:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:35] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2020-06-03 16:13:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 78 ms returned sat
[2020-06-03 16:13:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:36] [INFO ] [Nat]Absence check using state equation in 1468 ms returned sat
[2020-06-03 16:13:37] [INFO ] [Nat]Added 2 Read/Feed constraints in 333 ms returned sat
[2020-06-03 16:13:37] [INFO ] Deduced a trap composed of 61 places in 45 ms
[2020-06-03 16:13:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2020-06-03 16:13:37] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 34 ms.
[2020-06-03 16:13:40] [INFO ] Added : 218 causal constraints over 44 iterations in 3147 ms. Result :sat
[2020-06-03 16:13:40] [INFO ] Deduced a trap composed of 13 places in 131 ms
[2020-06-03 16:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-06-03 16:13:40] [INFO ] [Real]Absence check using 35 positive place invariants in 103 ms returned sat
[2020-06-03 16:13:41] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 86 ms returned sat
[2020-06-03 16:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:41] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2020-06-03 16:13:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 39 ms returned sat
[2020-06-03 16:13:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 161 ms returned sat
[2020-06-03 16:13:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:43] [INFO ] [Nat]Absence check using state equation in 1022 ms returned sat
[2020-06-03 16:13:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-06-03 16:13:43] [INFO ] Computed and/alt/rep : 293/1346/293 causal constraints in 30 ms.
[2020-06-03 16:13:47] [INFO ] Added : 283 causal constraints over 57 iterations in 4189 ms. Result :sat
[2020-06-03 16:13:47] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-06-03 16:13:47] [INFO ] Deduced a trap composed of 11 places in 136 ms
[2020-06-03 16:13:47] [INFO ] Deduced a trap composed of 15 places in 67 ms
[2020-06-03 16:13:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 577 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 352 transition count 294
Applied a total of 1 rules in 55 ms. Remains 352 /352 variables (removed 0) and now considering 294/294 (removed 0) transitions.
// Phase 1: matrix 294 rows 352 cols
[2020-06-03 16:13:48] [INFO ] Computed 60 place invariants in 11 ms
[2020-06-03 16:13:48] [INFO ] [Real]Absence check using 35 positive place invariants in 42 ms returned sat
[2020-06-03 16:13:48] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2020-06-03 16:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:49] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2020-06-03 16:13:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 69 ms returned sat
[2020-06-03 16:13:49] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 96 ms returned sat
[2020-06-03 16:13:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:50] [INFO ] [Nat]Absence check using state equation in 1112 ms returned sat
[2020-06-03 16:13:50] [INFO ] Computed and/alt/rep : 293/1345/293 causal constraints in 36 ms.
[2020-06-03 16:13:54] [INFO ] Added : 276 causal constraints over 56 iterations in 3544 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 32 ms.
[2020-06-03 16:13:54] [INFO ] [Real]Absence check using 35 positive place invariants in 41 ms returned sat
[2020-06-03 16:13:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 16:13:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:56] [INFO ] [Real]Absence check using state equation in 2054 ms returned sat
[2020-06-03 16:13:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:13:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 44 ms returned sat
[2020-06-03 16:13:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 175 ms returned sat
[2020-06-03 16:13:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:13:57] [INFO ] [Nat]Absence check using state equation in 1067 ms returned sat
[2020-06-03 16:13:57] [INFO ] Computed and/alt/rep : 293/1345/293 causal constraints in 38 ms.
[2020-06-03 16:14:01] [INFO ] Added : 261 causal constraints over 53 iterations in 3621 ms. Result :sat
[2020-06-03 16:14:01] [INFO ] Deduced a trap composed of 66 places in 57 ms
[2020-06-03 16:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-06-03 16:14:01] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2020-06-03 16:14:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 16:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:03] [INFO ] [Real]Absence check using state equation in 1178 ms returned sat
[2020-06-03 16:14:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 40 ms returned sat
[2020-06-03 16:14:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 138 ms returned sat
[2020-06-03 16:14:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:04] [INFO ] [Nat]Absence check using state equation in 1240 ms returned sat
[2020-06-03 16:14:04] [INFO ] Computed and/alt/rep : 293/1345/293 causal constraints in 31 ms.
[2020-06-03 16:14:08] [INFO ] Added : 242 causal constraints over 49 iterations in 3796 ms. Result :sat
[2020-06-03 16:14:08] [INFO ] Deduced a trap composed of 10 places in 165 ms
[2020-06-03 16:14:08] [INFO ] Deduced a trap composed of 12 places in 133 ms
[2020-06-03 16:14:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 535 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 16:14:09] [INFO ] [Real]Absence check using 35 positive place invariants in 47 ms returned sat
[2020-06-03 16:14:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 49 ms returned sat
[2020-06-03 16:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:10] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2020-06-03 16:14:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 43 ms returned sat
[2020-06-03 16:14:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2020-06-03 16:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:12] [INFO ] [Nat]Absence check using state equation in 1778 ms returned sat
[2020-06-03 16:14:12] [INFO ] Computed and/alt/rep : 293/1345/293 causal constraints in 34 ms.
[2020-06-03 16:14:15] [INFO ] Added : 218 causal constraints over 44 iterations in 3470 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-06-03 16:14:16] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2020-06-03 16:14:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2020-06-03 16:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:17] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2020-06-03 16:14:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 16:14:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 182 ms returned sat
[2020-06-03 16:14:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 276 ms returned sat
[2020-06-03 16:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 16:14:18] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2020-06-03 16:14:18] [INFO ] Computed and/alt/rep : 293/1345/293 causal constraints in 27 ms.
[2020-06-03 16:14:23] [INFO ] Added : 283 causal constraints over 57 iterations in 4435 ms. Result :sat
[2020-06-03 16:14:23] [INFO ] Deduced a trap composed of 9 places in 147 ms
[2020-06-03 16:14:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 273 ms
Attempting to minimize the solution found.
Minimization took 38 ms.
[2020-06-03 16:14:23] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2020-06-03 16:14:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 17 ms.
[2020-06-03 16:14:24] [INFO ] Flatten gal took : 214 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ DES-PT-60a @ 3570 seconds

FORMULA DES-PT-60a-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-60a-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

{
"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:14:24 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": 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 ((((p67 <= 0)) OR ((1 <= p159)))))",
"processed_size": 40,
"rewrites": 2
},
"result":
{
"edges": 101290,
"markings": 79425,
"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": 2,
"problems": 2
},
"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 ((((p128 <= 0)) OR ((1 <= p211)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 1725,
"markings": 1726,
"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": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p28) AND (((p157 <= 0)) OR ((1 <= p260))))))",
"processed_size": 58,
"rewrites": 1
},
"result":
{
"edges": 1598,
"markings": 1599,
"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": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1781
},
"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": 3,
"visible_transitions": 0
},
"processed": "A (G (((((p204 <= 0)) OR ((1 <= p104))) AND (((p18 <= 0)) OR ((1 <= p204))))))",
"processed_size": 80,
"rewrites": 2
},
"result":
{
"edges": 3312,
"markings": 2432,
"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": 3562
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 3,
"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 ((((p72 <= 0)) OR ((1 <= p236)) OR (((1 <= p82)) AND ((p340 <= 0))))))",
"processed_size": 77,
"rewrites": 2
},
"result":
{
"edges": 93286,
"markings": 72485,
"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": 6,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 23128,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : A(G(**)) : E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 1442,
"conflict_clusters": 42,
"places": 352,
"places_significant": 292,
"singleton_clusters": 0,
"transitions": 294
},
"result":
{
"preliminary_value": "no no no yes no ",
"value": "no no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 646/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 352
lola: finding significant places
lola: 352 places, 294 transitions, 292 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: (p159 <= 1)
lola: LP says that atomic proposition is always true: (p236 <= 1)
lola: LP says that atomic proposition is always true: (p340 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p204 <= 1)
lola: LP says that atomic proposition is always true: (p28 <= 1)
lola: LP says that atomic proposition is always true: (p260 <= 1)
lola: LP says that atomic proposition is always true: (p211 <= 1)
lola: A (G ((((p67 <= 0)) OR ((1 <= p159))))) : A (G ((((p72 <= 0)) OR ((1 <= p236)) OR (((1 <= p82)) AND ((p340 <= 0)))))) : A (G (((((p204 <= 0)) OR ((1 <= p104))) AND (((p18 <= 0)) OR ((1 <= p204)))))) : E (F (((1 <= p28) AND (((p157 <= 0)) OR ((1 <= p260)))))) : A (G ((((p128 <= 0)) OR ((1 <= p211)))))
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 ((((p67 <= 0)) OR ((1 <= p159)))))
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 ((((p67 <= 0)) OR ((1 <= p159)))))
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 <= p67)) AND ((p159 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79425 markings, 101290 edges
lola: ========================================
lola: subprocess 1 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p128 <= 0)) OR ((1 <= p211)))))
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 ((((p128 <= 0)) OR ((1 <= p211)))))
lola: processed formula length: 41
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 <= p128)) AND ((p211 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1726 markings, 1725 edges
lola: ========================================
lola: subprocess 2 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p28) AND (((p157 <= 0)) OR ((1 <= p260))))))
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 <= p28) AND (((p157 <= 0)) OR ((1 <= p260))))))
lola: processed formula length: 58
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 <= p28) AND (((p157 <= 0)) OR ((1 <= p260))))
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-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1599 markings, 1598 edges
lola: ========================================
lola: subprocess 3 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((((p204 <= 0)) OR ((1 <= p104))) AND (((p18 <= 0)) OR ((1 <= p204))))))
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 (((((p204 <= 0)) OR ((1 <= p104))) AND (((p18 <= 0)) OR ((1 <= p204))))))
lola: processed formula length: 80
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 <= p204)) AND ((p104 <= 0))) OR (((1 <= p18)) AND ((p204 <= 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
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2432 markings, 3312 edges
lola: ========================================
lola: subprocess 4 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p72 <= 0)) OR ((1 <= p236)) OR (((1 <= p82)) AND ((p340 <= 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 ((((p72 <= 0)) OR ((1 <= p236)) OR (((1 <= p82)) AND ((p340 <= 0))))))
lola: processed formula length: 77
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 <= p72)) AND ((p236 <= 0)) AND (((p82 <= 0)) OR ((1 <= p340))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 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: 72485 markings, 93286 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no
lola:
preliminary result: no no no yes no
lola: memory consumption: 23128 KB
lola: time consumption: 8 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-60a"
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-60a, 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-158987900000326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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