fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r210-tajo-159033476100727
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for ShieldPPPt-PT-050B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15742.360 3600000.00 9747043.00 6477.70 T?TFTFTTTFFFTTTT normal

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.r210-tajo-159033476100727.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 itstools
Input is ShieldPPPt-PT-050B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100727
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.2K May 14 02:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 02:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 13 19:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 13 19:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:04 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:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 13 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 13 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K May 13 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 955K 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 ShieldPPPt-PT-050B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590615975082

[2020-05-27 21:46:17] [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, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 21:46:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 21:46:17] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2020-05-27 21:46:17] [INFO ] Transformed 3903 places.
[2020-05-27 21:46:17] [INFO ] Transformed 3553 transitions.
[2020-05-27 21:46:17] [INFO ] Found NUPN structural information;
[2020-05-27 21:46:17] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 96 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 122 ms. (steps per millisecond=81 ) properties seen :[1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1]
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[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]
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]
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]
// Phase 1: matrix 3553 rows 3903 cols
[2020-05-27 21:46:18] [INFO ] Computed 551 place invariants in 71 ms
[2020-05-27 21:46:19] [INFO ] [Real]Absence check using 551 positive place invariants in 877 ms returned sat
[2020-05-27 21:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:23] [INFO ] [Real]Absence check using state equation in 3545 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 21:46:24] [INFO ] [Real]Absence check using 551 positive place invariants in 928 ms returned sat
[2020-05-27 21:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:28] [INFO ] [Real]Absence check using state equation in 3608 ms returned (error "Failed to check-sat")
[2020-05-27 21:46:29] [INFO ] [Real]Absence check using 551 positive place invariants in 997 ms returned sat
[2020-05-27 21:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:33] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:33] [INFO ] [Real]Absence check using state equation in 3548 ms returned (error "Failed to check-sat")
[2020-05-27 21:46:34] [INFO ] [Real]Absence check using 551 positive place invariants in 884 ms returned sat
[2020-05-27 21:46:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:38] [INFO ] [Real]Absence check using state equation in 3614 ms returned (error "Failed to check-sat")
[2020-05-27 21:46:40] [INFO ] [Real]Absence check using 551 positive place invariants in 1226 ms returned sat
[2020-05-27 21:46:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:43] [INFO ] [Real]Absence check using state equation in 3247 ms returned (error "Failed to check-sat")
[2020-05-27 21:46:45] [INFO ] [Real]Absence check using 551 positive place invariants in 1099 ms returned sat
[2020-05-27 21:46:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:48] [INFO ] [Real]Absence check using state equation in 3366 ms returned unknown
[2020-05-27 21:46:49] [INFO ] [Real]Absence check using 551 positive place invariants in 864 ms returned sat
[2020-05-27 21:46:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:53] [INFO ] [Real]Absence check using state equation in 3645 ms returned (error "Failed to check-sat")
[2020-05-27 21:46:54] [INFO ] [Real]Absence check using 551 positive place invariants in 861 ms returned sat
[2020-05-27 21:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:46:58] [INFO ] [Real]Absence check using state equation in 3606 ms returned (error "Failed to check-sat")
Support contains 20 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Performed 939 Post agglomeration using F-continuation condition.Transition count delta: 939
Iterating post reduction 0 with 939 rules applied. Total rules applied 939 place count 3903 transition count 2614
Reduce places removed 939 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 941 rules applied. Total rules applied 1880 place count 2964 transition count 2612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1881 place count 2963 transition count 2612
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 1881 place count 2963 transition count 2409
Deduced a syphon composed of 203 places in 9 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 2287 place count 2760 transition count 2409
Symmetric choice reduction at 3 with 348 rule applications. Total rules 2635 place count 2760 transition count 2409
Deduced a syphon composed of 348 places in 29 ms
Reduce places removed 348 places and 348 transitions.
Iterating global reduction 3 with 696 rules applied. Total rules applied 3331 place count 2412 transition count 2061
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 3331 place count 2412 transition count 1914
Deduced a syphon composed of 147 places in 15 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 3625 place count 2265 transition count 1914
Performed 839 Post agglomeration using F-continuation condition.Transition count delta: 839
Deduced a syphon composed of 839 places in 2 ms
Reduce places removed 839 places and 0 transitions.
Iterating global reduction 3 with 1678 rules applied. Total rules applied 5303 place count 1426 transition count 1075
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 5505 place count 1325 transition count 1075
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 5595 place count 1280 transition count 1075
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 5596 place count 1280 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5597 place count 1279 transition count 1074
Partial Free-agglomeration rule applied 151 times.
Drop transitions removed 151 transitions
Iterating global reduction 4 with 151 rules applied. Total rules applied 5748 place count 1279 transition count 1074
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5749 place count 1278 transition count 1073
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5750 place count 1277 transition count 1073
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 5750 place count 1277 transition count 1071
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5754 place count 1275 transition count 1071
Applied a total of 5754 rules in 1691 ms. Remains 1275 /3903 variables (removed 2628) and now considering 1071/3553 (removed 2482) transitions.
Finished structural reductions, in 1 iterations. Remains : 1275/3903 places, 1071/3553 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6368 ms. (steps per millisecond=157 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0]
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4462 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 881469 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=176 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4459 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4432 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4602 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4592 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4917 ms. (steps per millisecond=203 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1071 rows 1275 cols
[2020-05-27 21:47:39] [INFO ] Computed 550 place invariants in 4 ms
[2020-05-27 21:47:39] [INFO ] [Real]Absence check using 550 positive place invariants in 397 ms returned sat
[2020-05-27 21:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:42] [INFO ] [Real]Absence check using state equation in 2972 ms returned sat
[2020-05-27 21:47:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-05-27 21:47:42] [INFO ] [Real]Added 8 Read/Feed constraints in 18 ms returned sat
[2020-05-27 21:47:43] [INFO ] Deduced a trap composed of 3 places in 320 ms
[2020-05-27 21:47:43] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2020-05-27 21:47:43] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-05-27 21:47:44] [INFO ] Deduced a trap composed of 4 places in 274 ms
[2020-05-27 21:47:44] [INFO ] Deduced a trap composed of 3 places in 283 ms
[2020-05-27 21:47:44] [INFO ] Deduced a trap composed of 4 places in 257 ms
[2020-05-27 21:47:45] [INFO ] Deduced a trap composed of 5 places in 329 ms
[2020-05-27 21:47:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2425 ms
[2020-05-27 21:47:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:47:45] [INFO ] [Nat]Absence check using 550 positive place invariants in 408 ms returned sat
[2020-05-27 21:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:48] [INFO ] [Nat]Absence check using state equation in 2957 ms returned sat
[2020-05-27 21:47:48] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2020-05-27 21:47:49] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-05-27 21:47:49] [INFO ] Deduced a trap composed of 4 places in 286 ms
[2020-05-27 21:47:49] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-05-27 21:47:50] [INFO ] Deduced a trap composed of 4 places in 198 ms
[2020-05-27 21:47:50] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-05-27 21:47:50] [INFO ] Deduced a trap composed of 5 places in 196 ms
[2020-05-27 21:47:50] [INFO ] Deduced a trap composed of 4 places in 203 ms
[2020-05-27 21:47:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2073 ms
[2020-05-27 21:47:51] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 110 ms.
[2020-05-27 21:48:11] [INFO ] Added : 845 causal constraints over 169 iterations in 20118 ms.(timeout) Result :sat
[2020-05-27 21:48:11] [INFO ] Deduced a trap composed of 3 places in 30 ms
[2020-05-27 21:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
Attempting to minimize the solution found.
Minimization took 86 ms.
[2020-05-27 21:48:12] [INFO ] [Real]Absence check using 550 positive place invariants in 436 ms returned sat
[2020-05-27 21:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:15] [INFO ] [Real]Absence check using state equation in 3216 ms returned sat
[2020-05-27 21:48:15] [INFO ] [Real]Added 8 Read/Feed constraints in 17 ms returned sat
[2020-05-27 21:48:15] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-05-27 21:48:16] [INFO ] Deduced a trap composed of 6 places in 192 ms
[2020-05-27 21:48:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2020-05-27 21:48:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:48:16] [INFO ] [Nat]Absence check using 550 positive place invariants in 435 ms returned sat
[2020-05-27 21:48:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:19] [INFO ] [Nat]Absence check using state equation in 2881 ms returned sat
[2020-05-27 21:48:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2020-05-27 21:48:19] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-05-27 21:48:20] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 21:48:20] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-05-27 21:48:20] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-05-27 21:48:21] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-05-27 21:48:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1630 ms
[2020-05-27 21:48:21] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 58 ms.
[2020-05-27 21:48:41] [INFO ] Added : 890 causal constraints over 178 iterations in 20089 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
[2020-05-27 21:48:42] [INFO ] [Real]Absence check using 550 positive place invariants in 420 ms returned sat
[2020-05-27 21:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:44] [INFO ] [Real]Absence check using state equation in 2658 ms returned sat
[2020-05-27 21:48:44] [INFO ] [Real]Added 8 Read/Feed constraints in 15 ms returned sat
[2020-05-27 21:48:45] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-27 21:48:45] [INFO ] Deduced a trap composed of 3 places in 244 ms
[2020-05-27 21:48:45] [INFO ] Deduced a trap composed of 4 places in 273 ms
[2020-05-27 21:48:46] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-05-27 21:48:46] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-05-27 21:48:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1584 ms
[2020-05-27 21:48:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:48:46] [INFO ] [Nat]Absence check using 550 positive place invariants in 282 ms returned sat
[2020-05-27 21:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:49] [INFO ] [Nat]Absence check using state equation in 2701 ms returned sat
[2020-05-27 21:48:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 23 ms returned sat
[2020-05-27 21:48:49] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-05-27 21:48:50] [INFO ] Deduced a trap composed of 5 places in 247 ms
[2020-05-27 21:48:50] [INFO ] Deduced a trap composed of 4 places in 243 ms
[2020-05-27 21:48:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 977 ms
[2020-05-27 21:48:50] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 68 ms.
[2020-05-27 21:49:10] [INFO ] Added : 835 causal constraints over 167 iterations in 20114 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2020-05-27 21:49:11] [INFO ] [Real]Absence check using 550 positive place invariants in 449 ms returned sat
[2020-05-27 21:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:49:14] [INFO ] [Real]Absence check using state equation in 3107 ms returned sat
[2020-05-27 21:49:14] [INFO ] [Real]Added 8 Read/Feed constraints in 26 ms returned sat
[2020-05-27 21:49:15] [INFO ] Deduced a trap composed of 3 places in 295 ms
[2020-05-27 21:49:15] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 21:49:15] [INFO ] Deduced a trap composed of 4 places in 282 ms
[2020-05-27 21:49:16] [INFO ] Deduced a trap composed of 7 places in 252 ms
[2020-05-27 21:49:16] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 21:49:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1679 ms
[2020-05-27 21:49:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:49:17] [INFO ] [Nat]Absence check using 550 positive place invariants in 403 ms returned sat
[2020-05-27 21:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:49:20] [INFO ] [Nat]Absence check using state equation in 2778 ms returned sat
[2020-05-27 21:49:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2020-05-27 21:49:20] [INFO ] Deduced a trap composed of 7 places in 237 ms
[2020-05-27 21:49:20] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-05-27 21:49:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 606 ms
[2020-05-27 21:49:20] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 52 ms.
[2020-05-27 21:49:40] [INFO ] Added : 870 causal constraints over 174 iterations in 20198 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 65 ms.
[2020-05-27 21:49:41] [INFO ] [Real]Absence check using 550 positive place invariants in 400 ms returned sat
[2020-05-27 21:49:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:49:44] [INFO ] [Real]Absence check using state equation in 2933 ms returned sat
[2020-05-27 21:49:44] [INFO ] [Real]Added 8 Read/Feed constraints in 15 ms returned sat
[2020-05-27 21:49:44] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-05-27 21:49:45] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2020-05-27 21:49:45] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 21:49:45] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-05-27 21:49:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1293 ms
[2020-05-27 21:49:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:49:46] [INFO ] [Nat]Absence check using 550 positive place invariants in 417 ms returned sat
[2020-05-27 21:49:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:49:49] [INFO ] [Nat]Absence check using state equation in 2894 ms returned sat
[2020-05-27 21:49:49] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2020-05-27 21:49:49] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2020-05-27 21:49:50] [INFO ] Deduced a trap composed of 7 places in 174 ms
[2020-05-27 21:49:50] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-05-27 21:49:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 748 ms
[2020-05-27 21:49:50] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 56 ms.
[2020-05-27 21:50:10] [INFO ] Added : 875 causal constraints over 175 iterations in 20083 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-05-27 21:50:11] [INFO ] [Real]Absence check using 550 positive place invariants in 434 ms returned sat
[2020-05-27 21:50:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:14] [INFO ] [Real]Absence check using state equation in 3010 ms returned sat
[2020-05-27 21:50:14] [INFO ] [Real]Added 8 Read/Feed constraints in 18 ms returned sat
[2020-05-27 21:50:14] [INFO ] Deduced a trap composed of 5 places in 277 ms
[2020-05-27 21:50:15] [INFO ] Deduced a trap composed of 5 places in 359 ms
[2020-05-27 21:50:15] [INFO ] Deduced a trap composed of 4 places in 243 ms
[2020-05-27 21:50:15] [INFO ] Deduced a trap composed of 5 places in 268 ms
[2020-05-27 21:50:16] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 21:50:16] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-05-27 21:50:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2060 ms
[2020-05-27 21:50:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:50:17] [INFO ] [Nat]Absence check using 550 positive place invariants in 401 ms returned sat
[2020-05-27 21:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:19] [INFO ] [Nat]Absence check using state equation in 2698 ms returned sat
[2020-05-27 21:50:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2020-05-27 21:50:20] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 21:50:20] [INFO ] Deduced a trap composed of 5 places in 226 ms
[2020-05-27 21:50:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 599 ms
[2020-05-27 21:50:20] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 57 ms.
[2020-05-27 21:50:40] [INFO ] Added : 930 causal constraints over 186 iterations in 20166 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 89 ms.
[2020-05-27 21:50:41] [INFO ] [Real]Absence check using 550 positive place invariants in 441 ms returned sat
[2020-05-27 21:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:44] [INFO ] [Real]Absence check using state equation in 2755 ms returned sat
[2020-05-27 21:50:44] [INFO ] [Real]Added 8 Read/Feed constraints in 17 ms returned sat
[2020-05-27 21:50:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:50:44] [INFO ] [Nat]Absence check using 550 positive place invariants in 434 ms returned sat
[2020-05-27 21:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:47] [INFO ] [Nat]Absence check using state equation in 2854 ms returned sat
[2020-05-27 21:50:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 35 ms returned sat
[2020-05-27 21:50:48] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 21:50:48] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-05-27 21:50:48] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-05-27 21:50:48] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-05-27 21:50:49] [INFO ] Deduced a trap composed of 6 places in 221 ms
[2020-05-27 21:50:49] [INFO ] Deduced a trap composed of 6 places in 232 ms
[2020-05-27 21:50:49] [INFO ] Deduced a trap composed of 4 places in 190 ms
[2020-05-27 21:50:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1990 ms
[2020-05-27 21:50:49] [INFO ] Computed and/alt/rep : 1065/2507/1065 causal constraints in 68 ms.
[2020-05-27 21:51:09] [INFO ] Added : 920 causal constraints over 184 iterations in 20159 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 91 ms.
Incomplete Parikh walk after 150400 steps, including 850 resets, run finished after 1781 ms. (steps per millisecond=84 ) properties seen :[0, 1, 1, 1, 0, 1, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 140500 steps, including 1001 resets, run finished after 1008 ms. (steps per millisecond=139 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 127200 steps, including 1001 resets, run finished after 909 ms. (steps per millisecond=139 ) properties seen :[0, 1] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 141800 steps, including 301 resets, run finished after 1247 ms. (steps per millisecond=113 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 126200 steps, including 752 resets, run finished after 920 ms. (steps per millisecond=137 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 144700 steps, including 1001 resets, run finished after 989 ms. (steps per millisecond=146 ) properties seen :[0] could not realise parikh vector
Incomplete Parikh walk after 129400 steps, including 1001 resets, run finished after 997 ms. (steps per millisecond=129 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 1275 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1275/1275 places, 1071/1071 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 1275 transition count 1066
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 1270 transition count 1066
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 10 place count 1270 transition count 1059
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 24 place count 1263 transition count 1059
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 38 place count 1256 transition count 1052
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 1254 transition count 1052
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 1254 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 1252 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 47 place count 1251 transition count 1049
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 1250 transition count 1048
Applied a total of 48 rules in 484 ms. Remains 1250 /1275 variables (removed 25) and now considering 1048/1071 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1275 places, 1048/1071 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 6948 ms. (steps per millisecond=143 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4803 ms. (steps per millisecond=208 ) properties seen :[0]
Interrupted probabilistic random walk after 1924394 steps, run timeout after 30001 ms. (steps per millisecond=64 ) properties seen :[0]
Probabilistic random walk after 1924394 steps, saw 300878 distinct states, run finished after 30001 ms. (steps per millisecond=64 ) properties seen :[0]
// Phase 1: matrix 1048 rows 1250 cols
[2020-05-27 21:52:00] [INFO ] Computed 550 place invariants in 3 ms
[2020-05-27 21:52:00] [INFO ] [Real]Absence check using 550 positive place invariants in 431 ms returned sat
[2020-05-27 21:52:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:52:03] [INFO ] [Real]Absence check using state equation in 2747 ms returned sat
[2020-05-27 21:52:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2020-05-27 21:52:03] [INFO ] [Real]Added 6 Read/Feed constraints in 16 ms returned sat
[2020-05-27 21:52:04] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 21:52:04] [INFO ] Deduced a trap composed of 4 places in 279 ms
[2020-05-27 21:52:04] [INFO ] Deduced a trap composed of 3 places in 255 ms
[2020-05-27 21:52:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 979 ms
[2020-05-27 21:52:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:52:05] [INFO ] [Nat]Absence check using 550 positive place invariants in 430 ms returned sat
[2020-05-27 21:52:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:52:08] [INFO ] [Nat]Absence check using state equation in 2779 ms returned sat
[2020-05-27 21:52:08] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2020-05-27 21:52:08] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-05-27 21:52:08] [INFO ] Deduced a trap composed of 4 places in 227 ms
[2020-05-27 21:52:09] [INFO ] Deduced a trap composed of 3 places in 224 ms
[2020-05-27 21:52:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 875 ms
[2020-05-27 21:52:09] [INFO ] Computed and/alt/rep : 1043/2486/1043 causal constraints in 61 ms.
[2020-05-27 21:52:29] [INFO ] Added : 865 causal constraints over 173 iterations in 20070 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 84 ms.
Incomplete Parikh walk after 132800 steps, including 1001 resets, run finished after 1301 ms. (steps per millisecond=102 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 1250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1048/1048 transitions.
Applied a total of 0 rules in 43 ms. Remains 1250 /1250 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1250/1250 places, 1048/1048 transitions.
Starting structural reductions, iteration 0 : 1250/1250 places, 1048/1048 transitions.
Applied a total of 0 rules in 58 ms. Remains 1250 /1250 variables (removed 0) and now considering 1048/1048 (removed 0) transitions.
// Phase 1: matrix 1048 rows 1250 cols
[2020-05-27 21:52:30] [INFO ] Computed 550 place invariants in 5 ms
[2020-05-27 21:52:35] [INFO ] Implicit Places using invariants in 4631 ms returned [1233, 1237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 4636 ms to find 2 implicit places.
[2020-05-27 21:52:35] [INFO ] Redundant transitions in 120 ms returned []
// Phase 1: matrix 1048 rows 1248 cols
[2020-05-27 21:52:35] [INFO ] Computed 548 place invariants in 5 ms
[2020-05-27 21:52:38] [INFO ] Dead Transitions using invariants and state equation in 3127 ms returned []
Starting structural reductions, iteration 1 : 1248/1250 places, 1048/1048 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1248 transition count 1048
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 1246 transition count 1046
Applied a total of 6 rules in 44 ms. Remains 1246 /1248 variables (removed 2) and now considering 1046/1048 (removed 2) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:52:38] [INFO ] Computed 548 place invariants in 3 ms
[2020-05-27 21:52:42] [INFO ] Implicit Places using invariants in 3904 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:52:42] [INFO ] Computed 548 place invariants in 8 ms
[2020-05-27 21:52:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-27 21:52:57] [INFO ] Implicit Places using invariants and state equation in 14867 ms returned []
Implicit Place search using SMT with State Equation took 18773 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 1246/1250 places, 1046/1048 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7337 ms. (steps per millisecond=136 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 4760 ms. (steps per millisecond=210 ) properties seen :[0]
Interrupted probabilistic random walk after 2096563 steps, run timeout after 30001 ms. (steps per millisecond=69 ) properties seen :[0]
Probabilistic random walk after 2096563 steps, saw 322951 distinct states, run finished after 30001 ms. (steps per millisecond=69 ) properties seen :[0]
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:53:39] [INFO ] Computed 548 place invariants in 3 ms
[2020-05-27 21:53:40] [INFO ] [Real]Absence check using 548 positive place invariants in 414 ms returned sat
[2020-05-27 21:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:53:42] [INFO ] [Real]Absence check using state equation in 2599 ms returned sat
[2020-05-27 21:53:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-27 21:53:42] [INFO ] [Real]Added 4 Read/Feed constraints in 14 ms returned sat
[2020-05-27 21:53:43] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-05-27 21:53:43] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 21:53:43] [INFO ] Deduced a trap composed of 7 places in 203 ms
[2020-05-27 21:53:43] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-05-27 21:53:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1131 ms
[2020-05-27 21:53:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:53:44] [INFO ] [Nat]Absence check using 548 positive place invariants in 392 ms returned sat
[2020-05-27 21:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:53:47] [INFO ] [Nat]Absence check using state equation in 2639 ms returned sat
[2020-05-27 21:53:47] [INFO ] [Nat]Added 4 Read/Feed constraints in 9 ms returned sat
[2020-05-27 21:53:47] [INFO ] Deduced a trap composed of 5 places in 251 ms
[2020-05-27 21:53:47] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-05-27 21:53:48] [INFO ] Deduced a trap composed of 7 places in 228 ms
[2020-05-27 21:53:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 843 ms
[2020-05-27 21:53:48] [INFO ] Computed and/alt/rep : 1041/2473/1041 causal constraints in 59 ms.
[2020-05-27 21:54:09] [INFO ] Added : 991 causal constraints over 199 iterations in 21613 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 106 ms.
Incomplete Parikh walk after 169200 steps, including 1001 resets, run finished after 1037 ms. (steps per millisecond=163 ) properties seen :[0] could not realise parikh vector
Support contains 2 out of 1246 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 23 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Starting structural reductions, iteration 0 : 1246/1246 places, 1046/1046 transitions.
Applied a total of 0 rules in 25 ms. Remains 1246 /1246 variables (removed 0) and now considering 1046/1046 (removed 0) transitions.
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:54:11] [INFO ] Computed 548 place invariants in 3 ms
[2020-05-27 21:54:15] [INFO ] Implicit Places using invariants in 4159 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:54:15] [INFO ] Computed 548 place invariants in 7 ms
[2020-05-27 21:54:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-27 21:54:30] [INFO ] Implicit Places using invariants and state equation in 15589 ms returned []
Implicit Place search using SMT with State Equation took 19749 ms to find 0 implicit places.
[2020-05-27 21:54:30] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:54:30] [INFO ] Computed 548 place invariants in 2 ms
[2020-05-27 21:54:34] [INFO ] Dead Transitions using invariants and state equation in 3118 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1246/1246 places, 1046/1046 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 913 ms. (steps per millisecond=109 ) properties seen :[0]
// Phase 1: matrix 1046 rows 1246 cols
[2020-05-27 21:54:34] [INFO ] Computed 548 place invariants in 3 ms
[2020-05-27 21:54:35] [INFO ] [Real]Absence check using 548 positive place invariants in 440 ms returned sat
[2020-05-27 21:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:54:38] [INFO ] [Real]Absence check using state equation in 2592 ms returned sat
[2020-05-27 21:54:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2020-05-27 21:54:38] [INFO ] [Real]Added 4 Read/Feed constraints in 12 ms returned sat
[2020-05-27 21:54:38] [INFO ] Deduced a trap composed of 4 places in 234 ms
[2020-05-27 21:54:38] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-05-27 21:54:39] [INFO ] Deduced a trap composed of 7 places in 199 ms
[2020-05-27 21:54:39] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-05-27 21:54:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1019 ms
[2020-05-27 21:54:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:54:39] [INFO ] [Nat]Absence check using 548 positive place invariants in 407 ms returned sat
[2020-05-27 21:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:54:42] [INFO ] [Nat]Absence check using state equation in 2827 ms returned sat
[2020-05-27 21:54:42] [INFO ] [Nat]Added 4 Read/Feed constraints in 10 ms returned sat
[2020-05-27 21:54:43] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-05-27 21:54:43] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-05-27 21:54:43] [INFO ] Deduced a trap composed of 7 places in 213 ms
[2020-05-27 21:54:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 837 ms
[2020-05-27 21:54:43] [INFO ] Computed and/alt/rep : 1041/2473/1041 causal constraints in 65 ms.
[2020-05-27 21:54:59] [INFO ] Added : 740 causal constraints over 148 iterations in 15707 ms. Result :unknown
Partial Free-agglomeration rule applied 294 times.
Drop transitions removed 294 transitions
Iterating global reduction 0 with 294 rules applied. Total rules applied 294 place count 1246 transition count 1046
Partial Post-agglomeration rule applied 52 times.
Drop transitions removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 346 place count 1246 transition count 1046
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 347 place count 1246 transition count 1045
Applied a total of 347 rules in 180 ms. Remains 1246 /1246 variables (removed 0) and now considering 1045/1046 (removed 1) transitions.
// Phase 1: matrix 1045 rows 1246 cols
[2020-05-27 21:54:59] [INFO ] Computed 548 place invariants in 3 ms
[2020-05-27 21:55:00] [INFO ] [Real]Absence check using 548 positive place invariants in 421 ms returned sat
[2020-05-27 21:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:55:02] [INFO ] [Real]Absence check using state equation in 2664 ms returned sat
[2020-05-27 21:55:02] [INFO ] State equation strengthened by 290 read => feed constraints.
[2020-05-27 21:55:02] [INFO ] [Real]Added 290 Read/Feed constraints in 66 ms returned sat
[2020-05-27 21:55:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:55:03] [INFO ] [Nat]Absence check using 548 positive place invariants in 427 ms returned sat
[2020-05-27 21:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:55:06] [INFO ] [Nat]Absence check using state equation in 2952 ms returned sat
[2020-05-27 21:55:06] [INFO ] [Nat]Added 290 Read/Feed constraints in 56 ms returned sat
[2020-05-27 21:55:06] [INFO ] Deduced a trap composed of 3 places in 16 ms
[2020-05-27 21:55:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-27 21:55:06] [INFO ] Computed and/alt/rep : 1042/3580/1042 causal constraints in 89 ms.
[2020-05-27 21:55:26] [INFO ] Added : 805 causal constraints over 161 iterations in 20122 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 88 ms.
[2020-05-27 21:55:27] [INFO ] Flatten gal took : 167 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 21:55:27] [INFO ] Applying decomposition
[2020-05-27 21:55:27] [INFO ] Flatten gal took : 159 ms
[2020-05-27 21:55:27] [INFO ] Flatten gal took : 127 ms

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ShieldPPPt-PT-050B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is ShieldPPPt-PT-050B, 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 r210-tajo-159033476100727"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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