fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853300535
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.290 3600000.00 58134.00 175.40 TFTTFTFFTTTTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853300535.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Parking-PT-416, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853300535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 4.0K Apr 11 23:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 11 23:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 10 22:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 10 22:40 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.2K Apr 14 12:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 07:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 07:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 9 12:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 12:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 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 107K 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 Parking-PT-416-ReachabilityFireability-00
FORMULA_NAME Parking-PT-416-ReachabilityFireability-01
FORMULA_NAME Parking-PT-416-ReachabilityFireability-02
FORMULA_NAME Parking-PT-416-ReachabilityFireability-03
FORMULA_NAME Parking-PT-416-ReachabilityFireability-04
FORMULA_NAME Parking-PT-416-ReachabilityFireability-05
FORMULA_NAME Parking-PT-416-ReachabilityFireability-06
FORMULA_NAME Parking-PT-416-ReachabilityFireability-07
FORMULA_NAME Parking-PT-416-ReachabilityFireability-08
FORMULA_NAME Parking-PT-416-ReachabilityFireability-09
FORMULA_NAME Parking-PT-416-ReachabilityFireability-10
FORMULA_NAME Parking-PT-416-ReachabilityFireability-11
FORMULA_NAME Parking-PT-416-ReachabilityFireability-12
FORMULA_NAME Parking-PT-416-ReachabilityFireability-13
FORMULA_NAME Parking-PT-416-ReachabilityFireability-14
FORMULA_NAME Parking-PT-416-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591152982980

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:56:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:56:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:56:27] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2020-06-03 02:56:27] [INFO ] Transformed 305 places.
[2020-06-03 02:56:27] [INFO ] Transformed 433 transitions.
[2020-06-03 02:56:27] [INFO ] Found NUPN structural information;
[2020-06-03 02:56:27] [INFO ] Parsed PT model containing 305 places and 433 transitions in 285 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 128 resets, run finished after 155 ms. (steps per millisecond=64 ) properties seen :[0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0]
FORMULA Parking-PT-416-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 1, 0, 0, 0]
FORMULA Parking-PT-416-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 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 5 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 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 257 rows 305 cols
[2020-06-03 02:56:27] [INFO ] Computed 76 place invariants in 29 ms
[2020-06-03 02:56:28] [INFO ] [Real]Absence check using 72 positive place invariants in 96 ms returned unsat
[2020-06-03 02:56:28] [INFO ] [Real]Absence check using 72 positive place invariants in 35 ms returned unsat
[2020-06-03 02:56:28] [INFO ] [Real]Absence check using 72 positive place invariants in 136 ms returned sat
[2020-06-03 02:56:28] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 29 ms returned sat
[2020-06-03 02:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:29] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2020-06-03 02:56:29] [INFO ] State equation strengthened by 60 read => feed constraints.
[2020-06-03 02:56:29] [INFO ] [Real]Added 60 Read/Feed constraints in 20 ms returned sat
[2020-06-03 02:56:29] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 39 ms.
[2020-06-03 02:56:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:30] [INFO ] [Nat]Absence check using 72 positive place invariants in 96 ms returned sat
[2020-06-03 02:56:30] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 02:56:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:30] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2020-06-03 02:56:30] [INFO ] [Nat]Added 60 Read/Feed constraints in 24 ms returned sat
[2020-06-03 02:56:30] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 33 ms.
[2020-06-03 02:56:33] [INFO ] Added : 239 causal constraints over 48 iterations in 2091 ms. Result :sat
[2020-06-03 02:56:33] [INFO ] Deduced a trap composed of 36 places in 270 ms
[2020-06-03 02:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 02:56:33] [INFO ] [Real]Absence check using 72 positive place invariants in 71 ms returned sat
[2020-06-03 02:56:33] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 19 ms returned sat
[2020-06-03 02:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:34] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2020-06-03 02:56:34] [INFO ] [Real]Added 60 Read/Feed constraints in 44 ms returned sat
[2020-06-03 02:56:34] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 37 ms.
[2020-06-03 02:56:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:34] [INFO ] [Nat]Absence check using 72 positive place invariants in 154 ms returned sat
[2020-06-03 02:56:34] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 10 ms returned sat
[2020-06-03 02:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:35] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2020-06-03 02:56:35] [INFO ] [Nat]Added 60 Read/Feed constraints in 12 ms returned sat
[2020-06-03 02:56:35] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 42 ms.
[2020-06-03 02:56:37] [INFO ] Added : 247 causal constraints over 50 iterations in 2721 ms. Result :sat
[2020-06-03 02:56:38] [INFO ] Deduced a trap composed of 36 places in 120 ms
[2020-06-03 02:56:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-06-03 02:56:38] [INFO ] [Real]Absence check using 72 positive place invariants in 182 ms returned sat
[2020-06-03 02:56:38] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 6 ms returned sat
[2020-06-03 02:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:39] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2020-06-03 02:56:39] [INFO ] [Real]Added 60 Read/Feed constraints in 10 ms returned sat
[2020-06-03 02:56:39] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 37 ms.
[2020-06-03 02:56:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:39] [INFO ] [Nat]Absence check using 72 positive place invariants in 76 ms returned sat
[2020-06-03 02:56:39] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 02:56:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:39] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2020-06-03 02:56:39] [INFO ] [Nat]Added 60 Read/Feed constraints in 40 ms returned sat
[2020-06-03 02:56:39] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 65 ms.
[2020-06-03 02:56:41] [INFO ] Added : 242 causal constraints over 49 iterations in 1385 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-06-03 02:56:41] [INFO ] [Real]Absence check using 72 positive place invariants in 68 ms returned sat
[2020-06-03 02:56:41] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 5 ms returned sat
[2020-06-03 02:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:42] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2020-06-03 02:56:42] [INFO ] [Real]Added 60 Read/Feed constraints in 11 ms returned sat
[2020-06-03 02:56:42] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 68 ms.
[2020-06-03 02:56:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:42] [INFO ] [Nat]Absence check using 72 positive place invariants in 31 ms returned sat
[2020-06-03 02:56:42] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2020-06-03 02:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:42] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2020-06-03 02:56:42] [INFO ] [Nat]Added 60 Read/Feed constraints in 8 ms returned sat
[2020-06-03 02:56:42] [INFO ] Computed and/alt/rep : 256/848/256 causal constraints in 21 ms.
[2020-06-03 02:56:44] [INFO ] Added : 239 causal constraints over 48 iterations in 1440 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
FORMULA Parking-PT-416-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-416-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 31000 steps, including 360 resets, run finished after 188 ms. (steps per millisecond=164 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 28700 steps, including 316 resets, run finished after 103 ms. (steps per millisecond=278 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 25800 steps, including 316 resets, run finished after 115 ms. (steps per millisecond=224 ) properties seen :[0, 0, 0, 1] could not realise parikh vector
FORMULA Parking-PT-416-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21300 steps, including 275 resets, run finished after 78 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 305 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 305/305 places, 257/257 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 305 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 297 transition count 249
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 297 transition count 241
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 289 transition count 241
Symmetric choice reduction at 2 with 3 rule applications. Total rules 35 place count 289 transition count 241
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 41 place count 286 transition count 238
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 63 place count 275 transition count 227
Free-agglomeration rule applied 46 times.
Iterating global reduction 2 with 46 rules applied. Total rules applied 109 place count 275 transition count 181
Reduce places removed 46 places and 0 transitions.
Discarding 53 places :
Also discarding 38 output transitions
Drop transitions removed 38 transitions
Graph (complete) has 482 edges and 229 vertex of which 176 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.6 ms
Iterating post reduction 2 with 47 rules applied. Total rules applied 156 place count 176 transition count 143
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 162 place count 176 transition count 137
Applied a total of 162 rules in 224 ms. Remains 176 /305 variables (removed 129) and now considering 137/257 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 176/305 places, 137/257 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2069 ms. (steps per millisecond=483 ) properties seen :[0, 1, 0]
FORMULA Parking-PT-416-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1192 ms. (steps per millisecond=838 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties seen :[0, 0]
// Phase 1: matrix 137 rows 176 cols
[2020-06-03 02:56:49] [INFO ] Computed 60 place invariants in 22 ms
[2020-06-03 02:56:49] [INFO ] [Real]Absence check using 57 positive place invariants in 34 ms returned sat
[2020-06-03 02:56:49] [INFO ] [Real]Absence check using 57 positive and 3 generalized place invariants in 3 ms returned sat
[2020-06-03 02:56:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:49] [INFO ] [Real]Absence check using state equation in 393 ms returned sat
[2020-06-03 02:56:49] [INFO ] State equation strengthened by 97 read => feed constraints.
[2020-06-03 02:56:49] [INFO ] [Real]Added 97 Read/Feed constraints in 22 ms returned sat
[2020-06-03 02:56:49] [INFO ] Computed and/alt/rep : 136/438/136 causal constraints in 39 ms.
[2020-06-03 02:56:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:49] [INFO ] [Nat]Absence check using 57 positive place invariants in 48 ms returned sat
[2020-06-03 02:56:49] [INFO ] [Nat]Absence check using 57 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 02:56:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:50] [INFO ] [Nat]Absence check using state equation in 506 ms returned sat
[2020-06-03 02:56:50] [INFO ] [Nat]Added 97 Read/Feed constraints in 34 ms returned sat
[2020-06-03 02:56:50] [INFO ] Computed and/alt/rep : 136/438/136 causal constraints in 38 ms.
[2020-06-03 02:56:51] [INFO ] Added : 136 causal constraints over 28 iterations in 815 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2020-06-03 02:56:51] [INFO ] [Real]Absence check using 57 positive place invariants in 103 ms returned sat
[2020-06-03 02:56:51] [INFO ] [Real]Absence check using 57 positive and 3 generalized place invariants in 2 ms returned sat
[2020-06-03 02:56:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:51] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2020-06-03 02:56:51] [INFO ] [Real]Added 97 Read/Feed constraints in 13 ms returned sat
[2020-06-03 02:56:51] [INFO ] Computed and/alt/rep : 136/438/136 causal constraints in 12 ms.
[2020-06-03 02:56:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:52] [INFO ] [Nat]Absence check using 57 positive place invariants in 311 ms returned sat
[2020-06-03 02:56:52] [INFO ] [Nat]Absence check using 57 positive and 3 generalized place invariants in 4 ms returned sat
[2020-06-03 02:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:52] [INFO ] [Nat]Absence check using state equation in 249 ms returned sat
[2020-06-03 02:56:52] [INFO ] [Nat]Added 97 Read/Feed constraints in 34 ms returned sat
[2020-06-03 02:56:52] [INFO ] Computed and/alt/rep : 136/438/136 causal constraints in 17 ms.
[2020-06-03 02:56:53] [INFO ] Added : 136 causal constraints over 28 iterations in 624 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
Incomplete Parikh walk after 18100 steps, including 140 resets, run finished after 84 ms. (steps per millisecond=215 ) properties seen :[0, 1] could not realise parikh vector
FORMULA Parking-PT-416-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17700 steps, including 155 resets, run finished after 59 ms. (steps per millisecond=300 ) properties seen :[0] could not realise parikh vector
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 176/176 places, 137/137 transitions.
Discarding 55 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Graph (complete) has 367 edges and 176 vertex of which 121 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 121 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 121 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 120 transition count 92
Applied a total of 7 rules in 21 ms. Remains 120 /176 variables (removed 56) and now considering 92/137 (removed 45) transitions.
Finished structural reductions, in 1 iterations. Remains : 120/176 places, 92/137 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 790 ms. (steps per millisecond=1265 ) properties seen :[0]
Finished probabilistic random walk after 3624 steps, run visited all 1 properties in 19 ms. (steps per millisecond=190 )
Probabilistic random walk after 3624 steps, saw 865 distinct states, run finished after 19 ms. (steps per millisecond=190 ) properties seen :[1]
FORMULA Parking-PT-416-ReachabilityFireability-04 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="Parking-PT-416"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Parking-PT-416, 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 r174-csrt-158987853300535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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