About the Execution of ITS-Tools for DBSingleClientW-PT-d2m09
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 299419.00 | 0.00 | 0.00 | T | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r063-smll-174854070400097.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 DBSingleClientW-PT-d2m09, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r063-smll-174854070400097
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1748586054597
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2025-05-30 06:20:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-05-30 06:20:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 06:20:57] [INFO ] Load time of PNML (sax parser for PT used): 508 ms
[2025-05-30 06:20:57] [INFO ] Transformed 4763 places.
[2025-05-30 06:20:57] [INFO ] Transformed 2478 transitions.
[2025-05-30 06:20:57] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 701 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 4763/4763 places, 2478/2478 transitions.
Reduce places removed 3626 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 3825 rules applied. Total rules applied 3825 place count 1137 transition count 2279
Applied a total of 3825 rules in 143 ms. Remains 1137 /4763 variables (removed 3626) and now considering 2279/2478 (removed 199) transitions.
// Phase 1: matrix 2279 rows 1137 cols
[2025-05-30 06:20:57] [INFO ] Computed 2 invariants in 107 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:20:59] [INFO ] Implicit Places using invariants in 1799 ms returned []
[2025-05-30 06:20:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 06:21:00] [INFO ] State equation strengthened by 1389 read => feed constraints.
[2025-05-30 06:21:31] [INFO ] Performed 893/1137 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-05-30 06:21:37] [INFO ] Implicit Places using invariants and state equation in 37853 ms returned []
Implicit Place search using SMT with State Equation took 39706 ms to find 0 implicit places.
Running 2278 sub problems to find dead transitions.
[2025-05-30 06:21:37] [INFO ] Invariant cache hit.
[2025-05-30 06:21:37] [INFO ] State equation strengthened by 1389 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30161 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 2278/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2278 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1136/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 2278 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 1816/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 66944ms problems are : Problem set: 0 solved, 2278 unsolved
Search for dead transitions found 0 dead transitions in 67010ms
Starting structural reductions in LIVENESS mode, iteration 1 : 1137/4763 places, 2279/2478 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 106924 ms. Remains : 1137/4763 places, 2279/2478 transitions.
Discarding 1145 transitions out of 2279. Remains 1134
Initial state reduction rules removed 1 formulas.
[2025-05-30 06:22:46] [INFO ] Flatten gal took : 691 ms
[2025-05-30 06:22:46] [INFO ] Flatten gal took : 441 ms
[2025-05-30 06:22:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12406208572176867703.gal : 153 ms
[2025-05-30 06:22:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13471036923759758236.prop : 27 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/ReachabilityCardinality12406208572176867703.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13471036923759758236.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/ReachabilityCardinality13471036923759758236.prop.
RANDOM walk for 40000 steps (9216 resets) in 11357 ms. (3 steps per ms) remains 1061/1133 properties
BEST_FIRST walk for 124 steps (9 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 16 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 41 ms. (2 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 34 ms. (3 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 35 ms. (3 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 34 ms. (3 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (12 resets) in 9 ms. (12 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (12 resets) in 16 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (12 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 12 ms. (9 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (11 resets) in 15 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (11 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (12 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 20 ms. (5 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 10 ms. (11 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (10 resets) in 13 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 16 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 121 steps (12 resets) in 15 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (11 resets) in 15 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 120 steps (12 resets) in 15 ms. (7 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 122 steps (10 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (11 resets) in 14 ms. (8 steps per ms) remains 1061/1061 properties
BEST_FIRST walk for 123 steps (9 resets) in 11 ms. (10 steps per ms) remains 1061/1061 properties
Probabilistic random walk after 30000 steps, saw 13940 distinct states, run finished after 1658 ms. (steps per millisecond=18 ) properties seen :331
[2025-05-30 06:22:49] [INFO ] Invariant cache hit.
[2025-05-30 06:22:50] [INFO ] State equation strengthened by 1389 read => feed constraints.
Reachability property qltransition_1835 is true.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Reachability property qltransition_15 is true.
Reachability property qltransition_14 is true.
Reachability property qltransition_3 is true.
Reachability property qltransition_2 is true.
Reachability property qltransition_1 is true.
SDD proceeding with computation,1127 properties remain. new max is 2
SDD size :1 after 5
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Reachability property qltransition_259 is true.
Reachability property qltransition_4 is true.
SDD proceeding with computation,1125 properties remain. new max is 2
SDD size :5 after 24
Reachability property qltransition_1836 is true.
Reachability property qltransition_7 is true.
Reachability property qltransition_5 is true.
SDD proceeding with computation,1122 properties remain. new max is 2
SDD size :24 after 40
SDD proceeding with computation,1122 properties remain. new max is 4
SDD size :40 after 56
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s5 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s86 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s248 1.0)
(s250 1.0)
(s256 1.0)
(s258 1.0)
(s260 1.0)
(s262 1.0)
(s264 1.0)
(s266 1.0)
(s268 1.0)
(s270 1.0)
(s272 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s314 1.0)
(s316 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s375 1.0)
(s377 1.0)
(s379 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s418 1.0)
(s419 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s428 1.0)
(s429 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s438 1.0)
(s439 1.0)
(s443 1.0)
(s444 1.0)
(s447 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s650 1.0)
(s651 1.0)
(s654 1.0)
(s655 1.0)
(s658 1.0)
(s659 1.0)
(s662 1.0)
(s663 1.0)
(s666 1.0)
(s667 1.0)
(s670 1.0)
(s671 1.0)
(s674 1.0)
(s675 1.0)
(s678 1.0)
(s679 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s689 1.0)
(s690 1.0)
(s693 1.0)
(s694 1.0)
(s696 1.0)
(s697 1.0)
(s699 1.0)
(s700 1.0)
(s702 1.0)
(s703 1.0)
(s705 1.0)
(s706 1.0)
(s708 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 749/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 730 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 730/359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 730 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,1122 properties remain. new max is 8
SDD size :56 after 88
SDD proceeding with computation,1122 properties remain. new max is 16
SDD size :88 after 118
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/3416 variables, and 0 constraints, problems are : Problem set: 0 solved, 730 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1137 constraints, ReadFeed: 0/1389 constraints, PredecessorRefiner: 371/359 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12343ms problems are : Problem set: 0 solved, 730 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 749 out of 1137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1137/1137 places, 2279/2279 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 1077 transition count 2081
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 1077 transition count 2081
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 138 place count 1077 transition count 2063
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 178 place count 1037 transition count 2023
Iterating global reduction 1 with 40 rules applied. Total rules applied 218 place count 1037 transition count 2023
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 245 place count 1010 transition count 1989
Iterating global reduction 1 with 27 rules applied. Total rules applied 272 place count 1010 transition count 1989
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 293 place count 1010 transition count 1968
Applied a total of 293 rules in 684 ms. Remains 1010 /1137 variables (removed 127) and now considering 1968/2279 (removed 311) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 685 ms. Remains : 1010/1137 places, 1968/2279 transitions.
SDD proceeding with computation,1122 properties remain. new max is 32
SDD size :118 after 152
SDD proceeding with computation,1122 properties remain. new max is 64
SDD size :152 after 182
SDD proceeding with computation,1122 properties remain. new max is 128
SDD size :182 after 222
SDD proceeding with computation,1122 properties remain. new max is 256
SDD size :222 after 246
SDD proceeding with computation,1122 properties remain. new max is 512
SDD size :246 after 318
SDD proceeding with computation,1122 properties remain. new max is 1024
SDD size :318 after 420
RANDOM walk for 1423952 steps (326967 resets) in 120004 ms. (11 steps per ms) remains 709/730 properties
BEST_FIRST walk for 4002 steps (177 resets) in 130 ms. (30 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (166 resets) in 107 ms. (37 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (198 resets) in 118 ms. (33 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (172 resets) in 111 ms. (35 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (180 resets) in 153 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (152 resets) in 141 ms. (28 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (156 resets) in 201 ms. (19 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (181 resets) in 218 ms. (18 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (169 resets) in 155 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (177 resets) in 139 ms. (28 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (180 resets) in 157 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4001 steps (184 resets) in 151 ms. (26 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4001 steps (180 resets) in 166 ms. (23 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (171 resets) in 193 ms. (20 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (182 resets) in 192 ms. (20 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (169 resets) in 185 ms. (21 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (178 resets) in 155 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (195 resets) in 186 ms. (21 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (171 resets) in 172 ms. (23 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (178 resets) in 156 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (170 resets) in 167 ms. (23 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (198 resets) in 196 ms. (20 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (187 resets) in 167 ms. (23 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (158 resets) in 170 ms. (23 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (200 resets) in 144 ms. (27 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (174 resets) in 109 ms. (36 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (178 resets) in 125 ms. (31 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (177 resets) in 120 ms. (33 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (163 resets) in 122 ms. (32 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (175 resets) in 129 ms. (30 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (166 resets) in 123 ms. (32 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (183 resets) in 120 ms. (33 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (175 resets) in 109 ms. (36 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (164 resets) in 126 ms. (31 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (198 resets) in 152 ms. (26 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (151 resets) in 117 ms. (33 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (169 resets) in 124 ms. (32 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (166 resets) in 107 ms. (37 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (162 resets) in 164 ms. (24 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (184 resets) in 157 ms. (25 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (176 resets) in 149 ms. (26 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (170 resets) in 138 ms. (28 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (177 resets) in 151 ms. (26 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (180 resets) in 146 ms. (27 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (170 resets) in 131 ms. (30 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (196 resets) in 134 ms. (29 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (175 resets) in 121 ms. (32 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4002 steps (180 resets) in 137 ms. (29 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4004 steps (176 resets) in 127 ms. (31 steps per ms) remains 709/709 properties
BEST_FIRST walk for 4003 steps (188 resets) in 133 ms. (29 steps per ms) remains 709/709 properties
SDD proceeding with computation,1122 properties remain. new max is 2048
SDD size :420 after 596
Probabilistic random walk after 1000001 steps, saw 395873 distinct states, run finished after 21442 ms. (steps per millisecond=46 ) properties seen :600
// Phase 1: matrix 1968 rows 1010 cols
[2025-05-30 06:23:56] [INFO ] Computed 2 invariants in 68 ms
[2025-05-30 06:23:56] [INFO ] State equation strengthened by 1161 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 334/451 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 241/692 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:04] [INFO ] Deduced a trap composed of 262 places in 721 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:05] [INFO ] Deduced a trap composed of 271 places in 753 ms of which 135 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,1122 properties remain. new max is 4096
SDD size :596 after 948
[2025-05-30 06:24:05] [INFO ] Deduced a trap composed of 263 places in 670 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:06] [INFO ] Deduced a trap composed of 308 places in 745 ms of which 142 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:07] [INFO ] Deduced a trap composed of 262 places in 707 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:08] [INFO ] Deduced a trap composed of 282 places in 781 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:09] [INFO ] Deduced a trap composed of 263 places in 799 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:09] [INFO ] Deduced a trap composed of 263 places in 794 ms of which 130 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 1080/1772 variables, 692/702 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Reachability property qltransition_2274 is true.
Reachability property qltransition_2269 is true.
Reachability property qltransition_2224 is true.
Reachability property qltransition_2223 is true.
Reachability property qltransition_2222 is true.
Reachability property qltransition_2221 is true.
At refinement iteration 7 (INCLUDED_ONLY) 0/1772 variables, 273/975 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Reachability property qltransition_2087 is true.
Reachability property qltransition_2086 is true.
Reachability property qltransition_2001 is true.
Reachability property qltransition_2000 is true.
Reachability property qltransition_1999 is true.
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Reachability property qltransition_1812 is true.
Reachability property qltransition_1807 is true.
Reachability property qltransition_1624 is true.
Reachability property qltransition_1616 is true.
Reachability property qltransition_1066 is true.
Reachability property qltransition_1065 is true.
Reachability property qltransition_1064 is true.
Reachability property qltransition_747 is true.
Reachability property qltransition_327 is true.
Reachability property qltransition_318 is true.
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1156/2928 variables, 293/1268 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Reachability property qltransition_309 is true.
Reachability property qltransition_180 is true.
Reachability property qltransition_179 is true.
Reachability property qltransition_178 is true.
SDD proceeding with computation,1097 properties remain. new max is 4096
SDD size :948 after 13706
At refinement iteration 10 (INCLUDED_ONLY) 0/2928 variables, 863/2131 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2928/2978 variables, and 2131 constraints, problems are : Problem set: 0 solved, 109 unsolved in 45024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 985/1010 constraints, ReadFeed: 1136/1161 constraints, PredecessorRefiner: 109/57 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (OVERLAPS) 334/451 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (OVERLAPS) 241/692 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:46] [INFO ] Deduced a trap composed of 270 places in 794 ms of which 143 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:46] [INFO ] Deduced a trap composed of 271 places in 735 ms of which 221 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:47] [INFO ] Deduced a trap composed of 316 places in 1010 ms of which 167 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:48] [INFO ] Deduced a trap composed of 317 places in 675 ms of which 148 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:49] [INFO ] Deduced a trap composed of 271 places in 756 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:49] [INFO ] Deduced a trap composed of 290 places in 673 ms of which 134 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:50] [INFO ] Deduced a trap composed of 271 places in 672 ms of which 130 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:51] [INFO ] Deduced a trap composed of 271 places in 662 ms of which 128 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:24:52] [INFO ] Deduced a trap composed of 279 places in 663 ms of which 131 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1080/1772 variables, 692/711 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1772 variables, 273/984 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1772 variables, 11/995 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:03] [INFO ] Deduced a trap composed of 157 places in 371 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:04] [INFO ] Deduced a trap composed of 158 places in 465 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:04] [INFO ] Deduced a trap composed of 203 places in 423 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:04] [INFO ] Deduced a trap composed of 204 places in 444 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:05] [INFO ] Deduced a trap composed of 203 places in 399 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:05] [INFO ] Deduced a trap composed of 166 places in 367 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:06] [INFO ] Deduced a trap composed of 158 places in 360 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:06] [INFO ] Deduced a trap composed of 158 places in 358 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:07] [INFO ] Deduced a trap composed of 158 places in 427 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:07] [INFO ] Deduced a trap composed of 177 places in 376 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:07] [INFO ] Deduced a trap composed of 248 places in 327 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:08] [INFO ] Deduced a trap composed of 204 places in 371 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:08] [INFO ] Deduced a trap composed of 249 places in 332 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:09] [INFO ] Deduced a trap composed of 167 places in 385 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:09] [INFO ] Deduced a trap composed of 167 places in 415 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:10] [INFO ] Deduced a trap composed of 167 places in 374 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:10] [INFO ] Deduced a trap composed of 167 places in 411 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:11] [INFO ] Deduced a trap composed of 185 places in 380 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:11] [INFO ] Deduced a trap composed of 211 places in 365 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:11] [INFO ] Deduced a trap composed of 211 places in 367 ms of which 11 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1772 variables, 20/1015 constraints. Problems are: Problem set: 0 solved, 109 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:19] [INFO ] Deduced a trap composed of 178 places in 375 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:20] [INFO ] Deduced a trap composed of 159 places in 370 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:20] [INFO ] Deduced a trap composed of 204 places in 354 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:20] [INFO ] Deduced a trap composed of 204 places in 355 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:21] [INFO ] Deduced a trap composed of 159 places in 376 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:21] [INFO ] Deduced a trap composed of 159 places in 370 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:22] [INFO ] Deduced a trap composed of 159 places in 365 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:22] [INFO ] Deduced a trap composed of 178 places in 377 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:23] [INFO ] Deduced a trap composed of 178 places in 354 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:23] [INFO ] Deduced a trap composed of 178 places in 370 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:23] [INFO ] Deduced a trap composed of 222 places in 358 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:24] [INFO ] Deduced a trap composed of 222 places in 355 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:24] [INFO ] Deduced a trap composed of 186 places in 339 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:25] [INFO ] Deduced a trap composed of 159 places in 375 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:25] [INFO ] Deduced a trap composed of 204 places in 340 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:25] [INFO ] Deduced a trap composed of 204 places in 344 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:26] [INFO ] Deduced a trap composed of 159 places in 358 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 06:25:26] [INFO ] Deduced a trap composed of 160 places in 357 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1772/2978 variables, and 1033 constraints, problems are : Problem set: 0 solved, 109 unsolved in 45023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 692/1010 constraints, ReadFeed: 273/1161 constraints, PredecessorRefiner: 63/57 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90444ms problems are : Problem set: 0 solved, 109 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1968/1968 transitions.
Graph (complete) has 3639 edges and 1010 vertex of which 1009 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 1009 transition count 1951
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 298 place count 729 transition count 1179
Iterating global reduction 1 with 280 rules applied. Total rules applied 578 place count 729 transition count 1179
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 586 place count 729 transition count 1171
Discarding 225 places :
Symmetric choice reduction at 2 with 225 rule applications. Total rules 811 place count 504 transition count 946
Iterating global reduction 2 with 225 rules applied. Total rules applied 1036 place count 504 transition count 946
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1048 place count 504 transition count 934
Discarding 175 places :
Symmetric choice reduction at 3 with 175 rule applications. Total rules 1223 place count 329 transition count 684
Iterating global reduction 3 with 175 rules applied. Total rules applied 1398 place count 329 transition count 684
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Iterating post reduction 3 with 168 rules applied. Total rules applied 1566 place count 329 transition count 516
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1585 place count 310 transition count 490
Iterating global reduction 4 with 19 rules applied. Total rules applied 1604 place count 310 transition count 490
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1610 place count 310 transition count 484
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1621 place count 299 transition count 473
Iterating global reduction 5 with 11 rules applied. Total rules applied 1632 place count 299 transition count 473
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1633 place count 299 transition count 472
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1643 place count 289 transition count 462
Iterating global reduction 6 with 10 rules applied. Total rules applied 1653 place count 289 transition count 462
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1666 place count 289 transition count 449
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1670 place count 285 transition count 423
Iterating global reduction 7 with 4 rules applied. Total rules applied 1674 place count 285 transition count 423
Applied a total of 1674 rules in 273 ms. Remains 285 /1010 variables (removed 725) and now considering 423/1968 (removed 1545) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 285/1010 places, 423/1968 transitions.
SDD proceeding with computation,1097 properties remain. new max is 8192
SDD size :13706 after 25658
RANDOM walk for 4000000 steps (918863 resets) in 65870 ms. (60 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40002 steps (1817 resets) in 209 ms. (190 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1763 resets) in 247 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1793 resets) in 210 ms. (189 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1839 resets) in 228 ms. (174 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1771 resets) in 256 ms. (155 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1823 resets) in 226 ms. (176 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1803 resets) in 225 ms. (177 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1736 resets) in 240 ms. (165 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1736 resets) in 249 ms. (160 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1828 resets) in 252 ms. (158 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1777 resets) in 247 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 240 ms. (165 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1758 resets) in 223 ms. (178 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1796 resets) in 230 ms. (173 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1789 resets) in 194 ms. (205 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1772 resets) in 249 ms. (160 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1818 resets) in 230 ms. (173 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1814 resets) in 243 ms. (163 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1721 resets) in 197 ms. (202 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1784 resets) in 264 ms. (150 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1803 resets) in 251 ms. (158 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1846 resets) in 269 ms. (148 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1754 resets) in 209 ms. (190 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1771 resets) in 256 ms. (155 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1797 resets) in 259 ms. (153 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1788 resets) in 250 ms. (159 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1782 resets) in 239 ms. (166 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1812 resets) in 210 ms. (189 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1807 resets) in 206 ms. (193 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1767 resets) in 196 ms. (203 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1831 resets) in 262 ms. (152 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1726 resets) in 202 ms. (197 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 201 ms. (198 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 247 ms. (161 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1793 resets) in 253 ms. (157 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1749 resets) in 227 ms. (175 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1755 resets) in 193 ms. (206 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1798 resets) in 272 ms. (146 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1753 resets) in 219 ms. (181 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1766 resets) in 210 ms. (189 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1776 resets) in 260 ms. (153 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1774 resets) in 218 ms. (182 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1755 resets) in 235 ms. (169 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (1785 resets) in 232 ms. (171 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1761 resets) in 215 ms. (185 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1800 resets) in 230 ms. (173 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1782 resets) in 201 ms. (198 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (1774 resets) in 188 ms. (211 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40001 steps (1735 resets) in 203 ms. (196 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (1862 resets) in 195 ms. (204 steps per ms) remains 108/108 properties
Finished probabilistic random walk after 361084 steps, run visited all 108 properties in 4670 ms. (steps per millisecond=77 )
Probabilistic random walk after 361084 steps, saw 144283 distinct states, run finished after 4676 ms. (steps per millisecond=77 ) properties seen :108
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 1134 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 297409 ms.
BK_STOP 1748586354016
--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
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="DBSingleClientW-PT-d2m09"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DBSingleClientW-PT-d2m09, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r063-smll-174854070400097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m09.tgz
mv DBSingleClientW-PT-d2m09 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;