About the Execution of ITS-Tools for PolyORBNT-PT-S10J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 353246.00 | 0.00 | 0.00 | ??F?F?FF??F?TFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447300513.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 PolyORBNT-PT-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447300513
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 39K Apr 12 11:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 509K Apr 12 10:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 12 10:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 198K Apr 12 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 829K Apr 12 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9M Apr 12 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 6.9M Apr 12 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J80-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716934367343
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J80
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 22:12:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:12:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:12:49] [INFO ] Load time of PNML (sax parser for PT used): 680 ms
[2024-05-28 22:12:49] [INFO ] Transformed 1614 places.
[2024-05-28 22:12:49] [INFO ] Transformed 13500 transitions.
[2024-05-28 22:12:49] [INFO ] Parsed PT model containing 1614 places and 13500 transitions and 119759 arcs in 883 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 650 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 1605 transition count 3390
Applied a total of 9 rules in 154 ms. Remains 1605 /1614 variables (removed 9) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-05-28 22:12:50] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1605 cols
[2024-05-28 22:12:50] [INFO ] Computed 183 invariants in 185 ms
[2024-05-28 22:12:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 timeout
0.0)
(s77 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 43568ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 43674ms
[2024-05-28 22:13:33] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-05-28 22:13:33] [INFO ] Invariant cache hit.
[2024-05-28 22:13:35] [INFO ] Implicit Places using invariants in 1974 ms returned []
[2024-05-28 22:13:35] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-05-28 22:13:35] [INFO ] Invariant cache hit.
[2024-05-28 22:13:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:14:09] [INFO ] Performed 1090/1605 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 22:14:23] [INFO ] Implicit Places using invariants and state equation in 48173 ms returned []
Implicit Place search using SMT with State Equation took 50151 ms to find 0 implicit places.
Running 3379 sub problems to find dead transitions.
[2024-05-28 22:14:23] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-05-28 22:14:23] [INFO ] Invariant cache hit.
[2024-05-28 22:14:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 53201ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 53231ms
Starting structural reductions in LTL mode, iteration 1 : 1605/1614 places, 3390/3390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147276 ms. Remains : 1605/1614 places, 3390/3390 transitions.
Support contains 650 out of 1605 places after structural reductions.
[2024-05-28 22:15:17] [INFO ] Flatten gal took : 314 ms
[2024-05-28 22:15:17] [INFO ] Flatten gal took : 183 ms
[2024-05-28 22:15:18] [INFO ] Input system was already deterministic with 3390 transitions.
Support contains 648 out of 1605 places (down from 650) after GAL structural reductions.
RANDOM walk for 40000 steps (2237 resets) in 4429 ms. (9 steps per ms) remains 72/75 properties
BEST_FIRST walk for 4004 steps (41 resets) in 89 ms. (44 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (41 resets) in 91 ms. (43 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (40 resets) in 89 ms. (44 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (40 resets) in 76 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (39 resets) in 69 ms. (57 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4002 steps (40 resets) in 77 ms. (51 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (41 resets) in 82 ms. (48 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (39 resets) in 58 ms. (67 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 58 ms. (67 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 48 ms. (81 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 63 ms. (62 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (40 resets) in 64 ms. (61 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 45 ms. (87 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 45 ms. (87 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (39 resets) in 56 ms. (70 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 45 ms. (87 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (48 resets) in 71 ms. (55 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (40 resets) in 108 ms. (36 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 55 ms. (71 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 57 ms. (69 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 63 ms. (62 steps per ms) remains 72/72 properties
BEST_FIRST walk for 4003 steps (32 resets) in 52 ms. (75 steps per ms) remains 71/72 properties
BEST_FIRST walk for 4004 steps (40 resets) in 170 ms. (23 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 108 ms. (36 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 140 ms. (28 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (41 resets) in 59 ms. (66 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 62 ms. (63 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 55 ms. (71 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 58 ms. (67 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 59 ms. (66 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (39 resets) in 48 ms. (81 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (41 resets) in 60 ms. (65 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (41 resets) in 48 ms. (81 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (41 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (41 resets) in 49 ms. (80 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 49 ms. (80 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (40 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (40 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (44 resets) in 46 ms. (85 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (41 resets) in 50 ms. (78 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (42 resets) in 45 ms. (87 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 46 ms. (85 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 50 ms. (78 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (39 resets) in 48 ms. (81 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 59 ms. (66 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (39 resets) in 41 ms. (95 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 44 ms. (88 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 54 ms. (72 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 48 ms. (81 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 43 ms. (90 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 44 ms. (88 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 46 ms. (85 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (39 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 52 ms. (75 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (39 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4004 steps (40 resets) in 42 ms. (93 steps per ms) remains 71/71 properties
BEST_FIRST walk for 4003 steps (40 resets) in 51 ms. (76 steps per ms) remains 71/71 properties
Interrupted probabilistic random walk after 149492 steps, run timeout after 9001 ms. (steps per millisecond=16 ) properties seen :11 out of 71
Probabilistic random walk after 149492 steps, saw 45434 distinct states, run finished after 9015 ms. (steps per millisecond=16 ) properties seen :11
[2024-05-28 22:15:30] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-05-28 22:15:30] [INFO ] Invariant cache hit.
[2024-05-28 22:15:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/639 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 335/974 variables, 99/99 constraints. Problems are: Problem set: 26 solved, 34 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 3/102 constraints. Problems are: Problem set: 30 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/974 variables, 0/102 constraints. Problems are: Problem set: 30 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 570/1544 variables, 57/159 constraints. Problems are: Problem set: 30 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1544 variables, 0/159 constraints. Problems are: Problem set: 30 solved, 30 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 6 (OVERLAPS) 57/1601 variables, 20/179 constraints. Problems are: Problem set: 51 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1601 variables, 0/179 constraints. Problems are: Problem set: 51 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 4/1605 variables, 4/183 constraints. Problems are: Problem set: 51 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1605 variables, 0/183 constraints. Problems are: Problem set: 51 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3381/4986 variables, 1605/1788 constraints. Problems are: Problem set: 51 solved, 9 unsolved
SMT process timed out in 5385ms, After SMT, problems are : Problem set: 51 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 268 out of 1605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1605/1605 places, 3390/3390 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1604 transition count 3387
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1601 transition count 3386
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 1600 transition count 3386
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 9 place count 1600 transition count 3305
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 171 place count 1519 transition count 3305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 1518 transition count 3304
Applied a total of 173 rules in 682 ms. Remains 1518 /1605 variables (removed 87) and now considering 3304/3390 (removed 86) transitions.
Running 3293 sub problems to find dead transitions.
[2024-05-28 22:15:36] [INFO ] Flow matrix only has 3295 transitions (discarded 9 similar events)
// Phase 1: matrix 3295 rows 1518 cols
[2024-05-28 22:15:36] [INFO ] Computed 182 invariants in 224 ms
[2024-05-28 22:15:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1508 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3293 unsolved
SMT process timed out in 42255ms, After SMT, problems are : Problem set: 0 solved, 3293 unsolved
Search for dead transitions found 0 dead transitions in 42287ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42976 ms. Remains : 1518/1605 places, 3304/3390 transitions.
RANDOM walk for 40000 steps (2629 resets) in 1817 ms. (22 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (277 resets) in 200 ms. (199 steps per ms) remains 1/1 properties
[2024-05-28 22:16:19] [INFO ] Flow matrix only has 3295 transitions (discarded 9 similar events)
[2024-05-28 22:16:19] [INFO ] Invariant cache hit.
[2024-05-28 22:16:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 402/681 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1391 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1391 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 121/1512 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1517 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1517 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3295/4812 variables, 1517/1699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4812 variables, 1/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4812 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/4813 variables, 1/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4813 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4813 variables, 0/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4813/4813 variables, and 1701 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1877 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1518/1518 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 402/681 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/681 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1391 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1391 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 121/1512 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:16:22] [INFO ] Deduced a trap composed of 20 places in 1039 ms of which 58 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1512 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1512 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/1517 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1517 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3295/4812 variables, 1517/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4812 variables, 1/1701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4812 variables, 1/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4812 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/4813 variables, 1/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4813 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4813 variables, 0/1703 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4813/4813 variables, and 1703 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5820 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1518/1518 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 7739ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 5 out of 1518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1518/1518 places, 3304/3304 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1518 transition count 3301
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 1515 transition count 3300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1514 transition count 3300
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 81 Pre rules applied. Total rules applied 8 place count 1514 transition count 3219
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 170 place count 1433 transition count 3219
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 174 place count 1431 transition count 3217
Applied a total of 174 rules in 392 ms. Remains 1431 /1518 variables (removed 87) and now considering 3217/3304 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 392 ms. Remains : 1431/1518 places, 3217/3304 transitions.
RANDOM walk for 40000 steps (2925 resets) in 2120 ms. (18 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (234 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 84949 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :0 out of 1
Probabilistic random walk after 84949 steps, saw 15538 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
[2024-05-28 22:16:31] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
// Phase 1: matrix 3208 rows 1431 cols
[2024-05-28 22:16:31] [INFO ] Computed 182 invariants in 134 ms
[2024-05-28 22:16:31] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/603 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1313 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/1425 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1430 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1430 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3208/4638 variables, 1430/1612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4638 variables, 1/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4638 variables, 0/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/4639 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4639 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/4639 variables, 0/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4639/4639 variables, and 1614 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1590 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1431/1431 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/275 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 328/603 variables, 77/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/603 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 710/1313 variables, 71/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1313 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 112/1425 variables, 22/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 22:16:34] [INFO ] Deduced a trap composed of 13 places in 1022 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1425 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/1430 variables, 5/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1430 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3208/4638 variables, 1430/1613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4638 variables, 1/1614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4638 variables, 1/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4638 variables, 0/1615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/4639 variables, 1/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/4639 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/4639 variables, 0/1616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4639/4639 variables, and 1616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4890 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1431/1431 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 6656ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 5 out of 1431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 3217/3217 transitions.
Applied a total of 0 rules in 140 ms. Remains 1431 /1431 variables (removed 0) and now considering 3217/3217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 1431/1431 places, 3217/3217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1431/1431 places, 3217/3217 transitions.
Applied a total of 0 rules in 138 ms. Remains 1431 /1431 variables (removed 0) and now considering 3217/3217 (removed 0) transitions.
[2024-05-28 22:16:38] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-05-28 22:16:38] [INFO ] Invariant cache hit.
[2024-05-28 22:16:41] [INFO ] Implicit Places using invariants in 3051 ms returned []
[2024-05-28 22:16:41] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-05-28 22:16:41] [INFO ] Invariant cache hit.
[2024-05-28 22:16:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 22:17:13] [INFO ] Performed 836/1431 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 22:17:38] [INFO ] Implicit Places using invariants and state equation in 57137 ms returned []
Implicit Place search using SMT with State Equation took 60191 ms to find 0 implicit places.
[2024-05-28 22:17:38] [INFO ] Redundant transitions in 206 ms returned []
Running 3206 sub problems to find dead transitions.
[2024-05-28 22:17:38] [INFO ] Flow matrix only has 3208 transitions (discarded 9 similar events)
[2024-05-28 22:17:38] [INFO ] Invariant cache hit.
[2024-05-28 22:17:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1421 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 3206 unsolved
SMT process timed out in 51912ms, After SMT, problems are : Problem set: 0 solved, 3206 unsolved
Search for dead transitions found 0 dead transitions in 51942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112492 ms. Remains : 1431/1431 places, 3217/3217 transitions.
Successfully simplified 51 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:18:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 22:18:30] [INFO ] Flatten gal took : 207 ms
[2024-05-28 22:18:30] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 22:18:31] [INFO ] Flatten gal took : 222 ms
[2024-05-28 22:18:31] [INFO ] Input system was already deterministic with 3390 transitions.
Support contains 418 out of 1605 places (down from 432) after GAL structural reductions.
FORMULA PolyORBNT-PT-S10J80-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1605/1605 places, 3390/3390 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1604 transition count 3386
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 1600 transition count 3385
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 1599 transition count 3385
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 1599 transition count 3381
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 1595 transition count 3381
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 1594 transition count 3380
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 1594 transition count 3380
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 1592 transition count 3378
Applied a total of 24 rules in 472 ms. Remains 1592 /1605 variables (removed 13) and now considering 3378/3390 (removed 12) transitions.
Running 3367 sub problems to find dead transitions.
[2024-05-28 22:18:32] [INFO ] Flow matrix only has 3369 transitions (discarded 9 similar events)
// Phase 1: matrix 3369 rows 1592 cols
[2024-05-28 22:18:32] [INFO ] Computed 182 invariants in 128 ms
[2024-05-28 22:18:32] [INFO ] State equation strengthened by 1 read => feed constraints.
BK_STOP 1716934720589
--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J80, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447300513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J80.tgz
mv PolyORBNT-PT-S10J80 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;