About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2277.539 | 89757.00 | 175790.00 | 102.70 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r299-tajo-171654455700152.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S02J06T06, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700152
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 22K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.9K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 11 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 216K Apr 11 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 601K May 18 16:43 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 1717141572210
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-31 07:46:13] [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]
[2024-05-31 07:46:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:46:13] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-05-31 07:46:13] [INFO ] Transformed 536 places.
[2024-05-31 07:46:13] [INFO ] Transformed 1064 transitions.
[2024-05-31 07:46:13] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 293 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 536/536 places, 1064/1064 transitions.
Ensure Unique test removed 2 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 152 rules applied. Total rules applied 152 place count 534 transition count 914
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 206 place count 480 transition count 914
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 206 place count 480 transition count 854
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 326 place count 420 transition count 854
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 422 place count 372 transition count 806
Applied a total of 422 rules in 132 ms. Remains 372 /536 variables (removed 164) and now considering 806/1064 (removed 258) transitions.
Running 804 sub problems to find dead transitions.
[2024-05-31 07:46:14] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 372 cols
[2024-05-31 07:46:14] [INFO ] Computed 48 invariants in 43 ms
[2024-05-31 07:46:14] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 20 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 46 places in 223 ms of which 2 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 46 places in 238 ms of which 1 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 0 ms to minimize.
[2024-05-31 07:46:21] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-31 07:46:22] [INFO ] Deduced a trap composed of 46 places in 408 ms of which 1 ms to minimize.
[2024-05-31 07:46:22] [INFO ] Deduced a trap composed of 120 places in 216 ms of which 3 ms to minimize.
[2024-05-31 07:46:22] [INFO ] Deduced a trap composed of 47 places in 66 ms of which 2 ms to minimize.
[2024-05-31 07:46:23] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 2 ms to minimize.
[2024-05-31 07:46:24] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 4 ms to minimize.
[2024-05-31 07:46:29] [INFO ] Deduced a trap composed of 198 places in 239 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-31 07:46:34] [INFO ] Deduced a trap composed of 126 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/1166 variables, and 52 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 804/804 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 804 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/370 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/370 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 804 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/370 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-31 07:46:39] [INFO ] Deduced a trap composed of 2 places in 193 ms of which 2 ms to minimize.
[2024-05-31 07:46:40] [INFO ] Deduced a trap composed of 22 places in 186 ms of which 2 ms to minimize.
[2024-05-31 07:46:40] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-05-31 07:46:40] [INFO ] Deduced a trap composed of 98 places in 186 ms of which 2 ms to minimize.
[2024-05-31 07:46:40] [INFO ] Deduced a trap composed of 120 places in 146 ms of which 2 ms to minimize.
[2024-05-31 07:46:42] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 3 ms to minimize.
[2024-05-31 07:46:42] [INFO ] Deduced a trap composed of 199 places in 173 ms of which 2 ms to minimize.
[2024-05-31 07:46:44] [INFO ] Deduced a trap composed of 161 places in 180 ms of which 2 ms to minimize.
[2024-05-31 07:46:44] [INFO ] Deduced a trap composed of 145 places in 151 ms of which 2 ms to minimize.
[2024-05-31 07:46:44] [INFO ] Deduced a trap composed of 151 places in 161 ms of which 3 ms to minimize.
[2024-05-31 07:46:46] [INFO ] Deduced a trap composed of 219 places in 185 ms of which 3 ms to minimize.
[2024-05-31 07:46:46] [INFO ] Deduced a trap composed of 151 places in 175 ms of which 2 ms to minimize.
[2024-05-31 07:46:46] [INFO ] Deduced a trap composed of 144 places in 229 ms of which 3 ms to minimize.
[2024-05-31 07:46:46] [INFO ] Deduced a trap composed of 153 places in 167 ms of which 3 ms to minimize.
[2024-05-31 07:46:47] [INFO ] Deduced a trap composed of 217 places in 167 ms of which 2 ms to minimize.
[2024-05-31 07:46:47] [INFO ] Deduced a trap composed of 165 places in 146 ms of which 2 ms to minimize.
[2024-05-31 07:46:48] [INFO ] Deduced a trap composed of 174 places in 163 ms of which 2 ms to minimize.
[2024-05-31 07:46:48] [INFO ] Deduced a trap composed of 200 places in 177 ms of which 2 ms to minimize.
[2024-05-31 07:46:48] [INFO ] Deduced a trap composed of 205 places in 161 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/370 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 804 unsolved
[2024-05-31 07:46:52] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 2 ms to minimize.
[2024-05-31 07:46:52] [INFO ] Deduced a trap composed of 170 places in 160 ms of which 2 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 160 places in 146 ms of which 2 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 6 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 150 places in 145 ms of which 2 ms to minimize.
[2024-05-31 07:46:53] [INFO ] Deduced a trap composed of 160 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/1166 variables, and 78 constraints, problems are : Problem set: 0 solved, 804 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 25/33 constraints, State Equation: 0/372 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/804 constraints, Known Traps: 38/38 constraints]
After SMT, in 41407ms problems are : Problem set: 0 solved, 804 unsolved
Search for dead transitions found 0 dead transitions in 41481ms
[2024-05-31 07:46:55] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
[2024-05-31 07:46:55] [INFO ] Invariant cache hit.
[2024-05-31 07:46:56] [INFO ] Implicit Places using invariants in 473 ms returned [74, 82, 167, 177, 213, 348]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 500 ms to find 6 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 366/536 places, 806/1064 transitions.
Applied a total of 0 rules in 6 ms. Remains 366 /366 variables (removed 0) and now considering 806/806 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 42184 ms. Remains : 366/536 places, 806/1064 transitions.
Initial state reduction rules removed 2 formulas.
RANDOM walk for 40000 steps (21 resets) in 6004 ms. (6 steps per ms) remains 96/804 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (9 resets) in 119 ms. (33 steps per ms) remains 96/96 properties
[2024-05-31 07:46:58] [INFO ] Flatten gal took : 214 ms
BEST_FIRST walk for 4000 steps (9 resets) in 190 ms. (20 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 62 ms. (63 steps per ms) remains 96/96 properties
[2024-05-31 07:46:58] [INFO ] Flatten gal took : 119 ms
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 63 ms. (62 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 96/96 properties
[2024-05-31 07:46:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4858690487728666997.gal : 63 ms
[2024-05-31 07:46:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality809328729288088974.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4858690487728666997.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality809328729288088974.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (8 resets) in 93 ms. (42 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 96/96 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 139 ms. (28 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 36 ms. (108 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 66 ms. (59 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 96/96 properties
Loading property file /tmp/ReachabilityCardinality809328729288088974.prop.
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (9 resets) in 63 ms. (62 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (9 resets) in 33 ms. (117 steps per ms) remains 96/96 properties
SDD proceeding with computation,96 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (9 resets) in 48 ms. (81 steps per ms) remains 96/96 properties
SDD proceeding with computation,96 properties remain. new max is 8
SDD size :3 after 6
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 96/96 properties
SDD proceeding with computation,96 properties remain. new max is 16
SDD size :6 after 7
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 96/96 properties
SDD proceeding with computation,96 properties remain. new max is 32
SDD size :7 after 11
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 96/96 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 96/96 properties
SDD proceeding with computation,96 properties remain. new max is 64
SDD size :11 after 53
[2024-05-31 07:46:59] [INFO ] Flow matrix only has 794 transitions (discarded 12 similar events)
// Phase 1: matrix 794 rows 366 cols
[2024-05-31 07:46:59] [INFO ] Computed 42 invariants in 58 ms
[2024-05-31 07:46:59] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,96 properties remain. new max is 128
SDD size :53 after 68
SDD proceeding with computation,96 properties remain. new max is 256
SDD size :68 after 78
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 16/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem qltransition_1 is UNSAT
FORMULA QuasiLiveness FALSE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
SMT process timed out in 1027ms, After SMT, problems are : Problem set: 0 solved, 96 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 366 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 366/366 places, 806/806 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 363 transition count 803
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 363 transition count 803
Applied a total of 6 rules in 77 ms. Remains 363 /366 variables (removed 3) and now considering 803/806 (removed 3) transitions.
Running 801 sub problems to find dead transitions.
[2024-05-31 07:47:00] [INFO ] Flow matrix only has 791 transitions (discarded 12 similar events)
// Phase 1: matrix 791 rows 363 cols
[2024-05-31 07:47:00] [INFO ] Computed 42 invariants in 13 ms
[2024-05-31 07:47:00] [INFO ] State equation strengthened by 72 read => feed constraints.
SDD proceeding with computation,96 properties remain. new max is 512
SDD size :78 after 1903
SDD proceeding with computation,96 properties remain. new max is 1024
SDD size :1903 after 1949
SDD proceeding with computation,96 properties remain. new max is 2048
SDD size :1949 after 2093
SDD proceeding with computation,96 properties remain. new max is 4096
SDD size :2093 after 3179
SDD proceeding with computation,96 properties remain. new max is 8192
SDD size :3179 after 4569
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
[2024-05-31 07:47:07] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 4 ms to minimize.
SDD proceeding with computation,96 properties remain. new max is 16384
SDD size :4569 after 10659
[2024-05-31 07:47:11] [INFO ] Deduced a trap composed of 47 places in 3667 ms of which 24 ms to minimize.
[2024-05-31 07:47:11] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 1 ms to minimize.
[2024-05-31 07:47:11] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-31 07:47:11] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
[2024-05-31 07:47:15] [INFO ] Deduced a trap composed of 132 places in 3467 ms of which 3 ms to minimize.
[2024-05-31 07:47:15] [INFO ] Deduced a trap composed of 128 places in 287 ms of which 2 ms to minimize.
[2024-05-31 07:47:15] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-31 07:47:15] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-05-31 07:47:15] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-31 07:47:16] [INFO ] Deduced a trap composed of 120 places in 187 ms of which 3 ms to minimize.
[2024-05-31 07:47:17] [INFO ] Deduced a trap composed of 159 places in 168 ms of which 3 ms to minimize.
[2024-05-31 07:47:20] [INFO ] Deduced a trap composed of 141 places in 181 ms of which 3 ms to minimize.
[2024-05-31 07:47:20] [INFO ] Deduced a trap composed of 131 places in 241 ms of which 3 ms to minimize.
[2024-05-31 07:47:21] [INFO ] Deduced a trap composed of 106 places in 241 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/1154 variables, and 55 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 801/801 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 801 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/361 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 801 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/361 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 801 unsolved
SDD proceeding with computation,96 properties remain. new max is 32768
SDD size :10659 after 115735
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 801 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 361/1154 variables, and 55 constraints, problems are : Problem set: 0 solved, 801 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/363 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/801 constraints, Known Traps: 15/15 constraints]
After SMT, in 41060ms problems are : Problem set: 0 solved, 801 unsolved
Search for dead transitions found 0 dead transitions in 41068ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41149 ms. Remains : 363/366 places, 803/806 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 88223 ms.
BK_STOP 1717141661967
--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="PolyORBLF-PT-S02J06T06"
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-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S02J06T06, 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 r299-tajo-171654455700152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;