About the Execution of ITS-Tools for PolyORBLF-PT-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10277.239 | 442884.00 | 1152346.00 | 122.70 | T | 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-171654455700158.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-S02J06T08, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tajo-171654455700158
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 807K 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 StableMarking
=== Now, execution of the tool begins
BK_START 1717141603821
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-31 07:46:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-31 07:46:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:46:45] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-05-31 07:46:45] [INFO ] Transformed 690 places.
[2024-05-31 07:46:45] [INFO ] Transformed 1434 transitions.
[2024-05-31 07:46:45] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 317 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
RANDOM walk for 40000 steps (10 resets) in 2793 ms. (14 steps per ms) remains 18/690 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 18/18 properties
[2024-05-31 07:46:47] [INFO ] Flatten gal took : 196 ms
BEST_FIRST walk for 4000 steps (8 resets) in 84 ms. (47 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 18/18 properties
[2024-05-31 07:46:47] [INFO ] Flatten gal took : 125 ms
BEST_FIRST walk for 4002 steps (8 resets) in 118 ms. (33 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
[2024-05-31 07:46:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality587448195014274818.gal : 65 ms
[2024-05-31 07:46:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15942953993436155738.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/ReachabilityCardinality587448195014274818.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15942953993436155738.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4001 steps (8 resets) in 91 ms. (43 steps per ms) remains 18/18 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 ...328
BEST_FIRST walk for 4002 steps (8 resets) in 140 ms. (28 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 18/18 properties
[2024-05-31 07:46:47] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
Loading property file /tmp/ReachabilityCardinality15942953993436155738.prop.
[2024-05-31 07:46:47] [INFO ] Computed 54 invariants in 93 ms
[2024-05-31 07:46:47] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,18 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,18 properties remain. new max is 16
SDD size :6 after 7
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/628 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 32
SDD size :7 after 23
SDD proceeding with computation,18 properties remain. new max is 64
SDD size :23 after 67
At refinement iteration 6 (INCLUDED_ONLY) 0/628 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 59/687 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 128
SDD size :67 after 75
SDD proceeding with computation,18 properties remain. new max is 256
SDD size :75 after 83
At refinement iteration 8 (INCLUDED_ONLY) 0/687 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1/688 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 512
SDD size :83 after 1529
SDD proceeding with computation,18 properties remain. new max is 1024
SDD size :1529 after 1573
SDD proceeding with computation,18 properties remain. new max is 2048
SDD size :1573 after 1641
SDD proceeding with computation,18 properties remain. new max is 4096
SDD size :1641 after 1781
At refinement iteration 11 (OVERLAPS) 1290/1978 variables, 688/741 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1978 variables, 96/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1978 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 2/1980 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1980 variables, 1/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 17 (OVERLAPS) 0/1980 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 840 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 690/690 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 302/320 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 8192
SDD size :1781 after 2223
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 306/626 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 07:46:54] [INFO ] Deduced a trap composed of 369 places in 359 ms of which 39 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 484 places in 296 ms of which 5 ms to minimize.
[2024-05-31 07:46:55] [INFO ] Deduced a trap composed of 476 places in 273 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/626 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 07:46:56] [INFO ] Deduced a trap composed of 348 places in 250 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/626 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 348 places in 255 ms of which 5 ms to minimize.
[2024-05-31 07:46:57] [INFO ] Deduced a trap composed of 348 places in 218 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 626/1980 variables, and 21 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 5/41 constraints, State Equation: 0/690 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/18 constraints, Known Traps: 6/6 constraints]
After SMT, in 10239ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 434 place count 472 transition count 1090
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 450 place count 472 transition count 1074
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 466 place count 456 transition count 1074
Applied a total of 466 rules in 199 ms. Remains 456 /690 variables (removed 234) and now considering 1074/1306 (removed 232) transitions.
Running 1072 sub problems to find dead transitions.
[2024-05-31 07:46:58] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
// Phase 1: matrix 1058 rows 456 cols
[2024-05-31 07:46:58] [INFO ] Computed 52 invariants in 19 ms
[2024-05-31 07:46:58] [INFO ] State equation strengthened by 96 read => feed constraints.
SDD proceeding with computation,18 properties remain. new max is 16384
SDD size :2223 after 3865
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
SDD proceeding with computation,18 properties remain. new max is 32768
SDD size :3865 after 5781
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 1072 unsolved
[2024-05-31 07:47:09] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 3 ms to minimize.
[2024-05-31 07:47:10] [INFO ] Deduced a trap composed of 64 places in 223 ms of which 5 ms to minimize.
[2024-05-31 07:47:10] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 3 ms to minimize.
[2024-05-31 07:47:10] [INFO ] Deduced a trap composed of 63 places in 236 ms of which 4 ms to minimize.
[2024-05-31 07:47:10] [INFO ] Deduced a trap composed of 151 places in 236 ms of which 4 ms to minimize.
[2024-05-31 07:47:12] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 2 ms to minimize.
[2024-05-31 07:47:13] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-31 07:47:19] [INFO ] Deduced a trap composed of 151 places in 304 ms of which 5 ms to minimize.
[2024-05-31 07:47:19] [INFO ] Deduced a trap composed of 143 places in 237 ms of which 3 ms to minimize.
[2024-05-31 07:47:20] [INFO ] Deduced a trap composed of 141 places in 246 ms of which 3 ms to minimize.
[2024-05-31 07:47:20] [INFO ] Deduced a trap composed of 150 places in 269 ms of which 3 ms to minimize.
SMT process timed out in 22554ms, After SMT, problems are : Problem set: 0 solved, 1072 unsolved
Search for dead transitions found 0 dead transitions in 22573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22792 ms. Remains : 456/690 places, 1074/1306 transitions.
SDD proceeding with computation,18 properties remain. new max is 65536
SDD size :5781 after 37999
RANDOM walk for 4000000 steps (1798 resets) in 58420 ms. (68 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (73 resets) in 2394 ms. (167 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (67 resets) in 2650 ms. (150 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (63 resets) in 2206 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (77 resets) in 2078 ms. (192 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (79 resets) in 1874 ms. (213 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (77 resets) in 2188 ms. (182 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (65 resets) in 1816 ms. (220 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (87 resets) in 1922 ms. (208 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (69 resets) in 1734 ms. (230 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (66 resets) in 1948 ms. (205 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (55 resets) in 1679 ms. (238 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (69 resets) in 1749 ms. (228 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (58 resets) in 1770 ms. (225 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (77 resets) in 1705 ms. (234 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (62 resets) in 1684 ms. (237 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (73 resets) in 2156 ms. (185 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (66 resets) in 1729 ms. (231 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (63 resets) in 2161 ms. (185 steps per ms) remains 18/18 properties
SDD proceeding with computation,18 properties remain. new max is 131072
SDD size :37999 after 73123
SDD proceeding with computation,18 properties remain. new max is 262144
SDD size :73123 after 188705
Interrupted probabilistic random walk after 2628286 steps, run timeout after 90001 ms. (steps per millisecond=29 ) properties seen :0 out of 18
Probabilistic random walk after 2628286 steps, saw 1475900 distinct states, run finished after 90008 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-31 07:49:21] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-31 07:49:21] [INFO ] Invariant cache hit.
[2024-05-31 07:49:21] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1058/1512 variables, 454/505 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 96/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/1514 variables, 2/603 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1514 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1514 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 604 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2419 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 456/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 241/259 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/259 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/337 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 117/454 variables, 35/51 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 07:49:24] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-05-31 07:49:24] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-31 07:49:24] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2024-05-31 07:49:24] [INFO ] Deduced a trap composed of 44 places in 283 ms of which 3 ms to minimize.
[2024-05-31 07:49:25] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 4 ms to minimize.
[2024-05-31 07:49:25] [INFO ] Deduced a trap composed of 177 places in 236 ms of which 3 ms to minimize.
[2024-05-31 07:49:25] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 2 ms to minimize.
[2024-05-31 07:49:25] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 1 ms to minimize.
[2024-05-31 07:49:25] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 2 ms to minimize.
[2024-05-31 07:49:26] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 3 ms to minimize.
[2024-05-31 07:49:26] [INFO ] Deduced a trap composed of 175 places in 242 ms of which 3 ms to minimize.
[2024-05-31 07:49:26] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1058/1512 variables, 454/517 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 96/613 constraints. Problems are: Problem set: 0 solved, 18 unsolved
SDD proceeding with computation,18 properties remain. new max is 524288
SDD size :188705 after 547122
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1512/1514 variables, and 631 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 454/456 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 12/12 constraints]
After SMT, in 47486ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 117 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 456/456 places, 1074/1074 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 456/456 places, 1074/1074 transitions.
Applied a total of 0 rules in 83 ms. Remains 456 /456 variables (removed 0) and now considering 1074/1074 (removed 0) transitions.
[2024-05-31 07:50:08] [INFO ] Flow matrix only has 1058 transitions (discarded 16 similar events)
[2024-05-31 07:50:08] [INFO ] Invariant cache hit.
[2024-05-31 07:50:09] [INFO ] Implicit Places using invariants in 1039 ms returned [43, 116, 194, 231, 308, 324, 381, 386]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1050 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 448/456 places, 1074/1074 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 444 transition count 1070
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 444 transition count 1070
Applied a total of 8 rules in 85 ms. Remains 444 /448 variables (removed 4) and now considering 1070/1074 (removed 4) transitions.
[2024-05-31 07:50:09] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
// Phase 1: matrix 1054 rows 444 cols
[2024-05-31 07:50:10] [INFO ] Computed 44 invariants in 29 ms
[2024-05-31 07:50:10] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-31 07:50:10] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-31 07:50:10] [INFO ] Invariant cache hit.
[2024-05-31 07:50:11] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-31 07:50:19] [INFO ] Implicit Places using invariants and state equation in 8564 ms returned []
Implicit Place search using SMT with State Equation took 9332 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 444/456 places, 1070/1074 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 10550 ms. Remains : 444/456 places, 1070/1074 transitions.
RANDOM walk for 4000000 steps (1786 resets) in 59447 ms. (67 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (73 resets) in 2930 ms. (136 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (76 resets) in 3017 ms. (132 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (74 resets) in 2977 ms. (134 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (59 resets) in 2544 ms. (157 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (74 resets) in 2575 ms. (155 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (75 resets) in 3028 ms. (132 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (57 resets) in 2682 ms. (149 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (72 resets) in 2367 ms. (168 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (59 resets) in 2782 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (68 resets) in 3287 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (66 resets) in 2766 ms. (144 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (59 resets) in 2364 ms. (169 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (75 resets) in 2794 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (78 resets) in 2966 ms. (134 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (68 resets) in 2849 ms. (140 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (81 resets) in 2378 ms. (168 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400001 steps (64 resets) in 2748 ms. (145 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (88 resets) in 2468 ms. (162 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 3294023 steps, run timeout after 102001 ms. (steps per millisecond=32 ) properties seen :0 out of 18
Probabilistic random walk after 3294023 steps, saw 1720153 distinct states, run finished after 102003 ms. (steps per millisecond=32 ) properties seen :0
[2024-05-31 07:52:36] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-31 07:52:36] [INFO ] Invariant cache hit.
[2024-05-31 07:52:36] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/442 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 1054/1496 variables, 442/485 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1496 variables, 96/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 2/1498 variables, 2/583 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1498 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (OVERLAPS) 0/1498 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1498/1498 variables, and 584 constraints, problems are : Problem set: 0 solved, 18 unsolved in 2007 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 444/444 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 274/292 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 64/356 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 84/440 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-31 07:52:40] [INFO ] Deduced a trap composed of 51 places in 320 ms of which 3 ms to minimize.
[2024-05-31 07:52:40] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 3 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 3 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 2 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 165 places in 213 ms of which 6 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 1 ms to minimize.
[2024-05-31 07:52:41] [INFO ] Deduced a trap composed of 45 places in 217 ms of which 3 ms to minimize.
[2024-05-31 07:52:42] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 4 ms to minimize.
[2024-05-31 07:52:42] [INFO ] Deduced a trap composed of 242 places in 214 ms of which 2 ms to minimize.
[2024-05-31 07:52:42] [INFO ] Deduced a trap composed of 217 places in 245 ms of which 4 ms to minimize.
[2024-05-31 07:52:43] [INFO ] Deduced a trap composed of 186 places in 257 ms of which 3 ms to minimize.
[2024-05-31 07:52:43] [INFO ] Deduced a trap composed of 189 places in 230 ms of which 3 ms to minimize.
[2024-05-31 07:52:43] [INFO ] Deduced a trap composed of 210 places in 230 ms of which 3 ms to minimize.
[2024-05-31 07:52:43] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/442 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1054/1496 variables, 442/500 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1496 variables, 96/596 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem smplace_98 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 14676ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 0 properties in 1816 ms.
Support contains 18 out of 444 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 57 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 444/444 places, 1070/1070 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 444/444 places, 1070/1070 transitions.
Applied a total of 0 rules in 50 ms. Remains 444 /444 variables (removed 0) and now considering 1070/1070 (removed 0) transitions.
[2024-05-31 07:52:52] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-31 07:52:52] [INFO ] Invariant cache hit.
[2024-05-31 07:52:53] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-05-31 07:52:53] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-31 07:52:53] [INFO ] Invariant cache hit.
[2024-05-31 07:52:54] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-31 07:53:02] [INFO ] Implicit Places using invariants and state equation in 8771 ms returned []
Implicit Place search using SMT with State Equation took 9431 ms to find 0 implicit places.
[2024-05-31 07:53:02] [INFO ] Redundant transitions in 116 ms returned []
Running 1068 sub problems to find dead transitions.
[2024-05-31 07:53:02] [INFO ] Flow matrix only has 1054 transitions (discarded 16 similar events)
[2024-05-31 07:53:02] [INFO ] Invariant cache hit.
[2024-05-31 07:53:02] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
SDD proceeding with computation,18 properties remain. new max is 1048576
SDD size :547122 after 1.48938e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/1498 variables, and 37 constraints, problems are : Problem set: 0 solved, 1068 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 24/31 constraints, State Equation: 0/444 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1068/1068 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1068 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 24/37 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
[2024-05-31 07:53:37] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-31 07:53:37] [INFO ] Deduced a trap composed of 45 places in 210 ms of which 2 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 2 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 37 places in 211 ms of which 2 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 2 ms to minimize.
[2024-05-31 07:53:38] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 2 ms to minimize.
[2024-05-31 07:53:39] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 1 ms to minimize.
[2024-05-31 07:53:39] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-31 07:53:40] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-31 07:53:41] [INFO ] Deduced a trap composed of 34 places in 183 ms of which 2 ms to minimize.
[2024-05-31 07:53:42] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 18 ms to minimize.
[2024-05-31 07:53:42] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1068 unsolved
Problem TDEAD931 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD970 is UNSAT
Problem TDEAD971 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/444 variables, 7/58 constraints. Problems are: Problem set: 88 solved, 980 unsolved
[2024-05-31 07:54:02] [INFO ] Deduced a trap composed of 141 places in 285 ms of which 4 ms to minimize.
[2024-05-31 07:54:03] [INFO ] Deduced a trap composed of 223 places in 293 ms of which 3 ms to minimize.
[2024-05-31 07:54:03] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 3 ms to minimize.
[2024-05-31 07:54:04] [INFO ] Deduced a trap composed of 221 places in 357 ms of which 6 ms to minimize.
[2024-05-31 07:54:04] [INFO ] Deduced a trap composed of 146 places in 367 ms of which 5 ms to minimize.
[2024-05-31 07:54:05] [INFO ] Deduced a trap composed of 159 places in 382 ms of which 7 ms to minimize.
[2024-05-31 07:54:05] [INFO ] Deduced a trap composed of 177 places in 371 ms of which 6 ms to minimize.
[2024-05-31 07:54:06] [INFO ] Deduced a trap composed of 172 places in 350 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/1498 variables, and 66 constraints, problems are : Problem set: 88 solved, 980 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 0/444 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1068 constraints, Known Traps: 22/22 constraints]
After SMT, in 63759ms problems are : Problem set: 88 solved, 980 unsolved
Search for dead transitions found 88 dead transitions in 63788ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 444/444 places, 982/1070 transitions.
Reduce places removed 0 places and 16 transitions.
Graph (complete) has 2846 edges and 444 vertex of which 18 are kept as prefixes of interest. Removing 426 places using SCC suffix rule.2 ms
Discarding 426 places :
Also discarding 950 output transitions
Drop transitions (Output transitions of discarded places.) removed 950 transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 16
Reduce places removed 0 places and 16 transitions.
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 1 rules in 13 ms. Remains 18 /444 variables (removed 426) and now considering 0/982 (removed 982) transitions.
[2024-05-31 07:54:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 07:54:06] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 07:54:06] [INFO ] Invariant cache hit.
[2024-05-31 07:54:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 18/444 places, 0/1070 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 73588 ms. Remains : 18/444 places, 0/1070 transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 441117 ms.
BK_STOP 1717142046705
--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -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 StableMarking -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-S02J06T08"
export BK_EXAMINATION="StableMarking"
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-S02J06T08, examination is StableMarking"
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-171654455700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;