Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r075-tall-162039097600391.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is Dekker-PT-050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r075-tall-162039097600391
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 26 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 26 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 26 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 26 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 10:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 10:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 22 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.5M May 5 16:51 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 Dekker-PT-050-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-050-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620577260713

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-09 16:21:02] [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]
[2021-05-09 16:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:21:02] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2021-05-09 16:21:02] [INFO ] Transformed 250 places.
[2021-05-09 16:21:03] [INFO ] Transformed 2600 transitions.
[2021-05-09 16:21:03] [INFO ] Found NUPN structural information;
[2021-05-09 16:21:03] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 401 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 115 ms.
Working with output stream class java.io.PrintStream
FORMULA Dekker-PT-050-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-050-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 205 ms. (steps per millisecond=48 ) properties seen :[1, 0, 1, 0, 0]
FORMULA Dekker-PT-050-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-050-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0]
[2021-05-09 16:21:03] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2021-05-09 16:21:03] [INFO ] Computed 150 place invariants in 12 ms
[2021-05-09 16:21:03] [INFO ] [Real]Absence check using 100 positive place invariants in 60 ms returned sat
[2021-05-09 16:21:03] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2021-05-09 16:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:03] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2021-05-09 16:21:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:21:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 54 ms returned sat
[2021-05-09 16:21:04] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 29 ms returned sat
[2021-05-09 16:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:04] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-09 16:21:04] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 16:21:04] [INFO ] [Nat]Added 50 Read/Feed constraints in 27 ms returned sat
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 5 places in 112 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 4 places in 64 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 6 places in 42 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 6 places in 71 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:21:04] [INFO ] Deduced a trap composed of 5 places in 41 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 52 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 72 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 89 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 36 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:21:05] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-09 16:21:05] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1212 ms
[2021-05-09 16:21:05] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 52 ms.
[2021-05-09 16:21:05] [INFO ] Added : 51 causal constraints over 11 iterations in 384 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2021-05-09 16:21:06] [INFO ] [Real]Absence check using 100 positive place invariants in 31 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 16 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:06] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 16:21:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:21:06] [INFO ] [Nat]Absence check using 100 positive place invariants in 31 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:06] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Nat]Added 50 Read/Feed constraints in 14 ms returned sat
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 5 places in 35 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 6 places in 27 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 6 places in 23 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-09 16:21:06] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2021-05-09 16:21:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 259 ms
[2021-05-09 16:21:06] [INFO ] [Real]Absence check using 100 positive place invariants in 29 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-09 16:21:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:07] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2021-05-09 16:21:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:21:07] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2021-05-09 16:21:07] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-09 16:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:07] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-09 16:21:07] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 6 places in 46 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 5 places in 37 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:07] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:07] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 513 ms
[2021-05-09 16:21:07] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 57 ms.
[2021-05-09 16:21:08] [INFO ] Added : 51 causal constraints over 11 iterations in 339 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
FORMULA Dekker-PT-050-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 11900 steps, including 98 resets, run finished after 233 ms. (steps per millisecond=51 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11600 steps, including 98 resets, run finished after 203 ms. (steps per millisecond=57 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 180 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 9138 ms. (steps per millisecond=109 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 10830031 steps, run timeout after 30001 ms. (steps per millisecond=360 ) properties seen :[0, 0]
Probabilistic random walk after 10830031 steps, saw 70557 distinct states, run finished after 30001 ms. (steps per millisecond=360 ) properties seen :[0, 0]
[2021-05-09 16:21:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2021-05-09 16:21:51] [INFO ] Computed 150 place invariants in 7 ms
[2021-05-09 16:21:51] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2021-05-09 16:21:51] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2021-05-09 16:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:51] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-09 16:21:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:21:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2021-05-09 16:21:51] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-09 16:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:52] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 16:21:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 16:21:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 5 places in 39 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:21:52] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:21:52] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 554 ms
[2021-05-09 16:21:52] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 42 ms.
[2021-05-09 16:21:52] [INFO ] Added : 51 causal constraints over 11 iterations in 336 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-09 16:21:53] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2021-05-09 16:21:53] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 15 ms returned sat
[2021-05-09 16:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:53] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2021-05-09 16:21:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:21:53] [INFO ] [Nat]Absence check using 100 positive place invariants in 27 ms returned sat
[2021-05-09 16:21:53] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-09 16:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:21:53] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2021-05-09 16:21:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 6 places in 33 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 5 places in 27 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 5 places in 26 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 5 places in 20 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:21:53] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:21:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 438 ms
[2021-05-09 16:21:54] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 39 ms.
[2021-05-09 16:21:54] [INFO ] Added : 51 causal constraints over 11 iterations in 324 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 11900 steps, including 98 resets, run finished after 209 ms. (steps per millisecond=56 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 11600 steps, including 98 resets, run finished after 337 ms. (steps per millisecond=34 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 73 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 69 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 16:21:55] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2021-05-09 16:21:55] [INFO ] Computed 150 place invariants in 4 ms
[2021-05-09 16:21:56] [INFO ] Implicit Places using invariants in 1101 ms returned [100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 178, 181, 184, 187, 190, 193, 196, 199, 202, 205, 208, 211, 214, 217, 220, 226, 229, 235, 238, 241, 244, 247]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1106 ms to find 47 implicit places.
[2021-05-09 16:21:56] [INFO ] Redundant transitions in 251 ms returned []
[2021-05-09 16:21:56] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:21:56] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:21:58] [INFO ] Dead Transitions using invariants and state equation in 2200 ms returned []
Starting structural reductions, iteration 1 : 203/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 60 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 16:21:58] [INFO ] Redundant transitions in 67 ms returned []
[2021-05-09 16:21:58] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:21:58] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:22:00] [INFO ] Dead Transitions using invariants and state equation in 2065 ms returned []
Finished structural reductions, in 2 iterations. Remains : 203/250 places, 2600/2600 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 9492 ms. (steps per millisecond=105 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1620 ms. (steps per millisecond=617 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 13456544 steps, run timeout after 30001 ms. (steps per millisecond=448 ) properties seen :[0, 0]
Probabilistic random walk after 13456544 steps, saw 91343 distinct states, run finished after 30001 ms. (steps per millisecond=448 ) properties seen :[0, 0]
[2021-05-09 16:22:43] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:22:43] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:22:43] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:43] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:43] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2021-05-09 16:22:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:22:43] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:43] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:43] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-09 16:22:43] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 16:22:43] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 59 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 33 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 38 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 31 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2021-05-09 16:22:44] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-09 16:22:45] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:45] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 1500 ms
[2021-05-09 16:22:45] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 37 ms.
[2021-05-09 16:22:45] [INFO ] Added : 51 causal constraints over 11 iterations in 295 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2021-05-09 16:22:45] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:45] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:45] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 16:22:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:22:46] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:46] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:46] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-09 16:22:46] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:46] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-09 16:22:46] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 635 ms
[2021-05-09 16:22:46] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 36 ms.
[2021-05-09 16:22:47] [INFO ] Added : 51 causal constraints over 11 iterations in 293 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 12600 steps, including 98 resets, run finished after 212 ms. (steps per millisecond=59 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 12900 steps, including 98 resets, run finished after 204 ms. (steps per millisecond=63 ) properties seen :[0, 0] could not realise parikh vector
Support contains 8 out of 203 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 52 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Starting structural reductions, iteration 0 : 203/203 places, 2600/2600 transitions.
Applied a total of 0 rules in 120 ms. Remains 203 /203 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
[2021-05-09 16:22:47] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:22:47] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:22:48] [INFO ] Implicit Places using invariants in 478 ms returned []
[2021-05-09 16:22:48] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:22:48] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:22:48] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 16:22:48] [INFO ] Implicit Places using invariants and state equation in 730 ms returned []
Implicit Place search using SMT with State Equation took 1209 ms to find 0 implicit places.
[2021-05-09 16:22:49] [INFO ] Redundant transitions in 151 ms returned []
[2021-05-09 16:22:49] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:22:49] [INFO ] Computed 103 place invariants in 0 ms
[2021-05-09 16:22:51] [INFO ] Dead Transitions using invariants and state equation in 1980 ms returned []
Finished structural reductions, in 1 iterations. Remains : 203/203 places, 2600/2600 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 959 ms. (steps per millisecond=104 ) properties seen :[0, 0]
[2021-05-09 16:22:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 203 cols
[2021-05-09 16:22:51] [INFO ] Computed 103 place invariants in 1 ms
[2021-05-09 16:22:52] [INFO ] [Real]Absence check using 100 positive place invariants in 26 ms returned sat
[2021-05-09 16:22:52] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:52] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-09 16:22:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:22:52] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:52] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:52] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-09 16:22:52] [INFO ] State equation strengthened by 50 read => feed constraints.
[2021-05-09 16:22:52] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 39 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 36 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 34 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 5 places in 23 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2021-05-09 16:22:52] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 5 places in 14 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 5 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:53] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:53] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 1358 ms
[2021-05-09 16:22:53] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 52 ms.
[2021-05-09 16:22:54] [INFO ] Added : 51 causal constraints over 11 iterations in 309 ms. Result :sat
[2021-05-09 16:22:54] [INFO ] [Real]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:54] [INFO ] [Real]Absence check using 100 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-09 16:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:54] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-09 16:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:22:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2021-05-09 16:22:54] [INFO ] [Nat]Absence check using 100 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-09 16:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:54] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-09 16:22:54] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 40 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 37 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 35 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 16 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 5 places in 17 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 11 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2021-05-09 16:22:54] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:55] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2021-05-09 16:22:55] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 626 ms
[2021-05-09 16:22:55] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 39 ms.
[2021-05-09 16:22:55] [INFO ] Added : 51 causal constraints over 11 iterations in 299 ms. Result :sat
Discarding 168 places :
Also discarding 2184 output transitions
Drop transitions removed 2184 transitions
Graph (complete) has 315 edges and 203 vertex of which 35 are kept as prefixes of interest. Removing 168 places using SCC suffix rule.7 ms
Ensure Unique test removed 3 places
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 387 rules applied. Total rules applied 388 place count 32 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 394 place count 28 transition count 30
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 396 place count 28 transition count 28
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 400 place count 28 transition count 24
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 412 place count 20 transition count 20
Applied a total of 412 rules in 18 ms. Remains 20 /203 variables (removed 183) and now considering 20/2600 (removed 2580) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-09 16:22:55] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-09 16:22:55] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-09 16:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 16:22:55] [INFO ] Computed and/alt/rep : 12/16/12 causal constraints in 1 ms.
[2021-05-09 16:22:55] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-09 16:22:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-09 16:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:55] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-09 16:22:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:22:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-09 16:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:22:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-09 16:22:55] [INFO ] Computed and/alt/rep : 12/16/12 causal constraints in 1 ms.
[2021-05-09 16:22:55] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-09 16:22:55] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2021-05-09 16:22:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 25 ms.
[2021-05-09 16:22:55] [INFO ] Flatten gal took : 244 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ Dekker-PT-050 @ 3570 seconds

FORMULA Dekker-PT-050-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Dekker-PT-050-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ Dekker-PT-050

{
"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": "Sun May 9 16:22:56 2021
",
"timelimit": 3570
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3567
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 6,
"adisj": 1,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p13 <= 0)) OR ((1 <= p148)) OR ((p187 <= 0)) OR ((1 <= p183)) OR ((p120 <= 0)) OR ((1 <= p190)))))",
"processed_size": 112,
"rewrites": 2
},
"result":
{
"produced_by": "state equation",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 79032,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 17703,
"conflict_clusters": 1,
"places": 203,
"places_significant": 100,
"singleton_clusters": 0,
"transitions": 2600
},
"result":
{
"preliminary_value": "yes no ",
"value": "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: 2803/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 203
lola: finding significant places
lola: 203 places, 2600 transitions, 100 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: (p150 <= 1)
lola: LP says that atomic proposition is always true: (p148 <= 1)
lola: LP says that atomic proposition is always true: (p183 <= 1)
lola: LP says that atomic proposition is always true: (p190 <= 1)
lola: E (F ((((1 <= p119)) AND ((p150 <= 0))))) : A (G ((((p13 <= 0)) OR ((1 <= p148)) OR ((p187 <= 0)) OR ((1 <= p183)) OR ((p120 <= 0)) OR ((1 <= p190)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p119)) AND ((p150 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p119)) AND ((p150 <= 0)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p119)) AND ((p150 <= 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p13 <= 0)) OR ((1 <= p148)) OR ((p187 <= 0)) OR ((1 <= p183)) OR ((p120 <= 0)) OR ((1 <= p190)))))
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 ((((p13 <= 0)) OR ((1 <= p148)) OR ((p187 <= 0)) OR ((1 <= p183)) OR ((p120 <= 0)) OR ((1 <= p190)))))
lola: processed formula length: 112
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 <= p13)) AND ((p148 <= 0)) AND ((1 <= p187)) AND ((p183 <= 0)) AND ((1 <= p120)) AND ((p190 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 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: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no
lola:
preliminary result: yes no
lola: memory consumption: 79032 KB
lola: time consumption: 3 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="Dekker-PT-050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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 gold2020"
echo " Input is Dekker-PT-050, 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 r075-tall-162039097600391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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