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-159033476100726.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033476100726
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPt-PT-050B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590615930267

[2020-05-27 21:45:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 21:45:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 21:45:32] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-05-27 21:45:32] [INFO ] Transformed 3903 places.
[2020-05-27 21:45:32] [INFO ] Transformed 3553 transitions.
[2020-05-27 21:45:32] [INFO ] Found NUPN structural information;
[2020-05-27 21:45:32] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 387 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 126 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 144 ms. (steps per millisecond=69 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 1]
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-08 FALSE 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]
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]
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]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[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]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 3553 rows 3903 cols
[2020-05-27 21:45:33] [INFO ] Computed 551 place invariants in 97 ms
[2020-05-27 21:45:34] [INFO ] [Real]Absence check using 551 positive place invariants in 1127 ms returned sat
[2020-05-27 21:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:45:38] [INFO ] [Real]Absence check using state equation in 3294 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 21:45:39] [INFO ] [Real]Absence check using 551 positive place invariants in 994 ms returned sat
[2020-05-27 21:45:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:45:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:45:43] [INFO ] [Real]Absence check using state equation in 3426 ms returned unknown
[2020-05-27 21:45:44] [INFO ] [Real]Absence check using 551 positive place invariants in 1004 ms returned sat
[2020-05-27 21:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:45:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:45:48] [INFO ] [Real]Absence check using state equation in 3460 ms returned (error "Failed to check-sat")
[2020-05-27 21:45:49] [INFO ] [Real]Absence check using 551 positive place invariants in 952 ms returned sat
[2020-05-27 21:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:45:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:45:53] [INFO ] [Real]Absence check using state equation in 3352 ms returned (error "Failed to check-sat")
[2020-05-27 21:45:54] [INFO ] [Real]Absence check using 551 positive place invariants in 943 ms returned sat
[2020-05-27 21:45:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:45:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 21:45:58] [INFO ] [Real]Absence check using state equation in 3381 ms returned (error "Failed to check-sat")
[2020-05-27 21:45:59] [INFO ] [Real]Absence check using 551 positive place invariants in 993 ms returned sat
[2020-05-27 21:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:03] [INFO ] [Real]Absence check using state equation in 3307 ms returned (error "Solver has unexpectedly terminated")
Support contains 22 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Performed 942 Post agglomeration using F-continuation condition.Transition count delta: 942
Iterating post reduction 0 with 942 rules applied. Total rules applied 942 place count 3903 transition count 2611
Reduce places removed 942 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 944 rules applied. Total rules applied 1886 place count 2961 transition count 2609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1887 place count 2960 transition count 2609
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 1887 place count 2960 transition count 2406
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 2293 place count 2757 transition count 2406
Symmetric choice reduction at 3 with 343 rule applications. Total rules 2636 place count 2757 transition count 2406
Deduced a syphon composed of 343 places in 29 ms
Reduce places removed 343 places and 343 transitions.
Iterating global reduction 3 with 686 rules applied. Total rules applied 3322 place count 2414 transition count 2063
Performed 147 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 147 Pre rules applied. Total rules applied 3322 place count 2414 transition count 1916
Deduced a syphon composed of 147 places in 8 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 3616 place count 2267 transition count 1916
Performed 839 Post agglomeration using F-continuation condition.Transition count delta: 839
Deduced a syphon composed of 839 places in 4 ms
Reduce places removed 839 places and 0 transitions.
Iterating global reduction 3 with 1678 rules applied. Total rules applied 5294 place count 1428 transition count 1077
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 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5496 place count 1327 transition count 1077
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 5586 place count 1282 transition count 1077
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 5588 place count 1282 transition count 1075
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 5590 place count 1280 transition count 1075
Partial Free-agglomeration rule applied 148 times.
Drop transitions removed 148 transitions
Iterating global reduction 4 with 148 rules applied. Total rules applied 5738 place count 1280 transition count 1075
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5739 place count 1279 transition count 1074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5740 place count 1278 transition count 1074
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 5740 place count 1278 transition count 1072
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 5744 place count 1276 transition count 1072
Applied a total of 5744 rules in 2615 ms. Remains 1276 /3903 variables (removed 2627) and now considering 1072/3553 (removed 2481) transitions.
Finished structural reductions, in 1 iterations. Remains : 1276/3903 places, 1072/3553 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 8143 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 861809 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 821149 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=164 ) properties seen :[0, 1, 0, 0, 0, 0]
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 948551 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 859131 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=171 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 862268 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0]
Interrupted Best-First random walk after 827909 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1072 rows 1276 cols
[2020-05-27 21:46:44] [INFO ] Computed 550 place invariants in 3 ms
[2020-05-27 21:46:44] [INFO ] [Real]Absence check using 550 positive place invariants in 426 ms returned sat
[2020-05-27 21:46:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:47] [INFO ] [Real]Absence check using state equation in 2727 ms returned sat
[2020-05-27 21:46:47] [INFO ] State equation strengthened by 20 read => feed constraints.
[2020-05-27 21:46:47] [INFO ] [Real]Added 20 Read/Feed constraints in 20 ms returned sat
[2020-05-27 21:46:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:46:48] [INFO ] [Nat]Absence check using 550 positive place invariants in 429 ms returned sat
[2020-05-27 21:46:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:46:51] [INFO ] [Nat]Absence check using state equation in 2744 ms returned sat
[2020-05-27 21:46:51] [INFO ] [Nat]Added 20 Read/Feed constraints in 13 ms returned sat
[2020-05-27 21:46:51] [INFO ] Deduced a trap composed of 5 places in 181 ms
[2020-05-27 21:46:51] [INFO ] Deduced a trap composed of 7 places in 181 ms
[2020-05-27 21:46:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 509 ms
[2020-05-27 21:46:51] [INFO ] Computed and/alt/rep : 1061/2594/1061 causal constraints in 62 ms.
[2020-05-27 21:47:11] [INFO ] Added : 860 causal constraints over 172 iterations in 20134 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 72 ms.
[2020-05-27 21:47:12] [INFO ] [Real]Absence check using 550 positive place invariants in 431 ms returned sat
[2020-05-27 21:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:15] [INFO ] [Real]Absence check using state equation in 3186 ms returned sat
[2020-05-27 21:47:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:47:16] [INFO ] [Nat]Absence check using 550 positive place invariants in 371 ms returned sat
[2020-05-27 21:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:19] [INFO ] [Nat]Absence check using state equation in 2926 ms returned sat
[2020-05-27 21:47:19] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2020-05-27 21:47:19] [INFO ] Computed and/alt/rep : 1061/2594/1061 causal constraints in 64 ms.
[2020-05-27 21:47:39] [INFO ] Added : 865 causal constraints over 173 iterations in 20113 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 74 ms.
[2020-05-27 21:47:40] [INFO ] [Real]Absence check using 550 positive place invariants in 420 ms returned sat
[2020-05-27 21:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:43] [INFO ] [Real]Absence check using state equation in 2925 ms returned sat
[2020-05-27 21:47:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:47:43] [INFO ] [Nat]Absence check using 550 positive place invariants in 291 ms returned sat
[2020-05-27 21:47:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:47:46] [INFO ] [Nat]Absence check using state equation in 2694 ms returned sat
[2020-05-27 21:47:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 30 ms returned sat
[2020-05-27 21:47:46] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 21:47:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 312 ms
[2020-05-27 21:47:46] [INFO ] Computed and/alt/rep : 1061/2594/1061 causal constraints in 68 ms.
[2020-05-27 21:48:06] [INFO ] Added : 855 causal constraints over 171 iterations in 20120 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
[2020-05-27 21:48:07] [INFO ] [Real]Absence check using 550 positive place invariants in 413 ms returned sat
[2020-05-27 21:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:10] [INFO ] [Real]Absence check using state equation in 3145 ms returned sat
[2020-05-27 21:48:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:48:11] [INFO ] [Nat]Absence check using 550 positive place invariants in 389 ms returned sat
[2020-05-27 21:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:14] [INFO ] [Nat]Absence check using state equation in 2714 ms returned sat
[2020-05-27 21:48:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 38 ms returned sat
[2020-05-27 21:48:14] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2020-05-27 21:48:14] [INFO ] Deduced a trap composed of 7 places in 195 ms
[2020-05-27 21:48:15] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-05-27 21:48:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 812 ms
[2020-05-27 21:48:15] [INFO ] Computed and/alt/rep : 1061/2594/1061 causal constraints in 47 ms.
[2020-05-27 21:48:35] [INFO ] Added : 925 causal constraints over 185 iterations in 20148 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 54 ms.
[2020-05-27 21:48:36] [INFO ] [Real]Absence check using 550 positive place invariants in 455 ms returned sat
[2020-05-27 21:48:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:39] [INFO ] [Real]Absence check using state equation in 3276 ms returned sat
[2020-05-27 21:48:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:48:40] [INFO ] [Nat]Absence check using 550 positive place invariants in 435 ms returned sat
[2020-05-27 21:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:48:43] [INFO ] [Nat]Absence check using state equation in 2942 ms returned sat
[2020-05-27 21:48:43] [INFO ] [Nat]Added 20 Read/Feed constraints in 29 ms returned sat
[2020-05-27 21:48:43] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-05-27 21:48:43] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-05-27 21:48:43] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2020-05-27 21:48:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 714 ms
[2020-05-27 21:48:43] [INFO ] Computed and/alt/rep : 1061/2594/1061 causal constraints in 70 ms.
[2020-05-27 21:49:03] [INFO ] Added : 925 causal constraints over 185 iterations in 20091 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
Incomplete Parikh walk after 179200 steps, including 460 resets, run finished after 1677 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126000 steps, including 537 resets, run finished after 997 ms. (steps per millisecond=126 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136500 steps, including 1002 resets, run finished after 1010 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 139600 steps, including 184 resets, run finished after 1125 ms. (steps per millisecond=124 ) properties seen :[1, 1, 0, 1, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 136200 steps, including 256 resets, run finished after 1059 ms. (steps per millisecond=128 ) properties seen :[0, 0] could not realise parikh vector
Support contains 12 out of 1276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1276/1276 places, 1072/1072 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1276 transition count 1070
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1274 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 1274 transition count 1068
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 1272 transition count 1068
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 1267 transition count 1063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 20 place count 1266 transition count 1063
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 1265 transition count 1062
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 1264 transition count 1061
Applied a total of 22 rules in 132 ms. Remains 1264 /1276 variables (removed 12) and now considering 1061/1072 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 1264/1276 places, 1061/1072 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7327 ms. (steps per millisecond=136 ) properties seen :[0, 0]
Interrupted Best-First random walk after 936954 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen :[0, 0]
Interrupted Best-First random walk after 951875 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=190 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 1613444 steps, run timeout after 30001 ms. (steps per millisecond=53 ) properties seen :[0, 0]
Probabilistic random walk after 1613444 steps, saw 249051 distinct states, run finished after 30001 ms. (steps per millisecond=53 ) properties seen :[0, 0]
// Phase 1: matrix 1061 rows 1264 cols
[2020-05-27 21:49:57] [INFO ] Computed 550 place invariants in 3 ms
[2020-05-27 21:49:58] [INFO ] [Real]Absence check using 550 positive place invariants in 439 ms returned sat
[2020-05-27 21:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:01] [INFO ] [Real]Absence check using state equation in 3001 ms returned sat
[2020-05-27 21:50:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:50:01] [INFO ] [Nat]Absence check using 550 positive place invariants in 427 ms returned sat
[2020-05-27 21:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:04] [INFO ] [Nat]Absence check using state equation in 2710 ms returned sat
[2020-05-27 21:50:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-27 21:50:04] [INFO ] [Nat]Added 12 Read/Feed constraints in 11 ms returned sat
[2020-05-27 21:50:04] [INFO ] Deduced a trap composed of 7 places in 249 ms
[2020-05-27 21:50:05] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-05-27 21:50:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 589 ms
[2020-05-27 21:50:05] [INFO ] Computed and/alt/rep : 1052/2544/1052 causal constraints in 44 ms.
[2020-05-27 21:50:25] [INFO ] Added : 825 causal constraints over 165 iterations in 20139 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 87 ms.
[2020-05-27 21:50:26] [INFO ] [Real]Absence check using 550 positive place invariants in 435 ms returned sat
[2020-05-27 21:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:29] [INFO ] [Real]Absence check using state equation in 3000 ms returned sat
[2020-05-27 21:50:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:50:29] [INFO ] [Nat]Absence check using 550 positive place invariants in 409 ms returned sat
[2020-05-27 21:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:50:32] [INFO ] [Nat]Absence check using state equation in 2923 ms returned sat
[2020-05-27 21:50:32] [INFO ] [Nat]Added 12 Read/Feed constraints in 11 ms returned sat
[2020-05-27 21:50:33] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-05-27 21:50:33] [INFO ] Deduced a trap composed of 5 places in 201 ms
[2020-05-27 21:50:33] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2020-05-27 21:50:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 743 ms
[2020-05-27 21:50:33] [INFO ] Computed and/alt/rep : 1052/2544/1052 causal constraints in 56 ms.
[2020-05-27 21:50:53] [INFO ] Added : 890 causal constraints over 178 iterations in 20195 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 84 ms.
Incomplete Parikh walk after 139900 steps, including 344 resets, run finished after 1594 ms. (steps per millisecond=87 ) properties seen :[1, 0] could not realise parikh vector
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 121600 steps, including 178 resets, run finished after 1415 ms. (steps per millisecond=85 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 1264 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1264/1264 places, 1061/1061 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1264 transition count 1059
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1262 transition count 1059
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 1262 transition count 1058
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 1261 transition count 1058
Applied a total of 6 rules in 45 ms. Remains 1261 /1264 variables (removed 3) and now considering 1058/1061 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1261/1264 places, 1058/1061 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7545 ms. (steps per millisecond=132 ) properties seen :[0]
Interrupted Best-First random walk after 979870 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=195 ) properties seen :[0]
Interrupted probabilistic random walk after 1763080 steps, run timeout after 30001 ms. (steps per millisecond=58 ) properties seen :[0]
Probabilistic random walk after 1763080 steps, saw 271834 distinct states, run finished after 30001 ms. (steps per millisecond=58 ) properties seen :[0]
// Phase 1: matrix 1058 rows 1261 cols
[2020-05-27 21:51:39] [INFO ] Computed 550 place invariants in 3 ms
[2020-05-27 21:51:40] [INFO ] [Real]Absence check using 550 positive place invariants in 470 ms returned sat
[2020-05-27 21:51:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 21:51:43] [INFO ] [Real]Absence check using state equation in 2957 ms returned sat
[2020-05-27 21:51:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 21:51:43] [INFO ] [Nat]Absence check using 550 positive place invariants in 432 ms returned sat
[2020-05-27 21:51:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 21:51:46] [INFO ] [Nat]Absence check using state equation in 2956 ms returned sat
[2020-05-27 21:51:46] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-05-27 21:51:46] [INFO ] [Nat]Added 12 Read/Feed constraints in 10 ms returned sat
[2020-05-27 21:51:47] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-05-27 21:51:47] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 21:51:47] [INFO ] Deduced a trap composed of 5 places in 159 ms
[2020-05-27 21:51:47] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-05-27 21:51:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 996 ms
[2020-05-27 21:51:47] [INFO ] Computed and/alt/rep : 1049/2541/1049 causal constraints in 74 ms.
[2020-05-27 21:52:07] [INFO ] Added : 845 causal constraints over 169 iterations in 20090 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 82 ms.
Finished Parikh walk after 21831 steps, including 127 resets, run visited all 1 properties in 266 ms. (steps per millisecond=82 )
FORMULA ShieldPPPt-PT-050B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1590616328618

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476100726"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;