About the Execution of LTSMin+red for PolyORBLF-PT-S06J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9709.352 | 543412.00 | 691926.00 | 521.60 | ?TFTTFTF??FF?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.r516-tajo-171654446800321.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 ltsminxred
Input is PolyORBLF-PT-S06J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800321
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 25K Apr 11 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 11 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 329K Apr 11 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 160K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 538K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 11 17:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 17:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 11 17:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K 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 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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 PolyORBLF-PT-S06J04T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717255534716
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:25:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:25:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:25:36] [INFO ] Load time of PNML (sax parser for PT used): 503 ms
[2024-06-01 15:25:36] [INFO ] Transformed 632 places.
[2024-06-01 15:25:36] [INFO ] Transformed 10500 transitions.
[2024-06-01 15:25:36] [INFO ] Parsed PT model containing 632 places and 10500 transitions and 88770 arcs in 714 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 69 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 509 out of 632 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 632/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 154 ms. Remains 632 /632 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Running 2424 sub problems to find dead transitions.
[2024-06-01 15:25:37] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 632 cols
[2024-06-01 15:25:37] [INFO ] Computed 54 invariants in 145 ms
[2024-06-01 15:25:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/620 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2424 unsolved
SMT process timed out in 43040ms, After SMT, problems are : Problem set: 0 solved, 2424 unsolved
Search for dead transitions found 0 dead transitions in 43156ms
[2024-06-01 15:26:20] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
[2024-06-01 15:26:20] [INFO ] Invariant cache hit.
[2024-06-01 15:26:21] [INFO ] Implicit Places using invariants in 1097 ms returned [87, 356, 433, 520, 596]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1142 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 627/632 places, 2430/2430 transitions.
Applied a total of 0 rules in 37 ms. Remains 627 /627 variables (removed 0) and now considering 2430/2430 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44637 ms. Remains : 627/632 places, 2430/2430 transitions.
Support contains 509 out of 627 places after structural reductions.
[2024-06-01 15:26:22] [INFO ] Flatten gal took : 465 ms
[2024-06-01 15:26:22] [INFO ] Flatten gal took : 317 ms
[2024-06-01 15:26:23] [INFO ] Input system was already deterministic with 2430 transitions.
RANDOM walk for 40000 steps (207 resets) in 4850 ms. (8 steps per ms) remains 77/117 properties
BEST_FIRST walk for 4002 steps (11 resets) in 135 ms. (29 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (17 resets) in 121 ms. (32 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (21 resets) in 55 ms. (71 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (14 resets) in 68 ms. (58 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (14 resets) in 63 ms. (62 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (10 resets) in 76 ms. (51 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (30 resets) in 67 ms. (58 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (19 resets) in 56 ms. (70 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (16 resets) in 47 ms. (83 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (15 resets) in 52 ms. (75 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (11 resets) in 66 ms. (59 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (11 resets) in 48 ms. (81 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (13 resets) in 71 ms. (55 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (17 resets) in 73 ms. (54 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (13 resets) in 62 ms. (63 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (10 resets) in 47 ms. (83 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (11 resets) in 63 ms. (62 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (9 resets) in 46 ms. (85 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (9 resets) in 66 ms. (59 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (18 resets) in 40 ms. (97 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (17 resets) in 109 ms. (36 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (14 resets) in 87 ms. (45 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (12 resets) in 51 ms. (76 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (13 resets) in 41 ms. (95 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (23 resets) in 68 ms. (58 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4000 steps (112 resets) in 72 ms. (54 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (14 resets) in 66 ms. (59 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (11 resets) in 69 ms. (57 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (10 resets) in 80 ms. (49 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (11 resets) in 77 ms. (51 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (13 resets) in 45 ms. (87 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (13 resets) in 50 ms. (78 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (22 resets) in 43 ms. (90 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (19 resets) in 50 ms. (78 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4004 steps (18 resets) in 63 ms. (62 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (20 resets) in 40 ms. (97 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (16 resets) in 48 ms. (81 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (11 resets) in 53 ms. (74 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (14 resets) in 46 ms. (85 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (11 resets) in 58 ms. (67 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4002 steps (10 resets) in 50 ms. (78 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (13 resets) in 43 ms. (90 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (13 resets) in 52 ms. (75 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (14 resets) in 49 ms. (80 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4003 steps (9 resets) in 41 ms. (95 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4000 steps (11 resets) in 37 ms. (105 steps per ms) remains 77/77 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 77/77 properties
[2024-06-01 15:26:26] [INFO ] Flow matrix only has 2394 transitions (discarded 36 similar events)
// Phase 1: matrix 2394 rows 627 cols
[2024-06-01 15:26:26] [INFO ] Computed 49 invariants in 84 ms
[2024-06-01 15:26:26] [INFO ] State equation strengthened by 168 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp76 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 74 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp99 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp115 is UNSAT
At refinement iteration 2 (OVERLAPS) 92/477 variables, 18/21 constraints. Problems are: Problem set: 20 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 2/23 constraints. Problems are: Problem set: 20 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/23 constraints. Problems are: Problem set: 20 solved, 57 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 5 (OVERLAPS) 150/627 variables, 26/49 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/627 variables, 0/49 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2394/3021 variables, 627/676 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3021 variables, 168/844 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3021 variables, 0/844 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/3021 variables, 0/844 constraints. Problems are: Problem set: 74 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3021/3021 variables, and 844 constraints, problems are : Problem set: 74 solved, 3 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 627/627 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 77/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 74 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/65 variables, 4/4 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/4 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 19/84 variables, 4/8 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/8 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 121/205 variables, 8/16 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/16 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 406/611 variables, 21/37 constraints. Problems are: Problem set: 74 solved, 3 unsolved
[2024-06-01 15:26:33] [INFO ] Deduced a trap composed of 86 places in 304 ms of which 22 ms to minimize.
[2024-06-01 15:26:33] [INFO ] Deduced a trap composed of 86 places in 272 ms of which 2 ms to minimize.
[2024-06-01 15:26:33] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2024-06-01 15:26:33] [INFO ] Deduced a trap composed of 86 places in 163 ms of which 2 ms to minimize.
[2024-06-01 15:26:33] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/611 variables, 5/42 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/611 variables, 0/42 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/615 variables, 4/46 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/46 constraints. Problems are: Problem set: 74 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 10/625 variables, 7/53 constraints. Problems are: Problem set: 74 solved, 3 unsolved
[2024-06-01 15:26:34] [INFO ] Deduced a trap composed of 122 places in 683 ms of which 13 ms to minimize.
Problem AtomicPropp107 is UNSAT
[2024-06-01 15:26:35] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/625 variables, 2/55 constraints. Problems are: Problem set: 75 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/625 variables, 0/55 constraints. Problems are: Problem set: 75 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3019/3021 variables, and 680 constraints, problems are : Problem set: 75 solved, 2 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 625/627 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/74 constraints, Known Traps: 7/7 constraints]
After SMT, in 10487ms problems are : Problem set: 75 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 621 transition count 2379
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 108 place count 570 transition count 2379
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 570 transition count 2307
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 498 transition count 2307
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 495 transition count 2304
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 495 transition count 2304
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 392 place count 428 transition count 2237
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 405 place count 428 transition count 2224
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 418 place count 415 transition count 2224
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 415 transition count 2224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 420 place count 414 transition count 2223
Iterating global reduction 3 with 1 rules applied. Total rules applied 421 place count 414 transition count 2223
Applied a total of 421 rules in 472 ms. Remains 414 /627 variables (removed 213) and now considering 2223/2430 (removed 207) transitions.
Running 2217 sub problems to find dead transitions.
[2024-06-01 15:26:37] [INFO ] Flow matrix only has 2187 transitions (discarded 36 similar events)
// Phase 1: matrix 2187 rows 414 cols
[2024-06-01 15:26:37] [INFO ] Computed 43 invariants in 83 ms
[2024-06-01 15:26:37] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 15:27:17] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 3 ms to minimize.
[2024-06-01 15:27:18] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 408/2601 variables, and 34 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/414 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2217/876 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 2217 unsolved
[2024-06-01 15:27:25] [INFO ] Deduced a trap composed of 50 places in 477 ms of which 3 ms to minimize.
[2024-06-01 15:27:26] [INFO ] Deduced a trap composed of 53 places in 495 ms of which 2 ms to minimize.
[2024-06-01 15:27:26] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:27:27] [INFO ] Deduced a trap composed of 29 places in 475 ms of which 2 ms to minimize.
[2024-06-01 15:27:27] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:27:27] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:27:31] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 3 ms to minimize.
[2024-06-01 15:27:31] [INFO ] Deduced a trap composed of 48 places in 373 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/2601 variables, and 42 constraints, problems are : Problem set: 0 solved, 2217 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 15/23 constraints, State Equation: 0/414 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1341/876 constraints, Known Traps: 10/10 constraints]
After SMT, in 65183ms problems are : Problem set: 0 solved, 2217 unsolved
Search for dead transitions found 0 dead transitions in 65213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65696 ms. Remains : 414/627 places, 2223/2430 transitions.
RANDOM walk for 40002 steps (437 resets) in 1190 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (134 resets) in 543 ms. (73 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (114 resets) in 492 ms. (81 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 87438 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 2
Probabilistic random walk after 87438 steps, saw 29771 distinct states, run finished after 3006 ms. (steps per millisecond=29 ) properties seen :0
[2024-06-01 15:27:46] [INFO ] Flow matrix only has 2187 transitions (discarded 36 similar events)
[2024-06-01 15:27:46] [INFO ] Invariant cache hit.
[2024-06-01 15:27:46] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 97/197 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 204/401 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/404 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 8/412 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 2187/2599 variables, 412/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2599 variables, 168/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2599 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/2601 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2601 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2601 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/2601 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2601/2601 variables, and 625 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4863 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 414/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 63/70 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/100 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:27:51] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 97/197 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 204/401 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 1 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:27:53] [INFO ] Deduced a trap composed of 52 places in 577 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/404 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 8/412 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2187/2599 variables, 412/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2599 variables, 168/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp111 is UNSAT
After SMT solving in domain Int declared 2599/2601 variables, and 630 constraints, problems are : Problem set: 2 solved, 0 unsolved in 10051 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 412/414 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 14954ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 77 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:28:01] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 15:28:01] [INFO ] Flatten gal took : 131 ms
[2024-06-01 15:28:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:28:02] [INFO ] Flatten gal took : 151 ms
[2024-06-01 15:28:02] [INFO ] Input system was already deterministic with 2430 transitions.
Support contains 31 out of 627 places (down from 190) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 128 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:28:02] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
// Phase 1: matrix 2382 rows 609 cols
[2024-06-01 15:28:02] [INFO ] Computed 43 invariants in 44 ms
[2024-06-01 15:28:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 43459ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 43504ms
Finished structural reductions in LTL mode , in 1 iterations and 43641 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:28:46] [INFO ] Flatten gal took : 86 ms
[2024-06-01 15:28:46] [INFO ] Flatten gal took : 208 ms
[2024-06-01 15:28:46] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 96 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:28:46] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:28:46] [INFO ] Invariant cache hit.
[2024-06-01 15:28:46] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
SMT process timed out in 39828ms, After SMT, problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 39859ms
Finished structural reductions in LTL mode , in 1 iterations and 39963 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:29:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 15:29:26] [INFO ] Flatten gal took : 98 ms
FORMULA PolyORBLF-PT-S06J04T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:29:26] [INFO ] Flatten gal took : 92 ms
[2024-06-01 15:29:27] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 80 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:29:27] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:29:27] [INFO ] Invariant cache hit.
[2024-06-01 15:29:27] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:30:08] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/2991 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20084 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:30:11] [INFO ] Deduced a trap composed of 111 places in 198 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 10)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 4)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 1)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 3)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 0)
(s105 0)
(s106 1)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 3)
(s142 2)
(s143 2)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 4)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 1)
(s165 1)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 9)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 3)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 1)
(s234 0)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 1)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 6)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 2)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 1)
(s270 0)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 0)
(s280 1)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 1)
(s291 4)
(s292 0)
(s293 1)
(s294 0)
(s295 1)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 2)
(s309 1)
(s310 0)
(s311 1)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 1)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 1)
(s331 1)
(s332 0)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 0)
(s339 1)
(s340 1)
(s341 0)
(s342 2)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 4)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 2)
(s359 1)
(s360 0)
(s361 0)
(s362 0)
(s363 2)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 3)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 1)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 1)
(s384 1)
(s385 0)
(s386 1)
(s387 1)
(s388 1)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 1)
(s406 1)
(s407 0)
(s408 1)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 2)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 1)
(s428 0)
(s429 0)
(s430 1)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 1)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 1)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 1)
(s461 0)
(s462 0)
(s463 1)
(s464 1)
(s465 2)
(s466 0)
(s467 0)
(s468 0)
(s469 1)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/2991 variables, and 34 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 61465ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61485ms
Finished structural reductions in LTL mode , in 1 iterations and 61571 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:30:28] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:30:28] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:30:29] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 62 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:30:29] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:30:29] [INFO ] Invariant cache hit.
[2024-06-01 15:30:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:31:10] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 10.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 3.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/2991 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:31:13] [INFO ] Deduced a trap composed of 111 places in 99 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/2991 variables, and 34 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 62425ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 62443ms
Finished structural reductions in LTL mode , in 1 iterations and 62510 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:31:31] [INFO ] Flatten gal took : 76 ms
[2024-06-01 15:31:31] [INFO ] Flatten gal took : 83 ms
[2024-06-01 15:31:32] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 76 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:31:32] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:31:32] [INFO ] Invariant cache hit.
[2024-06-01 15:31:32] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:32:14] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/2991 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:32:16] [INFO ] Deduced a trap composed of 111 places in 125 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/2991 variables, and 34 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 61960ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61990ms
Finished structural reductions in LTL mode , in 1 iterations and 62073 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:32:34] [INFO ] Flatten gal took : 84 ms
[2024-06-01 15:32:34] [INFO ] Flatten gal took : 92 ms
[2024-06-01 15:32:34] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 67 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:32:34] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:32:34] [INFO ] Invariant cache hit.
[2024-06-01 15:32:34] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:33:15] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/2991 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 111 places in 105 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 9)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 3)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 1)
(s16 0)
(s17 0)
(s18 1)
(s19 1)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 9)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 4)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 4)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 1)
(s99 3)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 1)
(s105 0)
(s106 1)
(s107 0)
(s108 4)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 1)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 3)
(s142 2)
(s143 2)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 4)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 1)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 1)
(s168 1)
(s169 0)
(s170 10)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 4)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 1)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 1)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 2)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 3)
(s221 0)
(s222 0)
(s223 1)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 1)
(s234 1)
(s235 0)
(s236 1)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 6)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 2)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 0)
(s263 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/2991 variables, and 34 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 61764ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 61783ms
Finished structural reductions in LTL mode , in 1 iterations and 61855 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:33:36] [INFO ] Flatten gal took : 81 ms
[2024-06-01 15:33:36] [INFO ] Flatten gal took : 84 ms
[2024-06-01 15:33:36] [INFO ] Input system was already deterministic with 2418 transitions.
Starting structural reductions in LTL mode, iteration 0 : 627/627 places, 2430/2430 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 621 transition count 2430
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 615 transition count 2424
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 615 transition count 2424
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 609 transition count 2418
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 609 transition count 2418
Applied a total of 30 rules in 66 ms. Remains 609 /627 variables (removed 18) and now considering 2418/2430 (removed 12) transitions.
Running 2412 sub problems to find dead transitions.
[2024-06-01 15:33:36] [INFO ] Flow matrix only has 2382 transitions (discarded 36 similar events)
[2024-06-01 15:33:36] [INFO ] Invariant cache hit.
[2024-06-01 15:33:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:34:14] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 603/2991 variables, and 33 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20046 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2412/1158 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/603 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/603 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/603 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 2412 unsolved
[2024-06-01 15:34:19] [INFO ] Deduced a trap composed of 111 places in 146 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/2991 variables, and 34 constraints, problems are : Problem set: 0 solved, 2412 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/13 constraints, Generalized P Invariants (flows): 22/30 constraints, State Equation: 0/609 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1158 constraints, Known Traps: 2/2 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 2412 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in LTL mode , in 1 iterations and 60350 ms. Remains : 609/627 places, 2418/2430 transitions.
[2024-06-01 15:34:37] [INFO ] Flatten gal took : 105 ms
[2024-06-01 15:34:37] [INFO ] Flatten gal took : 135 ms
[2024-06-01 15:34:37] [INFO ] Input system was already deterministic with 2418 transitions.
[2024-06-01 15:34:37] [INFO ] Flatten gal took : 113 ms
[2024-06-01 15:34:37] [INFO ] Flatten gal took : 117 ms
[2024-06-01 15:34:37] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:34:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 627 places, 2430 transitions and 14870 arcs took 23 ms.
Total runtime 541753 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBLF-PT-S06J04T06-CTLCardinality-2024-15
BK_STOP 1717256078128
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/711/ctl_0_
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/711/ctl_1_
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/711/ctl_2_
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/711/ctl_3_
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/711/ctl_4_
ctl formula name PolyORBLF-PT-S06J04T06-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/711/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-S06J04T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S06J04T06, 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 r516-tajo-171654446800321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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 ;