About the Execution of 2020-gold for GPPP-PT-C0100N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4277.287 | 3600000.00 | 1004247.00 | 1742.10 | FTFTFFTTTTTFTFFF | 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.r113-smll-162075355700120.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is GPPP-PT-C0100N0000000010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r113-smll-162075355700120
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K 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.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 28 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 22 19:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 19:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000010-ReachabilityFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000010-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1620952768436
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 00:39:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-14 00:39:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 00:39:31] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-14 00:39:31] [INFO ] Transformed 33 places.
[2021-05-14 00:39:31] [INFO ] Transformed 22 transitions.
[2021-05-14 00:39:31] [INFO ] Parsed PT model containing 33 places and 22 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10002 steps, including 22 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0]
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[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]
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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:39:32] [INFO ] Computed 12 place invariants in 19 ms
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive place invariants in 26 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned unsat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using state equation in 68 ms returned unsat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:32] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 00:39:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:39:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 18 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2021-05-14 00:39:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:37] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:39:37] [INFO ] [Nat]Absence check using state equation in 4943 ms returned unknown
[2021-05-14 00:39:37] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned unsat
[2021-05-14 00:39:37] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 00:39:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:39:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:37] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 00:39:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:39:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:39:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:39:42] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4986 ms returned unknown
[2021-05-14 00:39:42] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-14 00:39:42] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:42] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 00:39:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:39:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:39:47] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:39:47] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4988 ms returned unknown
[2021-05-14 00:39:47] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-14 00:39:47] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-14 00:39:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:47] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-14 00:39:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:39:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:39:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:39:52] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4992 ms returned (error "Failed to check-sat")
[2021-05-14 00:39:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:39:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 22 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:39:52] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 00:39:52] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Incomplete random walk after 1000017 steps, including 2315 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 546 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 648 resets, run finished after 1124 ms. (steps per millisecond=889 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 816 ms. (steps per millisecond=1225 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 27194075 steps, run timeout after 30001 ms. (steps per millisecond=906 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 27194075 steps, saw 3722213 distinct states, run finished after 30004 ms. (steps per millisecond=906 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:40:27] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-14 00:40:27] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:40:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-14 00:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:40:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 00:40:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:40:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 10 ms returned sat
[2021-05-14 00:40:27] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:40:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:40:37] [INFO ] [Nat]Absence check using state equation in 9050 ms returned unknown
[2021-05-14 00:40:37] [INFO ] [Real]Absence check using 6 positive place invariants in 20 ms returned sat
[2021-05-14 00:40:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:40:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2021-05-14 00:40:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:40:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:40:43] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:40:46] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9135 ms returned unknown
[2021-05-14 00:40:46] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:40:46] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-14 00:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:40:46] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 00:40:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:40:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 00:40:52] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:40:55] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9038 ms returned unknown
[2021-05-14 00:40:55] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2021-05-14 00:40:55] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 8 ms returned sat
[2021-05-14 00:40:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:40:55] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-14 00:40:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:40:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-14 00:41:01] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:41:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9028 ms returned unknown
Support contains 23 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:41:04] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 00:41:04] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-14 00:41:04] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-14 00:41:04] [INFO ] Implicit Places using invariants and state equation in 88 ms returned [25]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 145 ms to find 1 implicit places.
[2021-05-14 00:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:41:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:41:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2021-05-14 00:41:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:41:04] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:41:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
Incomplete random walk after 1000000 steps, including 2308 resets, run finished after 672 ms. (steps per millisecond=1488 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 553 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 651 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 26473708 steps, run timeout after 30001 ms. (steps per millisecond=882 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 26473708 steps, saw 3627980 distinct states, run finished after 30002 ms. (steps per millisecond=882 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:41:38] [INFO ] Computed 11 place invariants in 7 ms
[2021-05-14 00:41:38] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:41:38] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 00:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:41:39] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 00:41:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:41:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:41:42] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:41:45] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6096 ms returned unknown
[2021-05-14 00:41:45] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:41:45] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 00:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:41:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 00:41:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:41:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-14 00:41:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:41:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6011 ms returned unknown
[2021-05-14 00:41:51] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:41:51] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 00:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:41:51] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 00:41:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:41:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:41:51] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 13 ms returned sat
[2021-05-14 00:41:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:41:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:42:00] [INFO ] [Nat]Absence check using state equation in 9023 ms returned unknown
[2021-05-14 00:42:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 00:42:00] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 00:42:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:42:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 00:42:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:42:04] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 4318 ms returned sat
[2021-05-14 00:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:04] [INFO ] [Nat]Absence check using state equation in 135 ms returned unsat
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 19 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 22/22 transitions.
Incomplete random walk after 1000038 steps, including 2313 resets, run finished after 598 ms. (steps per millisecond=1672 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 555 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 653 resets, run finished after 658 ms. (steps per millisecond=1519 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 28076108 steps, run timeout after 30001 ms. (steps per millisecond=935 ) properties seen :[0, 0, 0]
Probabilistic random walk after 28076108 steps, saw 3831971 distinct states, run finished after 30001 ms. (steps per millisecond=935 ) properties seen :[0, 0, 0]
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:42:37] [INFO ] Computed 11 place invariants in 3 ms
[2021-05-14 00:42:37] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:42:37] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 5 ms returned sat
[2021-05-14 00:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:37] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-14 00:42:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:42:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-14 00:42:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:42:43] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6087 ms returned unknown
[2021-05-14 00:42:43] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 00:42:43] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 00:42:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-14 00:42:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:42:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-14 00:42:46] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:42:49] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6009 ms returned unknown
[2021-05-14 00:42:49] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:42:49] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-14 00:42:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:42:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:42:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 13 ms returned sat
[2021-05-14 00:42:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:56] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:42:59] [INFO ] [Nat]Absence check using state equation in 9022 ms returned unknown
Support contains 19 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 22/22 transitions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:42:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:42:59] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:42:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:42:59] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2021-05-14 00:42:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:42:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:42:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 22/22 transitions.
Incomplete random walk after 100000 steps, including 229 resets, run finished after 62 ms. (steps per millisecond=1612 ) properties seen :[0, 0, 0]
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:42:59] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:42:59] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 00:42:59] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:42:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:42:59] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 00:42:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:42:59] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:43:02] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:05] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6117 ms returned unknown
[2021-05-14 00:43:05] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 00:43:05] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:43:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:05] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 00:43:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:43:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:43:08] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:11] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6011 ms returned unknown
[2021-05-14 00:43:11] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 00:43:11] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-14 00:43:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:43:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:43:11] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 13 ms returned sat
[2021-05-14 00:43:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:17] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:20] [INFO ] [Nat]Absence check using state equation in 9029 ms returned unknown
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-14 00:43:20] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 00:43:20] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-14 00:43:20] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 00:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:20] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-14 00:43:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:43:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-14 00:43:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:26] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6172 ms returned unknown
[2021-05-14 00:43:26] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 00:43:26] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 00:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:26] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-14 00:43:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:43:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:43:30] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 6009 ms returned unknown
[2021-05-14 00:43:33] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 00:43:33] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 00:43:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:33] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 00:43:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 00:43:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-14 00:43:33] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 14 ms returned sat
[2021-05-14 00:43:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 00:43:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-14 00:43:42] [INFO ] [Nat]Absence check using state equation in 9030 ms returned unknown
[2021-05-14 00:43:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2021-05-14 00:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
[2021-05-14 00:43:42] [INFO ] Flatten gal took : 31 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ GPPP-PT-C0100N0000000010 @ 3570 seconds
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA GPPP-PT-C0100N0000000010-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3155
rslt: Output for ReachabilityFireability @ GPPP-PT-C0100N0000000010
{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri May 14 00:43:43 2021
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1158
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"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": "E (F (((1 <= p18) AND (1 <= p19) AND (1 <= p8) AND (200 <= p28) AND ((p1 <= 0) OR (p25 <= 0)))))",
"processed_size": 97,
"rewrites": 1
},
"result":
{
"edges": 225603910,
"markings": 51112691,
"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": 10,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1627
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p15) AND (300 <= p26) AND (((1 <= p21) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p23)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p21))))))",
"processed_size": 149,
"rewrites": 1
},
"result":
{
"edges": 52029344,
"markings": 22832335,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 13,
"problems": 3
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3205
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G (((p19 <= 0) OR (p22 <= 0) OR (p12 <= 0) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p6)))))",
"processed_size": 140,
"rewrites": 2
},
"result":
{
"edges": 49515145,
"markings": 20738487,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 20948,
"runtime": 415.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 81,
"conflict_clusters": 14,
"places": 32,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 22
},
"result":
{
"preliminary_value": "yes no no ",
"value": "yes no 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: 54/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1024
lola: finding significant places
lola: 32 places, 22 transitions, 21 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 ReachabilityFireability.xml
lola: A (G (((p19 <= 0) OR (p22 <= 0) OR (p12 <= 0) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p6))))) : E (F (((1 <= p15) AND (300 <= p26) AND (((1 <= p21) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p23)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p21)))))) : E (F (((1 <= p18) AND (1 <= p19) AND (1 <= p8) AND (200 <= p28) AND ((p1 <= 0) OR (p25 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1158 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p18) AND (1 <= p19) AND (1 <= p8) AND (200 <= p28) AND ((p1 <= 0) OR (p25 <= 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 <= p18) AND (1 <= p19) AND (1 <= p8) AND (200 <= p28) AND ((p1 <= 0) OR (p25 <= 0)))))
lola: processed formula length: 97
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p18) AND (1 <= p19) AND (1 <= p8) AND (200 <= p28) AND ((p1 <= 0) OR (p25 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 1449413 markings, 5384872 edges, 289883 markings/sec, 0 secs
lola: sara is running 5 secs || 2792422 markings, 10827746 edges, 268602 markings/sec, 5 secs
lola: sara is running 10 secs || 4071654 markings, 16129452 edges, 255846 markings/sec, 10 secs
lola: sara is running 15 secs || 5342072 markings, 21591803 edges, 254084 markings/sec, 15 secs
lola: sara is running 20 secs || 6660144 markings, 27050829 edges, 263614 markings/sec, 20 secs
lola: sara is running 25 secs || 7906464 markings, 32452121 edges, 249264 markings/sec, 25 secs
lola: sara is running 30 secs || 9149936 markings, 37822562 edges, 248694 markings/sec, 30 secs
lola: sara is running 35 secs || 10397724 markings, 43185640 edges, 249558 markings/sec, 35 secs
lola: sara is running 40 secs || 11619409 markings, 48506559 edges, 244337 markings/sec, 40 secs
lola: sara is running 45 secs || 12771009 markings, 53811002 edges, 230320 markings/sec, 45 secs
lola: sara is running 50 secs || 13970047 markings, 59031667 edges, 239808 markings/sec, 50 secs
lola: sara is running 55 secs || 15243384 markings, 64314185 edges, 254667 markings/sec, 55 secs
lola: sara is running 60 secs || 16366185 markings, 69574506 edges, 224560 markings/sec, 60 secs
lola: sara is running 65 secs || 17563822 markings, 74747580 edges, 239527 markings/sec, 65 secs
lola: sara is running 70 secs || 18767859 markings, 79976511 edges, 240807 markings/sec, 70 secs
lola: sara is running 75 secs || 19898651 markings, 85215979 edges, 226158 markings/sec, 75 secs
lola: sara is running 80 secs || 21178326 markings, 90436325 edges, 255935 markings/sec, 80 secs
lola: sara is running 85 secs || 22196336 markings, 95579902 edges, 203602 markings/sec, 85 secs
lola: sara is running 90 secs || 23484694 markings, 100774542 edges, 257672 markings/sec, 90 secs
lola: sara is running 95 secs || 24537786 markings, 105901727 edges, 210618 markings/sec, 95 secs
lola: sara is running 100 secs || 25766444 markings, 111082465 edges, 245732 markings/sec, 100 secs
lola: sara is running 105 secs || 26847085 markings, 116212561 edges, 216128 markings/sec, 105 secs
lola: sara is running 110 secs || 28022763 markings, 121374428 edges, 235136 markings/sec, 110 secs
lola: sara is running 115 secs || 29164869 markings, 126483433 edges, 228421 markings/sec, 115 secs
lola: sara is running 120 secs || 30283027 markings, 131675931 edges, 223632 markings/sec, 120 secs
lola: sara is running 125 secs || 31490298 markings, 136748464 edges, 241454 markings/sec, 125 secs
lola: sara is running 130 secs || 32477810 markings, 141879491 edges, 197502 markings/sec, 130 secs
lola: sara is running 135 secs || 33778028 markings, 146933857 edges, 260044 markings/sec, 135 secs
lola: sara is running 140 secs || 34780279 markings, 152015367 edges, 200450 markings/sec, 140 secs
lola: sara is running 145 secs || 35947311 markings, 157090238 edges, 233406 markings/sec, 145 secs
lola: sara is running 150 secs || 37081026 markings, 162174361 edges, 226743 markings/sec, 150 secs
lola: sara is running 155 secs || 38140782 markings, 167290198 edges, 211951 markings/sec, 155 secs
lola: sara is running 160 secs || 39366006 markings, 172306346 edges, 245045 markings/sec, 160 secs
lola: sara is running 165 secs || 40343562 markings, 177333345 edges, 195511 markings/sec, 165 secs
lola: sara is running 170 secs || 41564492 markings, 182370800 edges, 244186 markings/sec, 170 secs
lola: sara is running 175 secs || 42643192 markings, 187395675 edges, 215740 markings/sec, 175 secs
lola: sara is running 180 secs || 43705073 markings, 192458858 edges, 212376 markings/sec, 180 secs
lola: sara is running 185 secs || 44911342 markings, 197395041 edges, 241254 markings/sec, 185 secs
lola: sara is running 190 secs || 45864610 markings, 202281428 edges, 190654 markings/sec, 190 secs
lola: sara is running 195 secs || 46975888 markings, 207045581 edges, 222256 markings/sec, 195 secs
lola: sara is running 200 secs || 48062619 markings, 211835869 edges, 217346 markings/sec, 200 secs
lola: sara is running 205 secs || 48917154 markings, 216219708 edges, 170907 markings/sec, 205 secs
lola: sara is running 210 secs || 50067802 markings, 220896968 edges, 230130 markings/sec, 210 secs
lola: sara is running 215 secs || 51106821 markings, 225585436 edges, 207804 markings/sec, 215 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 51112691 markings, 225603910 edges
lola: ========================================
lola: subprocess 1 will run for 1627 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p15) AND (300 <= p26) AND (((1 <= p21) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p23)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p21))))))
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 <= p15) AND (300 <= p26) AND (((1 <= p21) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p23)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p21))))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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 <= p15) AND (300 <= p26) AND (((1 <= p21) AND (1 <= p16)) OR ((1 <= p3) AND (1 <= p23)) OR ((1 <= p19) AND (1 <= p22) AND (1 <= p21))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 2613394 markings, 5552327 edges, 522679 markings/sec, 0 secs
lola: sara is running 5 secs || 4910292 markings, 10751400 edges, 459380 markings/sec, 5 secs
lola: sara is running 10 secs || 7147527 markings, 15951289 edges, 447447 markings/sec, 10 secs
lola: sara is running 15 secs || 9416539 markings, 21038090 edges, 453802 markings/sec, 15 secs
lola: sara is running 20 secs || 11629325 markings, 26106147 edges, 442557 markings/sec, 20 secs
lola: sara is running 25 secs || 13805305 markings, 31162209 edges, 435196 markings/sec, 25 secs
lola: sara is running 30 secs || 16000252 markings, 36266796 edges, 438989 markings/sec, 30 secs
lola: sara is running 35 secs || 18268206 markings, 41357464 edges, 453591 markings/sec, 35 secs
lola: sara is running 40 secs || 20440580 markings, 46425415 edges, 434475 markings/sec, 40 secs
lola: sara is running 45 secs || 22727774 markings, 51777939 edges, 457439 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 22832335 markings, 52029344 edges
lola: ========================================
lola: subprocess 2 will run for 3205 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p19 <= 0) OR (p22 <= 0) OR (p12 <= 0) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p19 <= 0) OR (p22 <= 0) OR (p12 <= 0) OR ((1 <= p0) AND (1 <= p2) AND (1 <= p12) AND (1 <= p31)) OR ((1 <= p5) AND (1 <= p6)))))
lola: processed formula length: 140
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p19) AND (1 <= p22) AND (1 <= p12) AND ((p0 <= 0) OR (p2 <= 0) OR (p12 <= 0) OR (p31 <= 0)) AND ((p5 <= 0) OR (p6 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-2-0.sara.
lola: sara is running 0 secs || 2746884 markings, 5481150 edges, 549377 markings/sec, 0 secs
lola: sara is running 5 secs || 5347680 markings, 10912216 edges, 520159 markings/sec, 5 secs
lola: sara is running 10 secs || 7650549 markings, 16111935 edges, 460574 markings/sec, 10 secs
lola: sara is running 15 secs || 9722121 markings, 21012456 edges, 414314 markings/sec, 15 secs
lola: sara is running 20 secs || 11844354 markings, 25971221 edges, 424447 markings/sec, 20 secs
lola: sara is running 25 secs || 13989163 markings, 30992254 edges, 428962 markings/sec, 25 secs
lola: sara is running 30 secs || 15784870 markings, 35876237 edges, 359141 markings/sec, 30 secs
lola: sara is running 35 secs || 17248604 markings, 40453417 edges, 292747 markings/sec, 35 secs
lola: sara is running 40 secs || 19216705 markings, 45540694 edges, 393620 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 20738487 markings, 49515145 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no
lola:
preliminary result: yes no no
lola: memory consumption: 20948 KB
lola: time consumption: 415 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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="GPPP-PT-C0100N0000000010"
export BK_EXAMINATION="ReachabilityFireability"
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 GPPP-PT-C0100N0000000010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r113-smll-162075355700120"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0100N0000000010.tgz
mv GPPP-PT-C0100N0000000010 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;