Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r211-tajo-159033478401095.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is ShieldRVt-PT-100B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-tajo-159033478401095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 2.8K May 14 03:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 14 03:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 13 21:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 13 21:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 14 10:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 14:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.3M May 12 20:42 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-100B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591342007593

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 07:26:49] [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]
[2020-06-05 07:26:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 07:26:49] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2020-06-05 07:26:49] [INFO ] Transformed 5003 places.
[2020-06-05 07:26:49] [INFO ] Transformed 5003 transitions.
[2020-06-05 07:26:49] [INFO ] Found NUPN structural information;
[2020-06-05 07:26:50] [INFO ] Parsed PT model containing 5003 places and 5003 transitions in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 147 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 149 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0]
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
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, 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, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 5003 rows 5003 cols
[2020-06-05 07:26:50] [INFO ] Computed 401 place invariants in 81 ms
[2020-06-05 07:26:52] [INFO ] [Real]Absence check using 401 positive place invariants in 1069 ms returned sat
[2020-06-05 07:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:26:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:26:55] [INFO ] [Real]Absence check using state equation in 3197 ms returned (error "Failed to check-sat")
[2020-06-05 07:26:57] [INFO ] [Real]Absence check using 401 positive place invariants in 956 ms returned sat
[2020-06-05 07:26:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:00] [INFO ] [Real]Absence check using state equation in 3257 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 07:27:02] [INFO ] [Real]Absence check using 401 positive place invariants in 922 ms returned sat
[2020-06-05 07:27:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:05] [INFO ] [Real]Absence check using state equation in 3343 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 07:27:07] [INFO ] [Real]Absence check using 401 positive place invariants in 912 ms returned sat
[2020-06-05 07:27:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:10] [INFO ] [Real]Absence check using state equation in 3389 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:12] [INFO ] [Real]Absence check using 401 positive place invariants in 903 ms returned sat
[2020-06-05 07:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:15] [INFO ] [Real]Absence check using state equation in 3415 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:17] [INFO ] [Real]Absence check using 401 positive place invariants in 953 ms returned sat
[2020-06-05 07:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:20] [INFO ] [Real]Absence check using state equation in 3364 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:22] [INFO ] [Real]Absence check using 401 positive place invariants in 888 ms returned sat
[2020-06-05 07:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:25] [INFO ] [Real]Absence check using state equation in 3417 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:27] [INFO ] [Real]Absence check using 401 positive place invariants in 1115 ms returned sat
[2020-06-05 07:27:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:30] [INFO ] [Real]Absence check using state equation in 3183 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:32] [INFO ] [Real]Absence check using 401 positive place invariants in 916 ms returned sat
[2020-06-05 07:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:35] [INFO ] [Real]Absence check using state equation in 3338 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:37] [INFO ] [Real]Absence check using 401 positive place invariants in 867 ms returned sat
[2020-06-05 07:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:40] [INFO ] [Real]Absence check using state equation in 3539 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:42] [INFO ] [Real]Absence check using 401 positive place invariants in 932 ms returned sat
[2020-06-05 07:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:45] [INFO ] [Real]Absence check using state equation in 3386 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:47] [INFO ] [Real]Absence check using 401 positive place invariants in 896 ms returned sat
[2020-06-05 07:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:50] [INFO ] [Real]Absence check using state equation in 3421 ms returned (error "Failed to check-sat")
[2020-06-05 07:27:52] [INFO ] [Real]Absence check using 401 positive place invariants in 940 ms returned sat
[2020-06-05 07:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:27:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 07:27:55] [INFO ] [Real]Absence check using state equation in 3352 ms returned (error "Failed to check-sat")
Support contains 61 out of 5003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5003/5003 places, 5003/5003 transitions.
Performed 1566 Post agglomeration using F-continuation condition.Transition count delta: 1566
Iterating post reduction 0 with 1566 rules applied. Total rules applied 1566 place count 5003 transition count 3437
Reduce places removed 1566 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 1568 rules applied. Total rules applied 3134 place count 3437 transition count 3435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3135 place count 3436 transition count 3435
Performed 398 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 398 Pre rules applied. Total rules applied 3135 place count 3436 transition count 3037
Deduced a syphon composed of 398 places in 8 ms
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 796 rules applied. Total rules applied 3931 place count 3038 transition count 3037
Symmetric choice reduction at 3 with 692 rule applications. Total rules 4623 place count 3038 transition count 3037
Deduced a syphon composed of 692 places in 22 ms
Reduce places removed 692 places and 692 transitions.
Iterating global reduction 3 with 1384 rules applied. Total rules applied 6007 place count 2346 transition count 2345
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 6007 place count 2346 transition count 2059
Deduced a syphon composed of 286 places in 15 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 6579 place count 2060 transition count 2059
Performed 873 Post agglomeration using F-continuation condition.Transition count delta: 873
Deduced a syphon composed of 873 places in 3 ms
Reduce places removed 873 places and 0 transitions.
Iterating global reduction 3 with 1746 rules applied. Total rules applied 8325 place count 1187 transition count 1186
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -95
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8527 place count 1086 transition count 1281
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -96
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 8729 place count 985 transition count 1377
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: -77
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 8893 place count 903 transition count 1454
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 8894 place count 903 transition count 1453
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 8900 place count 903 transition count 1447
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 8906 place count 897 transition count 1447
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 8911 place count 897 transition count 1442
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 8912 place count 896 transition count 1441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8913 place count 895 transition count 1441
Applied a total of 8913 rules in 2204 ms. Remains 895 /5003 variables (removed 4108) and now considering 1441/5003 (removed 3562) transitions.
Finished structural reductions, in 1 iterations. Remains : 895/5003 places, 1441/5003 transitions.
Incomplete random walk after 1000000 steps, including 232 resets, run finished after 7764 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1]
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 4633 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 31 resets, run finished after 4579 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 18 resets, run finished after 4868 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 32 resets, run finished after 4809 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4920 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 4605 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 23 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 4498 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 35 resets, run finished after 4588 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4706 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1441 rows 895 cols
[2020-06-05 07:28:50] [INFO ] Computed 400 place invariants in 4 ms
[2020-06-05 07:28:50] [INFO ] [Real]Absence check using 400 positive place invariants in 251 ms returned sat
[2020-06-05 07:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:28:53] [INFO ] [Real]Absence check using state equation in 2440 ms returned sat
[2020-06-05 07:28:53] [INFO ] State equation strengthened by 868 read => feed constraints.
[2020-06-05 07:28:53] [INFO ] [Real]Added 868 Read/Feed constraints in 98 ms returned sat
[2020-06-05 07:28:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:28:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 319 ms returned sat
[2020-06-05 07:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:28:56] [INFO ] [Nat]Absence check using state equation in 2504 ms returned sat
[2020-06-05 07:28:56] [INFO ] [Nat]Added 868 Read/Feed constraints in 107 ms returned sat
[2020-06-05 07:28:56] [INFO ] Deduced a trap composed of 7 places in 41 ms
[2020-06-05 07:28:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2020-06-05 07:28:57] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 155 ms.
[2020-06-05 07:29:17] [INFO ] Added : 625 causal constraints over 125 iterations in 20149 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 155 ms.
[2020-06-05 07:29:17] [INFO ] [Real]Absence check using 400 positive place invariants in 440 ms returned sat
[2020-06-05 07:29:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:29:20] [INFO ] [Real]Absence check using state equation in 2398 ms returned sat
[2020-06-05 07:29:20] [INFO ] [Real]Added 868 Read/Feed constraints in 138 ms returned sat
[2020-06-05 07:29:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:29:21] [INFO ] [Nat]Absence check using 400 positive place invariants in 736 ms returned sat
[2020-06-05 07:29:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:29:25] [INFO ] [Nat]Absence check using state equation in 3532 ms returned sat
[2020-06-05 07:29:25] [INFO ] [Nat]Added 868 Read/Feed constraints in 112 ms returned sat
[2020-06-05 07:29:25] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 139 ms.
[2020-06-05 07:29:45] [INFO ] Added : 605 causal constraints over 121 iterations in 20173 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 139 ms.
[2020-06-05 07:29:46] [INFO ] [Real]Absence check using 400 positive place invariants in 249 ms returned sat
[2020-06-05 07:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:29:48] [INFO ] [Real]Absence check using state equation in 2417 ms returned sat
[2020-06-05 07:29:48] [INFO ] [Real]Added 868 Read/Feed constraints in 116 ms returned sat
[2020-06-05 07:29:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:29:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 254 ms returned sat
[2020-06-05 07:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:29:51] [INFO ] [Nat]Absence check using state equation in 2167 ms returned sat
[2020-06-05 07:29:51] [INFO ] [Nat]Added 868 Read/Feed constraints in 111 ms returned sat
[2020-06-05 07:29:51] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 115 ms.
[2020-06-05 07:30:11] [INFO ] Added : 575 causal constraints over 115 iterations in 20131 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 124 ms.
[2020-06-05 07:30:12] [INFO ] [Real]Absence check using 400 positive place invariants in 246 ms returned sat
[2020-06-05 07:30:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:30:15] [INFO ] [Real]Absence check using state equation in 2551 ms returned sat
[2020-06-05 07:30:15] [INFO ] [Real]Added 868 Read/Feed constraints in 101 ms returned sat
[2020-06-05 07:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:30:15] [INFO ] [Nat]Absence check using 400 positive place invariants in 274 ms returned sat
[2020-06-05 07:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:30:17] [INFO ] [Nat]Absence check using state equation in 2153 ms returned sat
[2020-06-05 07:30:17] [INFO ] [Nat]Added 868 Read/Feed constraints in 105 ms returned sat
[2020-06-05 07:30:18] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 109 ms.
[2020-06-05 07:30:38] [INFO ] Added : 680 causal constraints over 136 iterations in 20293 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 136 ms.
[2020-06-05 07:30:39] [INFO ] [Real]Absence check using 400 positive place invariants in 250 ms returned sat
[2020-06-05 07:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:30:41] [INFO ] [Real]Absence check using state equation in 2117 ms returned sat
[2020-06-05 07:30:41] [INFO ] [Real]Added 868 Read/Feed constraints in 101 ms returned sat
[2020-06-05 07:30:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:30:41] [INFO ] [Nat]Absence check using 400 positive place invariants in 283 ms returned sat
[2020-06-05 07:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:30:43] [INFO ] [Nat]Absence check using state equation in 2038 ms returned sat
[2020-06-05 07:30:43] [INFO ] [Nat]Added 868 Read/Feed constraints in 125 ms returned sat
[2020-06-05 07:30:44] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 103 ms.
[2020-06-05 07:31:04] [INFO ] Added : 575 causal constraints over 115 iterations in 20284 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 141 ms.
[2020-06-05 07:31:04] [INFO ] [Real]Absence check using 400 positive place invariants in 254 ms returned sat
[2020-06-05 07:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:31:07] [INFO ] [Real]Absence check using state equation in 2221 ms returned sat
[2020-06-05 07:31:07] [INFO ] [Real]Added 868 Read/Feed constraints in 104 ms returned sat
[2020-06-05 07:31:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:31:07] [INFO ] [Nat]Absence check using 400 positive place invariants in 181 ms returned sat
[2020-06-05 07:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:31:09] [INFO ] [Nat]Absence check using state equation in 2205 ms returned sat
[2020-06-05 07:31:10] [INFO ] [Nat]Added 868 Read/Feed constraints in 146 ms returned sat
[2020-06-05 07:31:10] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 192 ms.
[2020-06-05 07:31:30] [INFO ] Added : 615 causal constraints over 123 iterations in 20139 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 131 ms.
[2020-06-05 07:31:31] [INFO ] [Real]Absence check using 400 positive place invariants in 262 ms returned sat
[2020-06-05 07:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:31:33] [INFO ] [Real]Absence check using state equation in 2094 ms returned sat
[2020-06-05 07:31:33] [INFO ] [Real]Added 868 Read/Feed constraints in 118 ms returned sat
[2020-06-05 07:31:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:31:34] [INFO ] [Nat]Absence check using 400 positive place invariants in 515 ms returned sat
[2020-06-05 07:31:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:31:36] [INFO ] [Nat]Absence check using state equation in 2278 ms returned sat
[2020-06-05 07:31:36] [INFO ] [Nat]Added 868 Read/Feed constraints in 120 ms returned sat
[2020-06-05 07:31:36] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 105 ms.
[2020-06-05 07:31:59] [INFO ] Added : 680 causal constraints over 136 iterations in 22922 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 191 ms.
[2020-06-05 07:32:00] [INFO ] [Real]Absence check using 400 positive place invariants in 248 ms returned sat
[2020-06-05 07:32:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:02] [INFO ] [Real]Absence check using state equation in 2450 ms returned sat
[2020-06-05 07:32:02] [INFO ] [Real]Added 868 Read/Feed constraints in 103 ms returned sat
[2020-06-05 07:32:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:32:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 257 ms returned sat
[2020-06-05 07:32:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:05] [INFO ] [Nat]Absence check using state equation in 2127 ms returned sat
[2020-06-05 07:32:05] [INFO ] [Nat]Added 868 Read/Feed constraints in 103 ms returned sat
[2020-06-05 07:32:05] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 110 ms.
[2020-06-05 07:32:25] [INFO ] Added : 725 causal constraints over 145 iterations in 20185 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 130 ms.
[2020-06-05 07:32:26] [INFO ] [Real]Absence check using 400 positive place invariants in 277 ms returned sat
[2020-06-05 07:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:28] [INFO ] [Real]Absence check using state equation in 2181 ms returned sat
[2020-06-05 07:32:28] [INFO ] [Real]Added 868 Read/Feed constraints in 128 ms returned sat
[2020-06-05 07:32:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:32:29] [INFO ] [Nat]Absence check using 400 positive place invariants in 201 ms returned sat
[2020-06-05 07:32:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:31] [INFO ] [Nat]Absence check using state equation in 2040 ms returned sat
[2020-06-05 07:32:31] [INFO ] [Nat]Added 868 Read/Feed constraints in 115 ms returned sat
[2020-06-05 07:32:31] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 105 ms.
[2020-06-05 07:32:51] [INFO ] Added : 575 causal constraints over 115 iterations in 20186 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 126 ms.
[2020-06-05 07:32:52] [INFO ] [Real]Absence check using 400 positive place invariants in 246 ms returned sat
[2020-06-05 07:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:54] [INFO ] [Real]Absence check using state equation in 2079 ms returned sat
[2020-06-05 07:32:54] [INFO ] [Real]Added 868 Read/Feed constraints in 88 ms returned sat
[2020-06-05 07:32:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:32:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 180 ms returned sat
[2020-06-05 07:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:32:56] [INFO ] [Nat]Absence check using state equation in 2003 ms returned sat
[2020-06-05 07:32:56] [INFO ] [Nat]Added 868 Read/Feed constraints in 120 ms returned sat
[2020-06-05 07:32:57] [INFO ] Computed and/alt/rep : 1437/13842/1437 causal constraints in 114 ms.
[2020-06-05 07:33:17] [INFO ] Added : 605 causal constraints over 121 iterations in 20241 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 130 ms.
Incomplete Parikh walk after 404200 steps, including 1001 resets, run finished after 2612 ms. (steps per millisecond=154 ) properties seen :[0, 0, 1, 0, 0, 0, 1, 0, 1, 1] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 909900 steps, including 1001 resets, run finished after 5484 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 754300 steps, including 1001 resets, run finished after 4550 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 521700 steps, including 1001 resets, run finished after 3081 ms. (steps per millisecond=169 ) properties seen :[0, 1, 0, 0, 0, 1] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 641400 steps, including 1001 resets, run finished after 3784 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 687200 steps, including 1001 resets, run finished after 3920 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 807100 steps, including 1001 resets, run finished after 4770 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 723300 steps, including 1001 resets, run finished after 4167 ms. (steps per millisecond=173 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 695100 steps, including 1001 resets, run finished after 4088 ms. (steps per millisecond=170 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 812000 steps, including 1001 resets, run finished after 4808 ms. (steps per millisecond=168 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 21 out of 895 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 895/895 places, 1441/1441 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 895 transition count 1429
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 883 transition count 1429
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 24 place count 883 transition count 1416
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 870 transition count 1416
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 106 place count 842 transition count 1388
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 126 place count 832 transition count 1403
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 832 transition count 1403
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 831 transition count 1402
Applied a total of 128 rules in 126 ms. Remains 831 /895 variables (removed 64) and now considering 1402/1441 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 831/895 places, 1402/1441 transitions.
Incomplete random walk after 1000000 steps, including 252 resets, run finished after 7486 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 986428 steps, including 20 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 33 resets, run finished after 4886 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16 resets, run finished after 4597 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0]
Interrupted Best-First random walk after 980428 steps, including 20 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 2041933 steps, run timeout after 30001 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 2041933 steps, saw 263856 distinct states, run finished after 30002 ms. (steps per millisecond=68 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 1402 rows 831 cols
[2020-06-05 07:34:55] [INFO ] Computed 400 place invariants in 4 ms
[2020-06-05 07:34:56] [INFO ] [Real]Absence check using 400 positive place invariants in 247 ms returned sat
[2020-06-05 07:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:34:58] [INFO ] [Real]Absence check using state equation in 2045 ms returned sat
[2020-06-05 07:34:58] [INFO ] State equation strengthened by 357 read => feed constraints.
[2020-06-05 07:34:58] [INFO ] [Real]Added 357 Read/Feed constraints in 51 ms returned sat
[2020-06-05 07:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:34:58] [INFO ] [Nat]Absence check using 400 positive place invariants in 235 ms returned sat
[2020-06-05 07:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:35:00] [INFO ] [Nat]Absence check using state equation in 1906 ms returned sat
[2020-06-05 07:35:00] [INFO ] [Nat]Added 357 Read/Feed constraints in 52 ms returned sat
[2020-06-05 07:35:00] [INFO ] Computed and/alt/rep : 1393/8248/1393 causal constraints in 105 ms.
[2020-06-05 07:35:21] [INFO ] Added : 810 causal constraints over 162 iterations in 20330 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 140 ms.
[2020-06-05 07:35:21] [INFO ] [Real]Absence check using 400 positive place invariants in 226 ms returned sat
[2020-06-05 07:35:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:35:23] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2020-06-05 07:35:23] [INFO ] [Real]Added 357 Read/Feed constraints in 56 ms returned sat
[2020-06-05 07:35:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:35:24] [INFO ] [Nat]Absence check using 400 positive place invariants in 230 ms returned sat
[2020-06-05 07:35:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:35:26] [INFO ] [Nat]Absence check using state equation in 1879 ms returned sat
[2020-06-05 07:35:26] [INFO ] [Nat]Added 357 Read/Feed constraints in 43 ms returned sat
[2020-06-05 07:35:26] [INFO ] Computed and/alt/rep : 1393/8248/1393 causal constraints in 85 ms.
[2020-06-05 07:35:46] [INFO ] Added : 765 causal constraints over 153 iterations in 20152 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 129 ms.
[2020-06-05 07:35:46] [INFO ] [Real]Absence check using 400 positive place invariants in 229 ms returned sat
[2020-06-05 07:35:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:35:48] [INFO ] [Real]Absence check using state equation in 1901 ms returned sat
[2020-06-05 07:35:48] [INFO ] [Real]Added 357 Read/Feed constraints in 57 ms returned sat
[2020-06-05 07:35:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:35:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 223 ms returned sat
[2020-06-05 07:35:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:35:51] [INFO ] [Nat]Absence check using state equation in 1807 ms returned sat
[2020-06-05 07:35:51] [INFO ] [Nat]Added 357 Read/Feed constraints in 61 ms returned sat
[2020-06-05 07:35:51] [INFO ] Computed and/alt/rep : 1393/8248/1393 causal constraints in 80 ms.
[2020-06-05 07:36:11] [INFO ] Added : 700 causal constraints over 140 iterations in 20128 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-06-05 07:36:11] [INFO ] [Real]Absence check using 400 positive place invariants in 230 ms returned sat
[2020-06-05 07:36:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:36:13] [INFO ] [Real]Absence check using state equation in 2010 ms returned sat
[2020-06-05 07:36:14] [INFO ] [Real]Added 357 Read/Feed constraints in 55 ms returned sat
[2020-06-05 07:36:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:36:14] [INFO ] [Nat]Absence check using 400 positive place invariants in 231 ms returned sat
[2020-06-05 07:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:36:16] [INFO ] [Nat]Absence check using state equation in 1915 ms returned sat
[2020-06-05 07:36:16] [INFO ] [Nat]Added 357 Read/Feed constraints in 58 ms returned sat
[2020-06-05 07:36:16] [INFO ] Computed and/alt/rep : 1393/8248/1393 causal constraints in 96 ms.
[2020-06-05 07:36:36] [INFO ] Added : 600 causal constraints over 120 iterations in 20109 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 126 ms.
Incomplete Parikh walk after 256500 steps, including 1001 resets, run finished after 2005 ms. (steps per millisecond=127 ) properties seen :[1, 0, 0, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 175400 steps, including 1001 resets, run finished after 1222 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 332200 steps, including 1001 resets, run finished after 2469 ms. (steps per millisecond=134 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 220800 steps, including 1001 resets, run finished after 1567 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 12 out of 831 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 831/831 places, 1402/1402 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 831 transition count 1396
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 825 transition count 1396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 822 transition count 1393
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 821 transition count 1395
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 820 transition count 1394
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 819 transition count 1393
Applied a total of 22 rules in 76 ms. Remains 819 /831 variables (removed 12) and now considering 1393/1402 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 819/831 places, 1393/1402 transitions.
Incomplete random walk after 1000000 steps, including 239 resets, run finished after 6487 ms. (steps per millisecond=154 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 996217 steps, including 32 resets, run timeout after 5001 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 20 resets, run finished after 4850 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 998605 steps, including 20 resets, run timeout after 5001 ms. (steps per millisecond=199 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2095193 steps, run timeout after 30001 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2095193 steps, saw 265058 distinct states, run finished after 30001 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0]
// Phase 1: matrix 1393 rows 819 cols
[2020-06-05 07:37:35] [INFO ] Computed 400 place invariants in 2 ms
[2020-06-05 07:37:35] [INFO ] [Real]Absence check using 400 positive place invariants in 218 ms returned sat
[2020-06-05 07:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:37:37] [INFO ] [Real]Absence check using state equation in 1838 ms returned sat
[2020-06-05 07:37:37] [INFO ] State equation strengthened by 117 read => feed constraints.
[2020-06-05 07:37:37] [INFO ] [Real]Added 117 Read/Feed constraints in 27 ms returned sat
[2020-06-05 07:37:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:37:38] [INFO ] [Nat]Absence check using 400 positive place invariants in 159 ms returned sat
[2020-06-05 07:37:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:37:39] [INFO ] [Nat]Absence check using state equation in 1672 ms returned sat
[2020-06-05 07:37:39] [INFO ] [Nat]Added 117 Read/Feed constraints in 24 ms returned sat
[2020-06-05 07:37:40] [INFO ] Computed and/alt/rep : 1387/5536/1387 causal constraints in 109 ms.
[2020-06-05 07:38:00] [INFO ] Added : 1125 causal constraints over 225 iterations in 20482 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 133 ms.
[2020-06-05 07:38:00] [INFO ] [Real]Absence check using 400 positive place invariants in 230 ms returned sat
[2020-06-05 07:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:38:02] [INFO ] [Real]Absence check using state equation in 1812 ms returned sat
[2020-06-05 07:38:02] [INFO ] [Real]Added 117 Read/Feed constraints in 18 ms returned sat
[2020-06-05 07:38:02] [INFO ] Computed and/alt/rep : 1387/5536/1387 causal constraints in 64 ms.
[2020-06-05 07:38:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:38:03] [INFO ] [Nat]Absence check using 400 positive place invariants in 686 ms returned sat
[2020-06-05 07:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:38:06] [INFO ] [Nat]Absence check using state equation in 2656 ms returned sat
[2020-06-05 07:38:06] [INFO ] [Nat]Added 117 Read/Feed constraints in 41 ms returned sat
[2020-06-05 07:38:06] [INFO ] Computed and/alt/rep : 1387/5536/1387 causal constraints in 82 ms.
[2020-06-05 07:38:26] [INFO ] Added : 840 causal constraints over 168 iterations in 20110 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-06-05 07:38:27] [INFO ] [Real]Absence check using 400 positive place invariants in 226 ms returned sat
[2020-06-05 07:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:38:29] [INFO ] [Real]Absence check using state equation in 1951 ms returned sat
[2020-06-05 07:38:29] [INFO ] [Real]Added 117 Read/Feed constraints in 22 ms returned sat
[2020-06-05 07:38:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:38:29] [INFO ] [Nat]Absence check using 400 positive place invariants in 218 ms returned sat
[2020-06-05 07:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:38:31] [INFO ] [Nat]Absence check using state equation in 1803 ms returned sat
[2020-06-05 07:38:31] [INFO ] [Nat]Added 117 Read/Feed constraints in 22 ms returned sat
[2020-06-05 07:38:31] [INFO ] Computed and/alt/rep : 1387/5536/1387 causal constraints in 72 ms.
[2020-06-05 07:38:51] [INFO ] Added : 915 causal constraints over 183 iterations in 20071 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 173100 steps, including 962 resets, run finished after 1640 ms. (steps per millisecond=105 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 178200 steps, including 1001 resets, run finished after 1229 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 167000 steps, including 602 resets, run finished after 1295 ms. (steps per millisecond=128 ) properties seen :[1, 0, 0] could not realise parikh vector
FORMULA ShieldRVt-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 819 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 819/819 places, 1393/1393 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 819 transition count 1392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 818 transition count 1392
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 818 transition count 1390
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 816 transition count 1390
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 2 with 2 rules applied. Total rules applied 8 place count 815 transition count 1389
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 2 with 2 rules applied. Total rules applied 10 place count 814 transition count 1390
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 814 transition count 1390
Applied a total of 11 rules in 58 ms. Remains 814 /819 variables (removed 5) and now considering 1390/1393 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 814/819 places, 1390/1393 transitions.
Incomplete random walk after 1000000 steps, including 261 resets, run finished after 6558 ms. (steps per millisecond=152 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 19 resets, run finished after 4818 ms. (steps per millisecond=207 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 4992 ms. (steps per millisecond=200 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2022667 steps, run timeout after 30001 ms. (steps per millisecond=67 ) properties seen :[0, 0]
Probabilistic random walk after 2022667 steps, saw 274971 distinct states, run finished after 30001 ms. (steps per millisecond=67 ) properties seen :[0, 0]
// Phase 1: matrix 1390 rows 814 cols
[2020-06-05 07:39:42] [INFO ] Computed 400 place invariants in 3 ms
[2020-06-05 07:39:42] [INFO ] [Real]Absence check using 400 positive place invariants in 268 ms returned sat
[2020-06-05 07:39:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:39:44] [INFO ] [Real]Absence check using state equation in 1882 ms returned sat
[2020-06-05 07:39:44] [INFO ] State equation strengthened by 118 read => feed constraints.
[2020-06-05 07:39:44] [INFO ] [Real]Added 118 Read/Feed constraints in 27 ms returned sat
[2020-06-05 07:39:44] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 82 ms.
[2020-06-05 07:39:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:39:45] [INFO ] [Nat]Absence check using 400 positive place invariants in 215 ms returned sat
[2020-06-05 07:39:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:39:47] [INFO ] [Nat]Absence check using state equation in 1671 ms returned sat
[2020-06-05 07:39:47] [INFO ] [Nat]Added 118 Read/Feed constraints in 46 ms returned sat
[2020-06-05 07:39:47] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 101 ms.
[2020-06-05 07:40:07] [INFO ] Added : 780 causal constraints over 156 iterations in 20104 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 77 ms.
[2020-06-05 07:40:07] [INFO ] [Real]Absence check using 400 positive place invariants in 224 ms returned sat
[2020-06-05 07:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:40:09] [INFO ] [Real]Absence check using state equation in 1827 ms returned sat
[2020-06-05 07:40:09] [INFO ] [Real]Added 118 Read/Feed constraints in 30 ms returned sat
[2020-06-05 07:40:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:40:10] [INFO ] [Nat]Absence check using 400 positive place invariants in 226 ms returned sat
[2020-06-05 07:40:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:40:12] [INFO ] [Nat]Absence check using state equation in 1882 ms returned sat
[2020-06-05 07:40:12] [INFO ] [Nat]Added 118 Read/Feed constraints in 24 ms returned sat
[2020-06-05 07:40:12] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 84 ms.
[2020-06-05 07:40:32] [INFO ] Added : 955 causal constraints over 191 iterations in 20169 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 88 ms.
Incomplete Parikh walk after 184400 steps, including 619 resets, run finished after 1718 ms. (steps per millisecond=107 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 190400 steps, including 1001 resets, run finished after 1278 ms. (steps per millisecond=148 ) properties seen :[0, 0] could not realise parikh vector
Support contains 9 out of 814 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 814/814 places, 1390/1390 transitions.
Applied a total of 0 rules in 17 ms. Remains 814 /814 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 814/814 places, 1390/1390 transitions.
Starting structural reductions, iteration 0 : 814/814 places, 1390/1390 transitions.
Applied a total of 0 rules in 17 ms. Remains 814 /814 variables (removed 0) and now considering 1390/1390 (removed 0) transitions.
// Phase 1: matrix 1390 rows 814 cols
[2020-06-05 07:40:35] [INFO ] Computed 400 place invariants in 6 ms
[2020-06-05 07:40:37] [INFO ] Implicit Places using invariants in 1839 ms returned []
// Phase 1: matrix 1390 rows 814 cols
[2020-06-05 07:40:37] [INFO ] Computed 400 place invariants in 3 ms
[2020-06-05 07:40:39] [INFO ] State equation strengthened by 118 read => feed constraints.
[2020-06-05 07:40:47] [INFO ] Implicit Places using invariants and state equation in 10350 ms returned []
Implicit Place search using SMT with State Equation took 12191 ms to find 0 implicit places.
[2020-06-05 07:40:47] [INFO ] Redundant transitions in 104 ms returned []
// Phase 1: matrix 1390 rows 814 cols
[2020-06-05 07:40:47] [INFO ] Computed 400 place invariants in 3 ms
[2020-06-05 07:40:50] [INFO ] Dead Transitions using invariants and state equation in 2841 ms returned []
Finished structural reductions, in 1 iterations. Remains : 814/814 places, 1390/1390 transitions.
Incomplete random walk after 100000 steps, including 25 resets, run finished after 588 ms. (steps per millisecond=170 ) properties seen :[0, 0]
// Phase 1: matrix 1390 rows 814 cols
[2020-06-05 07:40:51] [INFO ] Computed 400 place invariants in 2 ms
[2020-06-05 07:40:51] [INFO ] [Real]Absence check using 400 positive place invariants in 218 ms returned sat
[2020-06-05 07:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:40:53] [INFO ] [Real]Absence check using state equation in 1999 ms returned sat
[2020-06-05 07:40:53] [INFO ] State equation strengthened by 118 read => feed constraints.
[2020-06-05 07:40:53] [INFO ] [Real]Added 118 Read/Feed constraints in 16 ms returned sat
[2020-06-05 07:40:53] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 68 ms.
[2020-06-05 07:40:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:40:54] [INFO ] [Nat]Absence check using 400 positive place invariants in 216 ms returned sat
[2020-06-05 07:40:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:40:56] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2020-06-05 07:40:56] [INFO ] [Nat]Added 118 Read/Feed constraints in 25 ms returned sat
[2020-06-05 07:40:56] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 92 ms.
[2020-06-05 07:41:13] [INFO ] Added : 920 causal constraints over 184 iterations in 17749 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-05 07:41:14] [INFO ] [Real]Absence check using 400 positive place invariants in 223 ms returned sat
[2020-06-05 07:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:16] [INFO ] [Real]Absence check using state equation in 1855 ms returned sat
[2020-06-05 07:41:16] [INFO ] [Real]Added 118 Read/Feed constraints in 18 ms returned sat
[2020-06-05 07:41:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:41:16] [INFO ] [Nat]Absence check using 400 positive place invariants in 215 ms returned sat
[2020-06-05 07:41:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:18] [INFO ] [Nat]Absence check using state equation in 1789 ms returned sat
[2020-06-05 07:41:18] [INFO ] [Nat]Added 118 Read/Feed constraints in 18 ms returned sat
[2020-06-05 07:41:18] [INFO ] Computed and/alt/rep : 1384/5566/1384 causal constraints in 83 ms.
[2020-06-05 07:41:36] [INFO ] Added : 850 causal constraints over 170 iterations in 17842 ms. Result :(error "Failed to check-sat")
Graph (trivial) has 385 edges and 814 vertex of which 4 / 814 are part of one of the 2 SCC in 20 ms
Free SCC test removed 2 places
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 2852 edges and 812 vertex of which 810 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 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 382 edges and 808 vertex of which 4 / 808 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 806 transition count 1381
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 381 edges and 804 vertex of which 6 / 804 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 801 transition count 1372
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 379 edges and 798 vertex of which 8 / 798 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 794 transition count 1361
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 375 edges and 790 vertex of which 8 / 790 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 786 transition count 1347
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 371 edges and 782 vertex of which 8 / 782 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 778 transition count 1333
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 367 edges and 774 vertex of which 8 / 774 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 97 place count 770 transition count 1319
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 363 edges and 766 vertex of which 8 / 766 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 116 place count 762 transition count 1305
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 359 edges and 758 vertex of which 6 / 758 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 7 with 17 rules applied. Total rules applied 133 place count 755 transition count 1293
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 356 edges and 752 vertex of which 6 / 752 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 16 rules applied. Total rules applied 149 place count 749 transition count 1281
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 355 edges and 746 vertex of which 6 / 746 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 9 with 14 rules applied. Total rules applied 163 place count 743 transition count 1271
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 353 edges and 740 vertex of which 8 / 740 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 15 rules applied. Total rules applied 178 place count 736 transition count 1260
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 6 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 2559 edges and 732 vertex of which 726 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Graph (trivial) has 346 edges and 726 vertex of which 8 / 726 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 21 rules applied. Total rules applied 199 place count 722 transition count 1240
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 342 edges and 718 vertex of which 6 / 718 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 17 rules applied. Total rules applied 216 place count 715 transition count 1228
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 339 edges and 712 vertex of which 6 / 712 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 17 rules applied. Total rules applied 233 place count 709 transition count 1215
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 336 edges and 705 vertex of which 6 / 705 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 17 rules applied. Total rules applied 250 place count 702 transition count 1203
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 334 edges and 699 vertex of which 8 / 699 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 265 place count 695 transition count 1192
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 330 edges and 691 vertex of which 8 / 691 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 20 rules applied. Total rules applied 285 place count 687 transition count 1177
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 326 edges and 683 vertex of which 8 / 683 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 304 place count 679 transition count 1163
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 322 edges and 675 vertex of which 8 / 675 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 323 place count 671 transition count 1149
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 318 edges and 667 vertex of which 8 / 667 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 342 place count 663 transition count 1135
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 314 edges and 659 vertex of which 8 / 659 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 361 place count 655 transition count 1121
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 310 edges and 651 vertex of which 8 / 651 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 380 place count 647 transition count 1107
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 306 edges and 643 vertex of which 8 / 643 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 399 place count 639 transition count 1093
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 302 edges and 635 vertex of which 8 / 635 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 418 place count 631 transition count 1079
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 298 edges and 627 vertex of which 8 / 627 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 437 place count 623 transition count 1065
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 294 edges and 619 vertex of which 8 / 619 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 456 place count 615 transition count 1051
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 290 edges and 611 vertex of which 8 / 611 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 475 place count 607 transition count 1037
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 286 edges and 603 vertex of which 8 / 603 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 494 place count 599 transition count 1023
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 282 edges and 595 vertex of which 8 / 595 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 513 place count 591 transition count 1009
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 278 edges and 587 vertex of which 8 / 587 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 532 place count 583 transition count 995
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 274 edges and 579 vertex of which 8 / 579 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 551 place count 575 transition count 981
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 270 edges and 571 vertex of which 8 / 571 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 570 place count 567 transition count 967
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 266 edges and 563 vertex of which 8 / 563 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 589 place count 559 transition count 953
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 262 edges and 555 vertex of which 8 / 555 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 608 place count 551 transition count 939
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 258 edges and 548 vertex of which 8 / 548 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 17 rules applied. Total rules applied 625 place count 544 transition count 926
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 1 places :
Also discarding 0 output transitions
Graph (complete) has 1885 edges and 540 vertex of which 539 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Graph (trivial) has 254 edges and 539 vertex of which 8 / 539 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 21 rules applied. Total rules applied 646 place count 535 transition count 911
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 250 edges and 531 vertex of which 8 / 531 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 665 place count 527 transition count 897
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 246 edges and 523 vertex of which 8 / 523 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 684 place count 519 transition count 883
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 242 edges and 515 vertex of which 8 / 515 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 703 place count 511 transition count 869
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 238 edges and 507 vertex of which 8 / 507 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 722 place count 503 transition count 855
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 234 edges and 499 vertex of which 6 / 499 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 741 place count 496 transition count 841
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 231 edges and 493 vertex of which 6 / 493 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 41 with 14 rules applied. Total rules applied 755 place count 490 transition count 831
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 228 edges and 487 vertex of which 6 / 487 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 16 rules applied. Total rules applied 771 place count 484 transition count 819
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 226 edges and 481 vertex of which 8 / 481 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 43 with 15 rules applied. Total rules applied 786 place count 477 transition count 808
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 223 edges and 473 vertex of which 10 / 473 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Iterating post reduction 44 with 20 rules applied. Total rules applied 806 place count 468 transition count 793
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 217 edges and 463 vertex of which 8 / 463 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 45 with 25 rules applied. Total rules applied 831 place count 459 transition count 774
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 212 edges and 454 vertex of which 4 / 454 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 46 with 21 rules applied. Total rules applied 852 place count 452 transition count 759
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 209 edges and 450 vertex of which 2 / 450 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 47 with 8 rules applied. Total rules applied 860 place count 449 transition count 754
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 48 with 4 rules applied. Total rules applied 864 place count 448 transition count 751
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 49 with 3 Pre rules applied. Total rules applied 864 place count 448 transition count 748
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 49 with 9 rules applied. Total rules applied 873 place count 442 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 49 with 1 rules applied. Total rules applied 874 place count 442 transition count 747
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 50 with 1 Pre rules applied. Total rules applied 874 place count 442 transition count 746
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 50 with 2 rules applied. Total rules applied 876 place count 441 transition count 746
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 50 with 3 rules applied. Total rules applied 879 place count 439 transition count 745
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 50 with 4 rules applied. Total rules applied 883 place count 439 transition count 741
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 51 with 15 rules applied. Total rules applied 898 place count 439 transition count 741
Partial Post-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 51 with 41 rules applied. Total rules applied 939 place count 439 transition count 741
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 51 with 1 rules applied. Total rules applied 940 place count 439 transition count 740
Drop transitions removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 52 with 51 rules applied. Total rules applied 991 place count 439 transition count 689
Applied a total of 991 rules in 283 ms. Remains 439 /814 variables (removed 375) and now considering 689/1390 (removed 701) transitions.
// Phase 1: matrix 689 rows 439 cols
[2020-06-05 07:41:36] [INFO ] Computed 214 place invariants in 2 ms
[2020-06-05 07:41:36] [INFO ] [Real]Absence check using 214 positive place invariants in 94 ms returned sat
[2020-06-05 07:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:37] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2020-06-05 07:41:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-05 07:41:37] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-05 07:41:37] [INFO ] Computed and/alt/rep : 681/2847/681 causal constraints in 59 ms.
[2020-06-05 07:41:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:41:37] [INFO ] [Nat]Absence check using 214 positive place invariants in 131 ms returned sat
[2020-06-05 07:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:38] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-06-05 07:41:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-06-05 07:41:38] [INFO ] Computed and/alt/rep : 681/2847/681 causal constraints in 40 ms.
[2020-06-05 07:41:50] [INFO ] Added : 630 causal constraints over 126 iterations in 12332 ms. Result :unknown
[2020-06-05 07:41:51] [INFO ] [Real]Absence check using 214 positive place invariants in 93 ms returned sat
[2020-06-05 07:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:51] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2020-06-05 07:41:51] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-05 07:41:51] [INFO ] Computed and/alt/rep : 681/2847/681 causal constraints in 48 ms.
[2020-06-05 07:41:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 07:41:52] [INFO ] [Nat]Absence check using 214 positive place invariants in 66 ms returned sat
[2020-06-05 07:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 07:41:52] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2020-06-05 07:41:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2020-06-05 07:41:52] [INFO ] Computed and/alt/rep : 681/2847/681 causal constraints in 48 ms.
[2020-06-05 07:42:03] [INFO ] Added : 600 causal constraints over 120 iterations in 10851 ms. Result :unknown
[2020-06-05 07:42:03] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2020-06-05 07:42:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 42 ms.
[2020-06-05 07:42:03] [INFO ] Flatten gal took : 196 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldRVt-PT-100B @ 3570 seconds

FORMULA ShieldRVt-PT-100B-ReachabilityFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3555
rslt: Output for ReachabilityFireability @ ShieldRVt-PT-100B

{
"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 Jun 5 07:42:04 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1777
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G (((p478 <= 0) OR (p551 <= 0) OR (2 <= p712) OR (p712 <= 0) OR (p292 <= 0))))",
"processed_size": 85,
"rewrites": 2
},
"result":
{
"edges": 88278,
"markings": 69930,
"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": 5,
"problems": 5
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3555
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p428) AND (1 <= p77) AND (1 <= p78) AND (1 <= p83) AND (1 <= p86))))",
"processed_size": 81,
"rewrites": 1
},
"result":
{
"edges": 106,
"markings": 107,
"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"
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 33100,
"runtime": 15.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**))"
},
"net":
{
"arcs": 7896,
"conflict_clusters": 213,
"places": 814,
"places_significant": 414,
"singleton_clusters": 0,
"transitions": 1390
},
"result":
{
"preliminary_value": "no no ",
"value": "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: 2204/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 26048
lola: finding significant places
lola: 814 places, 1390 transitions, 414 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: (p478 <= 1)
lola: LP says that atomic proposition is always true: (p551 <= 1)
lola: LP says that atomic proposition is always true: (p292 <= 1)
lola: LP says that atomic proposition is always true: (p428 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: LP says that atomic proposition is always true: (p78 <= 1)
lola: LP says that atomic proposition is always true: (p83 <= 1)
lola: LP says that atomic proposition is always true: (p86 <= 1)
lola: A (G (((p478 <= 0) OR (p551 <= 0) OR (2 <= p712) OR (p712 <= 0) OR (p292 <= 0)))) : E (F (((1 <= p428) AND (1 <= p77) AND (1 <= p78) AND (1 <= p83) AND (1 <= p86))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p478 <= 0) OR (p551 <= 0) OR (2 <= p712) OR (p712 <= 0) OR (p292 <= 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 (((p478 <= 0) OR (p551 <= 0) OR (2 <= p712) OR (p712 <= 0) OR (p292 <= 0))))
lola: processed formula length: 85
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 <= p478) AND (1 <= p551) AND (p712 <= 1) AND (1 <= p712) AND (1 <= p292))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 5 literals and 1 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.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69930 markings, 88278 edges
lola: ========================================
lola: subprocess 1 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p428) AND (1 <= p77) AND (1 <= p78) AND (1 <= p83) AND (1 <= p86))))
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 <= p428) AND (1 <= p77) AND (1 <= p78) AND (1 <= p83) AND (1 <= p86))))
lola: processed formula length: 81
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 107 markings, 106 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: memory consumption: 33100 KB
lola: time consumption: 15 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-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldRVt-PT-100B, 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 r211-tajo-159033478401095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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