About the Execution of 2020-gold for MAPK-PT-02560
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4667.644 | 3600000.00 | 154384.00 | 4906.30 | FFFFFFFFFFTTFFTF | normal |
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.r132-tall-162075428600383.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 MAPK-PT-02560, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-162075428600383
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-02560-ReachabilityCardinality-00
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-01
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-02
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-03
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-04
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-05
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-06
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-07
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-08
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-09
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-10
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-11
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-12
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-13
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-14
FORMULA_NAME MAPK-PT-02560-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1620936850368
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 20:14:11] [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-13 20:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 20:14:11] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 20:14:11] [INFO ] Transformed 22 places.
[2021-05-13 20:14:11] [INFO ] Transformed 30 transitions.
[2021-05-13 20:14:11] [INFO ] Parsed PT model containing 22 places and 30 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10256 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=788 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
FORMULA MAPK-PT-02560-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MAPK-PT-02560-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA MAPK-PT-02560-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MAPK-PT-02560-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA MAPK-PT-02560-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:14:12] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 5 ms.
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:14:12] [INFO ] Added : 26 causal constraints over 6 iterations in 32 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:14:12] [INFO ] Added : 25 causal constraints over 5 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:12] [INFO ] Added : 25 causal constraints over 5 iterations in 25 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:12] [INFO ] Added : 26 causal constraints over 7 iterations in 24 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:12] [INFO ] Added : 25 causal constraints over 5 iterations in 18 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:14:12] [INFO ] Added : 25 causal constraints over 5 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:14:12] [INFO ] Added : 26 causal constraints over 6 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-13 20:14:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:12] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:12] [INFO ] Added : 24 causal constraints over 5 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:14:13] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:14:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:13] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:13] [INFO ] Added : 25 causal constraints over 5 iterations in 22 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:14:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:13] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:14:13] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:13] [INFO ] Added : 26 causal constraints over 7 iterations in 26 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
FORMULA MAPK-PT-02560-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 386200 steps, including 1000 resets, run finished after 837 ms. (steps per millisecond=461 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA MAPK-PT-02560-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 834000 steps, including 1000 resets, run finished after 1737 ms. (steps per millisecond=480 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 1] could not realise parikh vector
FORMULA MAPK-PT-02560-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1409500 steps, including 148 resets, run finished after 2799 ms. (steps per millisecond=503 ) properties seen :[1, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA MAPK-PT-02560-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 4900 steps, including 332 resets, run finished after 12 ms. (steps per millisecond=408 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 962700 steps, including 114 resets, run finished after 1825 ms. (steps per millisecond=527 ) properties seen :[0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA MAPK-PT-02560-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1217400 steps, including 1000 resets, run finished after 2232 ms. (steps per millisecond=545 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 387000 steps, including 1000 resets, run finished after 723 ms. (steps per millisecond=535 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1025300 steps, including 112 resets, run finished after 1773 ms. (steps per millisecond=578 ) properties seen :[0, 1, 0, 0, 0] could not realise parikh vector
FORMULA MAPK-PT-02560-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 1665200 steps, including 198 resets, run finished after 2818 ms. (steps per millisecond=590 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1091000 steps, including 121 resets, run finished after 1972 ms. (steps per millisecond=553 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 14 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 12 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Incomplete random walk after 1000909 steps, including 0 resets, run finished after 231 ms. (steps per millisecond=4332 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties seen :[0, 1, 0, 0]
FORMULA MAPK-PT-02560-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties seen :[0, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:14:32] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:14:32] [INFO ] Added : 25 causal constraints over 5 iterations in 16 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 20:14:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 3 ms.
[2021-05-13 20:14:32] [INFO ] Added : 25 causal constraints over 5 iterations in 20 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:14:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:14:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:14:32] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:14:32] [INFO ] Added : 24 causal constraints over 5 iterations in 16 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 1409500 steps, including 148 resets, run finished after 2335 ms. (steps per millisecond=603 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 962700 steps, including 114 resets, run finished after 1609 ms. (steps per millisecond=598 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1665200 steps, including 193 resets, run finished after 2705 ms. (steps per millisecond=615 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Incomplete random walk after 1000398 steps, including 0 resets, run finished after 188 ms. (steps per millisecond=5321 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 516 ms. (steps per millisecond=1937 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 524 ms. (steps per millisecond=1908 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 25332684 steps, run timeout after 30001 ms. (steps per millisecond=844 ) properties seen :[0, 0, 0]
Probabilistic random walk after 25332684 steps, saw 2103055 distinct states, run finished after 30001 ms. (steps per millisecond=844 ) properties seen :[0, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:10] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2021-05-13 20:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 20:15:10] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:10] [INFO ] Added : 25 causal constraints over 5 iterations in 39 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-13 20:15:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:10] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:10] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:10] [INFO ] Added : 25 causal constraints over 5 iterations in 19 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-13 20:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:10] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 20:15:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:11] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:11] [INFO ] Added : 24 causal constraints over 5 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 1409500 steps, including 148 resets, run finished after 2571 ms. (steps per millisecond=548 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 962700 steps, including 114 resets, run finished after 1762 ms. (steps per millisecond=546 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 1665200 steps, including 193 resets, run finished after 3013 ms. (steps per millisecond=552 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 13 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:18] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 20:15:18] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:18] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 20:15:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-13 20:15:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:18] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 20:15:18] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Incomplete random walk after 100022 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=4762 ) properties seen :[0, 0, 0]
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:18] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:18] [INFO ] Added : 25 causal constraints over 5 iterations in 16 ms. Result :sat
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:18] [INFO ] Added : 25 causal constraints over 5 iterations in 17 ms. Result :sat
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:15:18] [INFO ] Added : 24 causal constraints over 5 iterations in 16 ms. Result :sat
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 20:15:18] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:18] [INFO ] Added : 25 causal constraints over 5 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 1 ms.
[2021-05-13 20:15:18] [INFO ] Added : 25 causal constraints over 5 iterations in 17 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 20:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 20:15:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 20:15:18] [INFO ] Computed and/alt/rep : 29/74/29 causal constraints in 2 ms.
[2021-05-13 20:15:18] [INFO ] Added : 24 causal constraints over 5 iterations in 24 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-13 20:15:18] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 1 ms.
[2021-05-13 20:15:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2021-05-13 20:15:19] [INFO ] Flatten gal took : 22 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ MAPK-PT-02560 @ 3570 seconds
FORMULA MAPK-PT-02560-ReachabilityCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA MAPK-PT-02560-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3534
rslt: Output for ReachabilityCardinality @ MAPK-PT-02560
{
"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",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 13 20:15:21 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1189
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"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": 5,
"visible_transitions": 0
},
"processed": "A (G (((p17 <= p8) OR (p11 <= p12) OR (1 <= p2) OR (2 <= p8))))",
"processed_size": 66,
"rewrites": 2
},
"result":
{
"edges": 25975467,
"markings": 13100210,
"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": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1775
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((p2 <= 2) AND (p9 + 1 <= p18) AND (p16 <= 2) AND (p1 <= 1))))",
"processed_size": 68,
"rewrites": 1
},
"result":
{
"edges": 14958595,
"markings": 9342008,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3536
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (G (((p21 + 1 <= p9) OR (p17 <= p7) OR (p13 + 1 <= p2) OR (p6 <= 2))))",
"processed_size": 75,
"rewrites": 2
},
"result":
{
"edges": 72745,
"markings": 50304,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 18000,
"runtime": 36.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 90,
"conflict_clusters": 12,
"places": 22,
"places_significant": 15,
"singleton_clusters": 0,
"transitions": 30
},
"result":
{
"preliminary_value": "no no yes ",
"value": "no no yes "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 52/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 30 transitions, 15 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: A (G (((p21 + 1 <= p9) OR (p17 <= p7) OR (p13 + 1 <= p2) OR (p6 <= 2)))) : A (G (((p17 <= p8) OR (p11 <= p12) OR (1 <= p2) OR (2 <= p8)))) : E (F (((p2 <= 2) AND (p9 + 1 <= p18) AND (p16 <= 2) AND (p1 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p17 <= p8) OR (p11 <= p12) OR (1 <= p2) OR (2 <= p8))))
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 (((p17 <= p8) OR (p11 <= p12) OR (1 <= p2) OR (2 <= p8))))
lola: processed formula length: 66
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: ((p8 + 1 <= p17) AND (p12 + 1 <= p11) AND (p2 <= 0) AND (p8 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 3961841 markings, 7133281 edges, 792368 markings/sec, 0 secs
lola: sara is running 5 secs || 7539857 markings, 14511496 edges, 715603 markings/sec, 5 secs
lola: sara is running 10 secs || 11196990 markings, 22049170 edges, 731427 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13100210 markings, 25975467 edges
lola: ========================================
lola: subprocess 1 will run for 1775 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p2 <= 2) AND (p9 + 1 <= p18) AND (p16 <= 2) AND (p1 <= 1))))
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 (((p2 <= 2) AND (p9 + 1 <= p18) AND (p16 <= 2) AND (p1 <= 1))))
lola: processed formula length: 68
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: ((p2 <= 2) AND (p9 + 1 <= p18) AND (p16 <= 2) AND (p1 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 3652092 markings, 5849790 edges, 730418 markings/sec, 0 secs
lola: sara is running 5 secs || 6980264 markings, 11175162 edges, 665634 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9342008 markings, 14958595 edges
lola: ========================================
lola: subprocess 2 will run for 3536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p21 + 1 <= p9) OR (p17 <= p7) OR (p13 + 1 <= p2) OR (p6 <= 2))))
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 (((p21 + 1 <= p9) OR (p17 <= p7) OR (p13 + 1 <= p2) OR (p6 <= 2))))
lola: processed formula length: 75
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: ((p9 <= p21) AND (p7 + 1 <= p17) AND (p2 <= p13) AND (3 <= p6))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-2-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 50304 markings, 72745 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes
lola:
preliminary result: no no yes
lola: memory consumption: 18000 KB
lola: time consumption: 36 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="MAPK-PT-02560"
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 MAPK-PT-02560, 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 r132-tall-162075428600383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-02560.tgz
mv MAPK-PT-02560 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 '
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 ;