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.r246-smll-162106594400160.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 ShieldRVt-PT-040B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-smll-162106594400160
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 16:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 19:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 489K May 5 16:52 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 ShieldRVt-PT-040B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-040B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621329280066

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-18 09:14:42] [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-18 09:14:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:14:42] [INFO ] Load time of PNML (sax parser for PT used): 261 ms
[2021-05-18 09:14:42] [INFO ] Transformed 2003 places.
[2021-05-18 09:14:42] [INFO ] Transformed 2003 transitions.
[2021-05-18 09:14:42] [INFO ] Found NUPN structural information;
[2021-05-18 09:14:42] [INFO ] Parsed PT model containing 2003 places and 2003 transitions in 370 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 133 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 118 ms. (steps per millisecond=84 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0]
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) 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 23 ms. (steps per millisecond=434 ) 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 30 ms. (steps per millisecond=333 ) 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 48 ms. (steps per millisecond=208 ) 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 63 ms. (steps per millisecond=158 ) 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 26 ms. (steps per millisecond=384 ) 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 21 ms. (steps per millisecond=476 ) 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 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 23 ms. (steps per millisecond=434 ) 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 20 ms. (steps per millisecond=500 ) 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 21 ms. (steps per millisecond=476 ) 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 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2003 rows 2003 cols
[2021-05-18 09:14:43] [INFO ] Computed 161 place invariants in 97 ms
[2021-05-18 09:14:44] [INFO ] [Real]Absence check using 161 positive place invariants in 324 ms returned sat
[2021-05-18 09:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:14:48] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:14:48] [INFO ] [Real]Absence check using state equation in 4006 ms returned (error "Failed to check-sat")
[2021-05-18 09:14:49] [INFO ] [Real]Absence check using 161 positive place invariants in 279 ms returned sat
[2021-05-18 09:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:14:53] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:14:53] [INFO ] [Real]Absence check using state equation in 4317 ms returned (error "Failed to check-sat")
[2021-05-18 09:14:54] [INFO ] [Real]Absence check using 161 positive place invariants in 280 ms returned sat
[2021-05-18 09:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:14:58] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:14:58] [INFO ] [Real]Absence check using state equation in 4371 ms returned (error "Failed to check-sat")
[2021-05-18 09:14:59] [INFO ] [Real]Absence check using 161 positive place invariants in 443 ms returned sat
[2021-05-18 09:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:03] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:03] [INFO ] [Real]Absence check using state equation in 4216 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:04] [INFO ] [Real]Absence check using 161 positive place invariants in 143 ms returned unsat
[2021-05-18 09:15:05] [INFO ] [Real]Absence check using 161 positive place invariants in 413 ms returned sat
[2021-05-18 09:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:09] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:09] [INFO ] [Real]Absence check using state equation in 4191 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:09] [INFO ] [Real]Absence check using 161 positive place invariants in 347 ms returned sat
[2021-05-18 09:15:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:14] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:14] [INFO ] [Real]Absence check using state equation in 4323 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:14] [INFO ] [Real]Absence check using 161 positive place invariants in 290 ms returned sat
[2021-05-18 09:15:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:19] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:19] [INFO ] [Real]Absence check using state equation in 4395 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:20] [INFO ] [Real]Absence check using 161 positive place invariants in 382 ms returned sat
[2021-05-18 09:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:24] [INFO ] [Real]Absence check using state equation in 4101 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:25] [INFO ] [Real]Absence check using 161 positive place invariants in 377 ms returned sat
[2021-05-18 09:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:29] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:29] [INFO ] [Real]Absence check using state equation in 4168 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:30] [INFO ] [Real]Absence check using 161 positive place invariants in 393 ms returned sat
[2021-05-18 09:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:34] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:34] [INFO ] [Real]Absence check using state equation in 4228 ms returned (error "Failed to check-sat")
[2021-05-18 09:15:35] [INFO ] [Real]Absence check using 161 positive place invariants in 374 ms returned sat
[2021-05-18 09:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:15:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:15:39] [INFO ] [Real]Absence check using state equation in 4233 ms returned (error "Failed to check-sat")
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 58 out of 2003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Performed 601 Post agglomeration using F-continuation condition.Transition count delta: 601
Iterating post reduction 0 with 601 rules applied. Total rules applied 601 place count 2003 transition count 1402
Reduce places removed 601 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 603 rules applied. Total rules applied 1204 place count 1402 transition count 1400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1205 place count 1401 transition count 1400
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 1205 place count 1401 transition count 1236
Deduced a syphon composed of 164 places in 3 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 1533 place count 1237 transition count 1236
Symmetric choice reduction at 3 with 267 rule applications. Total rules 1800 place count 1237 transition count 1236
Deduced a syphon composed of 267 places in 8 ms
Reduce places removed 267 places and 267 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 2334 place count 970 transition count 969
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 109 Pre rules applied. Total rules applied 2334 place count 970 transition count 860
Deduced a syphon composed of 109 places in 5 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 2552 place count 861 transition count 860
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 2 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 3 with 676 rules applied. Total rules applied 3228 place count 523 transition count 522
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3430 place count 422 transition count 607
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 3438 place count 418 transition count 611
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3439 place count 418 transition count 610
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3440 place count 418 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3441 place count 417 transition count 609
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 3444 place count 417 transition count 609
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3445 place count 417 transition count 608
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3446 place count 416 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3447 place count 415 transition count 607
Applied a total of 3447 rules in 859 ms. Remains 415 /2003 variables (removed 1588) and now considering 607/2003 (removed 1396) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/2003 places, 607/2003 transitions.
Incomplete random walk after 1000000 steps, including 271 resets, run finished after 5919 ms. (steps per millisecond=168 ) properties seen :[1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 28 resets, run finished after 3853 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 27 resets, run finished after 3610 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 32 resets, run finished after 3478 ms. (steps per millisecond=287 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 30 resets, run finished after 3589 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 3003 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 21 resets, run finished after 3503 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 607 rows 415 cols
[2021-05-18 09:16:07] [INFO ] Computed 160 place invariants in 5 ms
[2021-05-18 09:16:07] [INFO ] [Real]Absence check using 160 positive place invariants in 90 ms returned sat
[2021-05-18 09:16:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:08] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-18 09:16:08] [INFO ] State equation strengthened by 301 read => feed constraints.
[2021-05-18 09:16:08] [INFO ] [Real]Added 301 Read/Feed constraints in 58 ms returned sat
[2021-05-18 09:16:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:16:08] [INFO ] [Nat]Absence check using 160 positive place invariants in 92 ms returned sat
[2021-05-18 09:16:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:09] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2021-05-18 09:16:09] [INFO ] [Nat]Added 301 Read/Feed constraints in 47 ms returned sat
[2021-05-18 09:16:09] [INFO ] Computed and/alt/rep : 603/4853/603 causal constraints in 62 ms.
[2021-05-18 09:16:23] [INFO ] Added : 596 causal constraints over 122 iterations in 14702 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 100 ms.
[2021-05-18 09:16:24] [INFO ] [Real]Absence check using 160 positive place invariants in 102 ms returned sat
[2021-05-18 09:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:24] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2021-05-18 09:16:25] [INFO ] [Real]Added 301 Read/Feed constraints in 53 ms returned sat
[2021-05-18 09:16:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:16:25] [INFO ] [Nat]Absence check using 160 positive place invariants in 96 ms returned sat
[2021-05-18 09:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:25] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2021-05-18 09:16:25] [INFO ] [Nat]Added 301 Read/Feed constraints in 52 ms returned sat
[2021-05-18 09:16:26] [INFO ] Computed and/alt/rep : 603/4853/603 causal constraints in 63 ms.
[2021-05-18 09:16:40] [INFO ] Added : 597 causal constraints over 120 iterations in 14110 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 103 ms.
[2021-05-18 09:16:40] [INFO ] [Real]Absence check using 160 positive place invariants in 84 ms returned sat
[2021-05-18 09:16:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:41] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2021-05-18 09:16:41] [INFO ] [Real]Added 301 Read/Feed constraints in 46 ms returned sat
[2021-05-18 09:16:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:16:41] [INFO ] [Nat]Absence check using 160 positive place invariants in 91 ms returned sat
[2021-05-18 09:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:42] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2021-05-18 09:16:42] [INFO ] [Nat]Added 301 Read/Feed constraints in 44 ms returned sat
[2021-05-18 09:16:42] [INFO ] Computed and/alt/rep : 603/4853/603 causal constraints in 48 ms.
[2021-05-18 09:16:54] [INFO ] Added : 596 causal constraints over 120 iterations in 12335 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 103 ms.
[2021-05-18 09:16:54] [INFO ] [Real]Absence check using 160 positive place invariants in 92 ms returned sat
[2021-05-18 09:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:55] [INFO ] [Real]Absence check using state equation in 680 ms returned sat
[2021-05-18 09:16:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:16:55] [INFO ] [Nat]Absence check using 160 positive place invariants in 93 ms returned sat
[2021-05-18 09:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:16:56] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2021-05-18 09:16:56] [INFO ] [Nat]Added 301 Read/Feed constraints in 52 ms returned sat
[2021-05-18 09:16:56] [INFO ] Deduced a trap composed of 6 places in 24 ms
[2021-05-18 09:16:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-18 09:16:56] [INFO ] Computed and/alt/rep : 603/4853/603 causal constraints in 43 ms.
[2021-05-18 09:17:16] [INFO ] Added : 590 causal constraints over 120 iterations in 20402 ms. Result :unknown
[2021-05-18 09:17:16] [INFO ] [Real]Absence check using 160 positive place invariants in 86 ms returned sat
[2021-05-18 09:17:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:17:17] [INFO ] [Real]Absence check using state equation in 663 ms returned sat
[2021-05-18 09:17:17] [INFO ] [Real]Added 301 Read/Feed constraints in 48 ms returned sat
[2021-05-18 09:17:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:17:17] [INFO ] [Nat]Absence check using 160 positive place invariants in 96 ms returned sat
[2021-05-18 09:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:17:18] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2021-05-18 09:17:18] [INFO ] [Nat]Added 301 Read/Feed constraints in 45 ms returned sat
[2021-05-18 09:17:18] [INFO ] Computed and/alt/rep : 603/4853/603 causal constraints in 55 ms.
[2021-05-18 09:17:41] [INFO ] Added : 593 causal constraints over 119 iterations in 22934 ms. Result :unknown
Incomplete Parikh walk after 80800 steps, including 623 resets, run finished after 518 ms. (steps per millisecond=155 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 95500 steps, including 1002 resets, run finished after 529 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 79700 steps, including 306 resets, run finished after 438 ms. (steps per millisecond=181 ) properties seen :[1, 1, 1, 0, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-040B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 84400 steps, including 532 resets, run finished after 434 ms. (steps per millisecond=194 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 94300 steps, including 702 resets, run finished after 479 ms. (steps per millisecond=196 ) properties seen :[0, 0] could not realise parikh vector
Support contains 18 out of 415 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 415/415 places, 607/607 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 415 transition count 594
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 402 transition count 594
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 26 place count 402 transition count 583
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 48 place count 391 transition count 583
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 391 transition count 583
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 390 transition count 582
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 105 place count 363 transition count 555
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 123 place count 354 transition count 565
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 354 transition count 562
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 351 transition count 562
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 351 transition count 561
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 350 transition count 560
Applied a total of 131 rules in 114 ms. Remains 350 /415 variables (removed 65) and now considering 560/607 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/415 places, 560/607 transitions.
Incomplete random walk after 1000000 steps, including 256 resets, run finished after 5116 ms. (steps per millisecond=195 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 35 resets, run finished after 3403 ms. (steps per millisecond=293 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 3543 ms. (steps per millisecond=282 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 3710812 steps, run timeout after 30001 ms. (steps per millisecond=123 ) properties seen :[0, 0]
Probabilistic random walk after 3710812 steps, saw 537305 distinct states, run finished after 30003 ms. (steps per millisecond=123 ) properties seen :[0, 0]
// Phase 1: matrix 560 rows 350 cols
[2021-05-18 09:18:26] [INFO ] Computed 160 place invariants in 3 ms
[2021-05-18 09:18:26] [INFO ] [Real]Absence check using 160 positive place invariants in 75 ms returned sat
[2021-05-18 09:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:18:26] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2021-05-18 09:18:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-18 09:18:26] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2021-05-18 09:18:26] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2021-05-18 09:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2021-05-18 09:18:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:18:27] [INFO ] [Nat]Absence check using 160 positive place invariants in 79 ms returned sat
[2021-05-18 09:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:18:27] [INFO ] [Nat]Absence check using state equation in 538 ms returned sat
[2021-05-18 09:18:27] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2021-05-18 09:18:27] [INFO ] Computed and/alt/rep : 550/1777/550 causal constraints in 53 ms.
[2021-05-18 09:18:41] [INFO ] Added : 488 causal constraints over 100 iterations in 13502 ms. Result :unknown
[2021-05-18 09:18:41] [INFO ] [Real]Absence check using 160 positive place invariants in 72 ms returned sat
[2021-05-18 09:18:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:18:42] [INFO ] [Real]Absence check using state equation in 712 ms returned sat
[2021-05-18 09:18:42] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2021-05-18 09:18:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:18:42] [INFO ] [Nat]Absence check using 160 positive place invariants in 72 ms returned sat
[2021-05-18 09:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:18:43] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2021-05-18 09:18:43] [INFO ] [Nat]Added 21 Read/Feed constraints in 11 ms returned sat
[2021-05-18 09:18:43] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2021-05-18 09:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2021-05-18 09:18:43] [INFO ] Computed and/alt/rep : 550/1777/550 causal constraints in 36 ms.
[2021-05-18 09:18:54] [INFO ] Added : 480 causal constraints over 96 iterations in 11439 ms. Result :unknown
Incomplete Parikh walk after 72900 steps, including 547 resets, run finished after 472 ms. (steps per millisecond=154 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 70000 steps, including 1001 resets, run finished after 392 ms. (steps per millisecond=178 ) properties seen :[0, 0] could not realise parikh vector
Support contains 18 out of 350 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 350/350 places, 560/560 transitions.
Applied a total of 0 rules in 13 ms. Remains 350 /350 variables (removed 0) and now considering 560/560 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 560/560 transitions.
Starting structural reductions, iteration 0 : 350/350 places, 560/560 transitions.
Applied a total of 0 rules in 10 ms. Remains 350 /350 variables (removed 0) and now considering 560/560 (removed 0) transitions.
// Phase 1: matrix 560 rows 350 cols
[2021-05-18 09:18:55] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-18 09:18:56] [INFO ] Implicit Places using invariants in 704 ms returned []
// Phase 1: matrix 560 rows 350 cols
[2021-05-18 09:18:56] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-18 09:18:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-18 09:18:58] [INFO ] Implicit Places using invariants and state equation in 2285 ms returned []
Implicit Place search using SMT with State Equation took 2994 ms to find 0 implicit places.
[2021-05-18 09:18:58] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 560 rows 350 cols
[2021-05-18 09:18:58] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-18 09:18:59] [INFO ] Dead Transitions using invariants and state equation in 973 ms returned []
Finished structural reductions, in 1 iterations. Remains : 350/350 places, 560/560 transitions.
Incomplete random walk after 100000 steps, including 11 resets, run finished after 485 ms. (steps per millisecond=206 ) properties seen :[0, 0]
// Phase 1: matrix 560 rows 350 cols
[2021-05-18 09:18:59] [INFO ] Computed 160 place invariants in 2 ms
[2021-05-18 09:19:00] [INFO ] [Real]Absence check using 160 positive place invariants in 79 ms returned sat
[2021-05-18 09:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:00] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2021-05-18 09:19:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2021-05-18 09:19:00] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2021-05-18 09:19:00] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2021-05-18 09:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-18 09:19:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:19:00] [INFO ] [Nat]Absence check using 160 positive place invariants in 77 ms returned sat
[2021-05-18 09:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:01] [INFO ] [Nat]Absence check using state equation in 546 ms returned sat
[2021-05-18 09:19:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 9 ms returned sat
[2021-05-18 09:19:01] [INFO ] Computed and/alt/rep : 550/1777/550 causal constraints in 34 ms.
[2021-05-18 09:19:15] [INFO ] Added : 488 causal constraints over 100 iterations in 14340 ms. Result :sat
[2021-05-18 09:19:15] [INFO ] [Real]Absence check using 160 positive place invariants in 79 ms returned sat
[2021-05-18 09:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:16] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2021-05-18 09:19:16] [INFO ] [Real]Added 21 Read/Feed constraints in 9 ms returned sat
[2021-05-18 09:19:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:19:16] [INFO ] [Nat]Absence check using 160 positive place invariants in 82 ms returned sat
[2021-05-18 09:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:17] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2021-05-18 09:19:17] [INFO ] [Nat]Added 21 Read/Feed constraints in 8 ms returned sat
[2021-05-18 09:19:17] [INFO ] Deduced a trap composed of 4 places in 10 ms
[2021-05-18 09:19:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-18 09:19:17] [INFO ] Computed and/alt/rep : 550/1777/550 causal constraints in 34 ms.
[2021-05-18 09:19:27] [INFO ] Added : 480 causal constraints over 96 iterations in 10268 ms. Result :unknown
Graph (trivial) has 141 edges and 350 vertex of which 4 / 350 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1150 edges and 348 vertex of which 346 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 138 edges and 344 vertex of which 4 / 344 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 342 transition count 551
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 137 edges and 340 vertex of which 6 / 340 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 337 transition count 542
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 135 edges and 334 vertex of which 8 / 334 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 40 place count 330 transition count 531
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 131 edges and 326 vertex of which 8 / 326 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 59 place count 322 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 127 edges and 318 vertex of which 8 / 318 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 78 place count 314 transition count 503
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 120 edges and 312 vertex of which 2 / 312 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 5 with 13 rules applied. Total rules applied 91 place count 311 transition count 493
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 95 place count 310 transition count 490
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 97 place count 309 transition count 489
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1012 edges and 309 vertex of which 307 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Iterating post reduction 7 with 1 rules applied. Total rules applied 98 place count 307 transition count 488
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 102 place count 307 transition count 484
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 104 place count 307 transition count 484
Partial Post-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 134 place count 307 transition count 484
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 138 place count 307 transition count 480
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 10 with 34 rules applied. Total rules applied 172 place count 307 transition count 446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 174 place count 305 transition count 446
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 3 rules applied. Total rules applied 177 place count 303 transition count 445
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 180 place count 303 transition count 442
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 181 place count 303 transition count 442
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 182 place count 303 transition count 441
Applied a total of 182 rules in 114 ms. Remains 303 /350 variables (removed 47) and now considering 441/560 (removed 119) transitions.
// Phase 1: matrix 441 rows 303 cols
[2021-05-18 09:19:27] [INFO ] Computed 137 place invariants in 2 ms
[2021-05-18 09:19:28] [INFO ] [Real]Absence check using 137 positive place invariants in 196 ms returned sat
[2021-05-18 09:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:28] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2021-05-18 09:19:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:19:28] [INFO ] [Nat]Absence check using 137 positive place invariants in 63 ms returned sat
[2021-05-18 09:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:29] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2021-05-18 09:19:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-18 09:19:29] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-18 09:19:29] [INFO ] Computed and/alt/rep : 434/1304/434 causal constraints in 28 ms.
[2021-05-18 09:19:31] [INFO ] Added : 394 causal constraints over 80 iterations in 2862 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
[2021-05-18 09:19:32] [INFO ] [Real]Absence check using 137 positive place invariants in 103 ms returned sat
[2021-05-18 09:19:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:32] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-18 09:19:32] [INFO ] [Real]Added 3 Read/Feed constraints in 5 ms returned sat
[2021-05-18 09:19:32] [INFO ] Computed and/alt/rep : 434/1304/434 causal constraints in 29 ms.
[2021-05-18 09:19:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:19:32] [INFO ] [Nat]Absence check using 137 positive place invariants in 64 ms returned sat
[2021-05-18 09:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:19:33] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2021-05-18 09:19:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2021-05-18 09:19:33] [INFO ] Computed and/alt/rep : 434/1304/434 causal constraints in 32 ms.
[2021-05-18 09:19:36] [INFO ] Added : 395 causal constraints over 80 iterations in 3253 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2021-05-18 09:19:36] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2021-05-18 09:19:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
[2021-05-18 09:19:37] [INFO ] Flatten gal took : 129 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVt-PT-040B @ 3570 seconds

FORMULA ShieldRVt-PT-040B-ReachabilityFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-040B-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ ShieldRVt-PT-040B

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Tue May 18 09:19:38 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1783
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((p136 <= 0) OR (p309 <= 0) OR ((1 <= p22)) OR ((1 <= p235) AND (((1 <= p48)) OR ((1 <= p88)))) OR ((1 <= p114) AND ((p162 <= 0)) AND (1 <= p206)))))",
"processed_size": 160,
"rewrites": 2
},
"result":
{
"edges": 64,
"markings": 37,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 33,
"problems": 6
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 4,
"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": 9,
"visible_transitions": 0
},
"processed": "A (G (((p38 <= 0) OR ((1 <= p221)) OR (p50 <= 0) OR (p57 <= 0) OR (p243 <= 0) OR (((p192 <= 0)) AND ((p224 <= 0)) AND ((p257 <= 0) OR (p15 <= 0))))))",
"processed_size": 155,
"rewrites": 2
},
"result":
{
"edges": 31,
"markings": 21,
"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": 19,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 25508,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 3033,
"conflict_clusters": 109,
"places": 350,
"places_significant": 190,
"singleton_clusters": 0,
"transitions": 560
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes 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: 910/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 350
lola: finding significant places
lola: 350 places, 560 transitions, 190 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: LP says that atomic proposition is always true: (p136 <= 1)
lola: LP says that atomic proposition is always true: (p309 <= 1)
lola: LP says that atomic proposition is always true: (p22 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p48 <= 1)
lola: LP says that atomic proposition is always true: (p88 <= 1)
lola: LP says that atomic proposition is always true: (p162 <= 1)
lola: LP says that atomic proposition is always true: (p114 <= 1)
lola: LP says that atomic proposition is always true: (p206 <= 1)
lola: LP says that atomic proposition is always true: (p221 <= 1)
lola: LP says that atomic proposition is always true: (p38 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p57 <= 1)
lola: LP says that atomic proposition is always true: (p243 <= 1)
lola: LP says that atomic proposition is always true: (p192 <= 1)
lola: LP says that atomic proposition is always true: (p224 <= 1)
lola: LP says that atomic proposition is always true: (p257 <= 1)
lola: LP says that atomic proposition is always true: (p15 <= 1)
lola: A (G (((p136 <= 0) OR (p309 <= 0) OR ((1 <= p22)) OR ((1 <= p235) AND (((1 <= p48)) OR ((1 <= p88)))) OR ((1 <= p114) AND ((p162 <= 0)) AND (1 <= p206))))) : A (G (((p38 <= 0) OR ((1 <= p221)) OR (p50 <= 0) OR (p57 <= 0) OR (p243 <= 0) OR (((p192 <= 0)) AND ((p224 <= 0)) AND ((p257 <= 0) OR (p15 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p136 <= 0) OR (p309 <= 0) OR ((1 <= p22)) OR ((1 <= p235) AND (((1 <= p48)) OR ((1 <= p88)))) OR ((1 <= p114) AND ((p162 <= 0)) AND (1 <= p206)))))
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 (((p136 <= 0) OR (p309 <= 0) OR ((1 <= p22)) OR ((1 <= p235) AND (((1 <= p48)) OR ((1 <= p88)))) OR ((1 <= p114) AND ((p162 <= 0)) AND (1 <= p206)))))
lola: processed formula length: 160
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 <= p136) AND (1 <= p309) AND ((p22 <= 0)) AND ((p235 <= 0) OR (((p48 <= 0)) AND ((p88 <= 0)))) AND ((p114 <= 0) OR ((1 <= p162)) OR (p206 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 33 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 37 markings, 64 edges
lola: ========================================
lola: subprocess 1 will run for 3566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p38 <= 0) OR ((1 <= p221)) OR (p50 <= 0) OR (p57 <= 0) OR (p243 <= 0) OR (((p192 <= 0)) AND ((p224 <= 0)) AND ((p257 <= 0) OR (p15 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p38 <= 0) OR ((1 <= p221)) OR (p50 <= 0) OR (p57 <= 0) OR (p243 <= 0) OR (((p192 <= 0)) AND ((p224 <= 0)) AND ((p257 <= 0) OR (p15 <= 0))))))
lola: processed formula length: 155
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 <= p38) AND ((p221 <= 0)) AND (1 <= p50) AND (1 <= p57) AND (1 <= p243) AND (((1 <= p192)) OR ((1 <= p224)) OR ((1 <= p257) AND (1 <= p15))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 19 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 21 markings, 31 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 25508 KB
lola: time consumption: 4 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="ShieldRVt-PT-040B"
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 ShieldRVt-PT-040B, 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 r246-smll-162106594400160"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;