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.r180-ebro-158987899900238.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DES-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-ebro-158987899900238
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.0K Mar 30 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 30 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Apr 8 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 27 08:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 08:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 26 08:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 73K Mar 24 05:37 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 DES-PT-05b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591177282355

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 09:41:25] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 09:41:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 09:41:25] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2020-06-03 09:41:25] [INFO ] Transformed 300 places.
[2020-06-03 09:41:25] [INFO ] Transformed 251 transitions.
[2020-06-03 09:41:25] [INFO ] Found NUPN structural information;
[2020-06-03 09:41:25] [INFO ] Parsed PT model containing 300 places and 251 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 89 resets, run finished after 131 ms. (steps per millisecond=76 ) properties seen :[1, 0, 1, 1, 1, 0, 0, 0, 1, 0]
FORMULA DES-PT-05b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-05b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 1, 0, 0]
FORMULA DES-PT-05b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 251 rows 300 cols
[2020-06-03 09:41:26] [INFO ] Computed 65 place invariants in 34 ms
[2020-06-03 09:41:26] [INFO ] [Real]Absence check using 40 positive place invariants in 60 ms returned sat
[2020-06-03 09:41:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 26 ms returned sat
[2020-06-03 09:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:27] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2020-06-03 09:41:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:41:27] [INFO ] [Nat]Absence check using 40 positive place invariants in 79 ms returned sat
[2020-06-03 09:41:27] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 09:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:27] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2020-06-03 09:41:28] [INFO ] Deduced a trap composed of 13 places in 232 ms
[2020-06-03 09:41:28] [INFO ] Deduced a trap composed of 23 places in 147 ms
[2020-06-03 09:41:28] [INFO ] Deduced a trap composed of 25 places in 77 ms
[2020-06-03 09:41:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 607 ms
[2020-06-03 09:41:28] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 32 ms.
[2020-06-03 09:41:30] [INFO ] Added : 240 causal constraints over 49 iterations in 2350 ms. Result :sat
[2020-06-03 09:41:31] [INFO ] Deduced a trap composed of 42 places in 118 ms
[2020-06-03 09:41:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-06-03 09:41:31] [INFO ] [Real]Absence check using 40 positive place invariants in 42 ms returned sat
[2020-06-03 09:41:31] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 09:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:31] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2020-06-03 09:41:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:41:32] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 09:41:32] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 50 ms returned sat
[2020-06-03 09:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:32] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2020-06-03 09:41:32] [INFO ] Deduced a trap composed of 8 places in 198 ms
[2020-06-03 09:41:33] [INFO ] Deduced a trap composed of 15 places in 110 ms
[2020-06-03 09:41:33] [INFO ] Deduced a trap composed of 31 places in 129 ms
[2020-06-03 09:41:33] [INFO ] Deduced a trap composed of 31 places in 136 ms
[2020-06-03 09:41:33] [INFO ] Deduced a trap composed of 13 places in 93 ms
[2020-06-03 09:41:33] [INFO ] Deduced a trap composed of 32 places in 118 ms
[2020-06-03 09:41:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 998 ms
[2020-06-03 09:41:33] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 29 ms.
[2020-06-03 09:41:36] [INFO ] Added : 237 causal constraints over 48 iterations in 2543 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-03 09:41:36] [INFO ] [Real]Absence check using 40 positive place invariants in 40 ms returned sat
[2020-06-03 09:41:36] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 35 ms returned sat
[2020-06-03 09:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:37] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2020-06-03 09:41:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:41:37] [INFO ] [Nat]Absence check using 40 positive place invariants in 76 ms returned sat
[2020-06-03 09:41:37] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 73 ms returned sat
[2020-06-03 09:41:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:38] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2020-06-03 09:41:38] [INFO ] Deduced a trap composed of 13 places in 452 ms
[2020-06-03 09:41:39] [INFO ] Deduced a trap composed of 9 places in 429 ms
[2020-06-03 09:41:39] [INFO ] Deduced a trap composed of 31 places in 282 ms
[2020-06-03 09:41:39] [INFO ] Deduced a trap composed of 20 places in 125 ms
[2020-06-03 09:41:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1455 ms
[2020-06-03 09:41:39] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 113 ms.
[2020-06-03 09:41:42] [INFO ] Added : 242 causal constraints over 50 iterations in 2505 ms. Result :(error "Failed to check-sat")
[2020-06-03 09:41:42] [INFO ] [Real]Absence check using 40 positive place invariants in 37 ms returned sat
[2020-06-03 09:41:42] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 32 ms returned sat
[2020-06-03 09:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:42] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2020-06-03 09:41:43] [INFO ] Deduced a trap composed of 28 places in 183 ms
[2020-06-03 09:41:43] [INFO ] Deduced a trap composed of 9 places in 232 ms
[2020-06-03 09:41:43] [INFO ] Deduced a trap composed of 14 places in 162 ms
[2020-06-03 09:41:43] [INFO ] Deduced a trap composed of 18 places in 296 ms
[2020-06-03 09:41:44] [INFO ] Deduced a trap composed of 36 places in 168 ms
[2020-06-03 09:41:44] [INFO ] Deduced a trap composed of 14 places in 55 ms
[2020-06-03 09:41:44] [INFO ] Deduced a trap composed of 12 places in 20 ms
[2020-06-03 09:41:44] [INFO ] Deduced a trap composed of 10 places in 16 ms
[2020-06-03 09:41:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1358 ms
[2020-06-03 09:41:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:41:44] [INFO ] [Nat]Absence check using 40 positive place invariants in 60 ms returned sat
[2020-06-03 09:41:44] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2020-06-03 09:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:44] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2020-06-03 09:41:45] [INFO ] Deduced a trap composed of 12 places in 215 ms
[2020-06-03 09:41:45] [INFO ] Deduced a trap composed of 8 places in 192 ms
[2020-06-03 09:41:45] [INFO ] Deduced a trap composed of 27 places in 163 ms
[2020-06-03 09:41:45] [INFO ] Deduced a trap composed of 31 places in 149 ms
[2020-06-03 09:41:45] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 14 places in 105 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 13 places in 102 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 32 places in 141 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 18 places in 106 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 18 places in 109 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 34 places in 272 ms
[2020-06-03 09:41:46] [INFO ] Deduced a trap composed of 23 places in 89 ms
[2020-06-03 09:41:47] [INFO ] Deduced a trap composed of 24 places in 86 ms
[2020-06-03 09:41:47] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2209 ms
[2020-06-03 09:41:47] [INFO ] Computed and/alt/rep : 250/475/250 causal constraints in 96 ms.
[2020-06-03 09:41:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t212 0) (and (and (> t5 0) (< o5 o212)) (and (> t34 0) (< o34 o212))))") while checking expression at index 3
Incomplete Parikh walk after 62600 steps, including 774 resets, run finished after 367 ms. (steps per millisecond=170 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 58200 steps, including 705 resets, run finished after 250 ms. (steps per millisecond=232 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 300 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 300/300 places, 251/251 transitions.
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Graph (complete) has 561 edges and 300 vertex of which 294 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.18 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 294 transition count 226
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 275 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 41 place count 275 transition count 218
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 57 place count 267 transition count 218
Symmetric choice reduction at 2 with 19 rule applications. Total rules 76 place count 267 transition count 218
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 19 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 114 place count 248 transition count 199
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 248 transition count 198
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 247 transition count 198
Symmetric choice reduction at 2 with 15 rule applications. Total rules 131 place count 247 transition count 198
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 161 place count 232 transition count 183
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 176 place count 232 transition count 168
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 179 place count 230 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 179 place count 230 transition count 165
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 183 place count 228 transition count 165
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 317 place count 161 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 321 place count 159 transition count 100
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 159 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 323 place count 158 transition count 99
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 325 place count 158 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 326 place count 157 transition count 98
Applied a total of 326 rules in 226 ms. Remains 157 /300 variables (removed 143) and now considering 98/251 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 157/300 places, 98/251 transitions.
Incomplete random walk after 1000000 steps, including 34804 resets, run finished after 3666 ms. (steps per millisecond=272 ) properties seen :[0, 1, 0]
FORMULA DES-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6207 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties seen :[1, 0]
FORMULA DES-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 7361 resets, run finished after 1679 ms. (steps per millisecond=595 ) properties seen :[0]
// Phase 1: matrix 98 rows 157 cols
[2020-06-03 09:41:57] [INFO ] Computed 65 place invariants in 14 ms
[2020-06-03 09:41:57] [INFO ] [Real]Absence check using 40 positive place invariants in 87 ms returned sat
[2020-06-03 09:41:57] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 33 ms returned sat
[2020-06-03 09:41:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:58] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2020-06-03 09:41:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2020-06-03 09:41:58] [INFO ] [Real]Added 8 Read/Feed constraints in 5 ms returned sat
[2020-06-03 09:41:58] [INFO ] Deduced a trap composed of 16 places in 149 ms
[2020-06-03 09:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2020-06-03 09:41:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 09:41:58] [INFO ] [Nat]Absence check using 40 positive place invariants in 28 ms returned sat
[2020-06-03 09:41:58] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2020-06-03 09:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 09:41:58] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2020-06-03 09:41:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 4 ms returned sat
[2020-06-03 09:41:58] [INFO ] Deduced a trap composed of 16 places in 60 ms
[2020-06-03 09:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-06-03 09:41:58] [INFO ] Computed and/alt/rep : 97/501/97 causal constraints in 12 ms.
[2020-06-03 09:41:59] [INFO ] Added : 92 causal constraints over 19 iterations in 544 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 29900 steps, including 1485 resets, run finished after 117 ms. (steps per millisecond=255 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 157 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 156 transition count 97
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 156 transition count 95
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 154 transition count 95
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 145 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 26 place count 144 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 143 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 142 transition count 88
Applied a total of 28 rules in 43 ms. Remains 142 /157 variables (removed 15) and now considering 88/98 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 142/157 places, 88/98 transitions.
Incomplete random walk after 1000000 steps, including 48622 resets, run finished after 3480 ms. (steps per millisecond=287 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9263 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties seen :[0]
Finished probabilistic random walk after 8399131 steps, run visited all 1 properties in 26905 ms. (steps per millisecond=312 )
Probabilistic random walk after 8399131 steps, saw 1169067 distinct states, run finished after 26905 ms. (steps per millisecond=312 ) properties seen :[1]
FORMULA DES-PT-05b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is DES-PT-05b, 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 r180-ebro-158987899900238"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b 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 ;