About the Execution of ITS-Tools for CopsAndRobbers-PT-HRL017X005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 110786.00 | 0.00 | 0.00 | TTTTTFFTTTFFTFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339500214.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is CopsAndRobbers-PT-HRL017X005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339500214
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 11K Jun 6 08:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Jun 6 08:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 6 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Jun 6 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Jun 6 11:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 11:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 15K Jun 6 09:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 6 09:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 6 09:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 6 09:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Jun 6 11:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Jun 6 11:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 11 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 175K Jun 5 20:08 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-00
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-01
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-02
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-03
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-04
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-05
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-06
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-08
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-09
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-10
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-11
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-12
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-13
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-14
FORMULA_NAME CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1749342218020
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CopsAndRobbers-PT-HRL017X005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-08 00:23:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 00:23:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 00:23:39] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-06-08 00:23:39] [INFO ] Transformed 95 places.
[2025-06-08 00:23:39] [INFO ] Transformed 213 transitions.
[2025-06-08 00:23:39] [INFO ] Parsed PT model containing 95 places and 213 transitions and 1110 arcs in 156 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40007 steps (253 resets) in 1042 ms. (38 steps per ms) remains 6/16 properties
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-08 00:23:39] [INFO ] Flatten gal took : 91 ms
[2025-06-08 00:23:39] [INFO ] Flatten gal took : 47 ms
[2025-06-08 00:23:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3524241563259396127.gal : 31 ms
[2025-06-08 00:23:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6291233234006417055.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3524241563259396127.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6291233234006417055.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (126 resets) in 725 ms. (55 steps per ms) remains 6/6 properties
Loading property file /tmp/ReachabilityCardinality6291233234006417055.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :14 after 16
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :16 after 290
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :290 after 298
BEST_FIRST walk for 40004 steps (141 resets) in 300 ms. (132 steps per ms) remains 5/6 properties
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :298 after 2828
BEST_FIRST walk for 40003 steps (126 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :2828 after 18693
BEST_FIRST walk for 40004 steps (139 resets) in 620 ms. (64 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (169 resets) in 183 ms. (217 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (72 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
// Phase 1: matrix 213 rows 95 cols
[2025-06-08 00:23:40] [INFO ] Computed 21 invariants in 15 ms
[2025-06-08 00:23:40] [INFO ] State equation strengthened by 40 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-12 is UNSAT
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-00 is UNSAT
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-04 is UNSAT
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-15 is UNSAT
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 12/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/12 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 19/94 variables, 8/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/95 variables, 1/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 213/308 variables, 95/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 40/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/308 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 156 constraints, problems are : Problem set: 4 solved, 1 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 54/89 variables, 12/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/94 variables, 5/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/95 variables, 1/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 213/308 variables, 95/116 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 40/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/308 variables, 0/156 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 156 constraints, problems are : Problem set: 4 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 790ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 35 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 213/213 transitions.
Graph (complete) has 598 edges and 95 vertex of which 82 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 33 ms. Remains 82 /95 variables (removed 13) and now considering 213/213 (removed 0) transitions.
Running 179 sub problems to find dead transitions.
// Phase 1: matrix 213 rows 82 cols
[2025-06-08 00:23:41] [INFO ] Computed 20 invariants in 7 ms
[2025-06-08 00:23:41] [INFO ] State equation strengthened by 40 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 17/17 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/20 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 213/291 variables, 78/98 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 40/138 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/138 constraints. Problems are: Problem set: 12 solved, 167 unsolved
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :18693 after 786150
At refinement iteration 8 (OVERLAPS) 4/295 variables, 4/142 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/295 variables, 0/142 constraints. Problems are: Problem set: 12 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:23:50] [INFO ] Deduced a trap along path composed of 6 places in 67 ms of which 13 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/295 variables, 1/143 constraints. Problems are: Problem set: 12 solved, 167 unsolved
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :786150 after 1.0003e+06
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 0/143 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 0/295 variables, 0/143 constraints. Problems are: Problem set: 12 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 143 constraints, problems are : Problem set: 12 solved, 167 unsolved in 16359 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 12 solved, 167 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 17/17 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/20 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 213/291 variables, 78/98 constraints. Problems are: Problem set: 12 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 40/138 constraints. Problems are: Problem set: 12 solved, 167 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.0003e+06 after 1.50213e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 142/280 constraints. Problems are: Problem set: 12 solved, 167 unsolved
SMT process timed out in 36573ms, After SMT, problems are : Problem set: 12 solved, 167 unsolved
Search for dead transitions found 12 dead transitions in 36576ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 12 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/95 places, 201/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36641 ms. Remains : 82/95 places, 201/213 transitions.
RANDOM walk for 40005 steps (238 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (138 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :1.50213e+06 after 2.993e+06
Interrupted probabilistic random walk after 1777966 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :0 out of 1
Probabilistic random walk after 1777966 steps, saw 403796 distinct states, run finished after 3006 ms. (steps per millisecond=591 ) properties seen :0
// Phase 1: matrix 201 rows 82 cols
[2025-06-08 00:24:20] [INFO ] Computed 20 invariants in 9 ms
[2025-06-08 00:24:20] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/55 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/60 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/247 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 19/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 36/283 variables, 21/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 15/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 20/55 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/60 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/61 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/247 variables, 61/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 19/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 36/283 variables, 21/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 15/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/283 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 136 constraints, problems are : Problem set: 0 solved, 1 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1033ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 35 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 201/201 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 201/201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 82/82 places, 201/201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2025-06-08 00:24:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:24:22] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-08 00:24:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-08 00:24:22] [INFO ] State equation strengthened by 34 read => feed constraints.
[2025-06-08 00:24:22] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-08 00:24:22] [INFO ] Redundant transitions in 8 ms returned []
Running 167 sub problems to find dead transitions.
[2025-06-08 00:24:22] [INFO ] Invariant cache hit.
[2025-06-08 00:24:22] [INFO ] State equation strengthened by 34 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 201/279 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 34/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-08 00:24:26] [INFO ] Deduced a trap along path composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 4/283 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/283 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 137 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14742 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 201/279 variables, 78/98 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/279 variables, 34/132 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :2.993e+06 after 7.58627e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 142/274 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SMT process timed out in 44842ms, After SMT, problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 44843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45101 ms. Remains : 82/82 places, 201/201 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 82 transition count 186
Applied a total of 15 rules in 8 ms. Remains 82 /82 variables (removed 0) and now considering 186/201 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 186 rows 82 cols
[2025-06-08 00:25:07] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 00:25:07] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-08 00:25:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-06-08 00:25:07] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-08 00:25:07] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-08 00:25:07] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-08 00:25:07] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-08 00:25:07] [INFO ] Flatten gal took : 17 ms
[2025-06-08 00:25:07] [INFO ] Flatten gal took : 14 ms
[2025-06-08 00:25:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13514466463446081532.gal : 4 ms
[2025-06-08 00:25:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17594699151529231667.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13514466463446081532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17594699151529231667.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality17594699151529231667.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :18 after 360
Invariant property CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,396,0.03412,5684,2,182,8,1325,6,0,492,439,0
Total reachable state count : 396
Verifying 1 reachability properties.
Invariant property CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07,1,0.036647,5812,2,83,8,1325,7,0,552,439,0
Over-approximation ignoring read arcs solved 0 properties in 234 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-08 00:25:07] [INFO ] Flatten gal took : 16 ms
[2025-06-08 00:25:07] [INFO ] Applying decomposition
[2025-06-08 00:25:07] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17675192107968596326.txt' '-o' '/tmp/graph17675192107968596326.bin' '-w' '/tmp/graph17675192107968596326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17675192107968596326.bin' '-l' '-1' '-v' '-w' '/tmp/graph17675192107968596326.weights' '-q' '0' '-e' '0.001'
[2025-06-08 00:25:07] [INFO ] Decomposing Gal with order
[2025-06-08 00:25:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-08 00:25:07] [INFO ] Removed a total of 340 redundant transitions.
[2025-06-08 00:25:07] [INFO ] Flatten gal took : 66 ms
[2025-06-08 00:25:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 11 ms.
[2025-06-08 00:25:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3172471926081468826.gal : 4 ms
[2025-06-08 00:25:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6835000845489559723.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3172471926081468826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6835000845489559723.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6835000845489559723.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 56
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :56 after 462
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :462 after 5742
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5742 after 7192
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :7192 after 98383
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :98383 after 422227
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :422227 after 466580
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :466580 after 1.24907e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.24907e+06 after 2.06354e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.06354e+06 after 3.91938e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :3.91938e+06 after 7.32438e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,2.10266e+07,20.9785,207256,2,22258,18,732223,7,0,672,908025,0
Total reachable state count : 21026621
Verifying 1 reachability properties.
Invariant property CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07 is true.
FORMULA CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CopsAndRobbers-PT-HRL017X005-ReachabilityCardinality-2025-07,0,20.9971,207256,1,0,18,732223,7,0,721,908025,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 109627 ms.
BK_STOP 1749342328806
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="CopsAndRobbers-PT-HRL017X005"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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-5832"
echo " Executing tool itstools"
echo " Input is CopsAndRobbers-PT-HRL017X005, 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 r254-tall-174931339500214"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CopsAndRobbers-PT-HRL017X005.tgz
mv CopsAndRobbers-PT-HRL017X005 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.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 '
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 ;