About the Execution of LTSMin+red for PolyORBLF-PT-S06J04T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16176.720 | 187582.00 | 271173.00 | 71.40 | TFFTF?TFF????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-171654446800313.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-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800313
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 13K Apr 11 17:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 11 17:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 912K Apr 11 17:32 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 8.9K 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 112K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 343K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 291K Apr 11 17:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 6.8M 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-S06J04T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J04T04-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717255229157
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-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:20:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:20:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:20:31] [INFO ] Load time of PNML (sax parser for PT used): 515 ms
[2024-06-01 15:20:31] [INFO ] Transformed 454 places.
[2024-06-01 15:20:31] [INFO ] Transformed 6994 transitions.
[2024-06-01 15:20:31] [INFO ] Parsed PT model containing 454 places and 6994 transitions and 59152 arcs in 686 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 237 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 451 transition count 1611
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 451 transition count 1611
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 449 transition count 1609
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 449 transition count 1609
Applied a total of 10 rules in 148 ms. Remains 449 /454 variables (removed 5) and now considering 1609/1614 (removed 5) transitions.
Running 1603 sub problems to find dead transitions.
[2024-06-01 15:20:31] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
// Phase 1: matrix 1585 rows 449 cols
[2024-06-01 15:20:31] [INFO ] Computed 50 invariants in 66 ms
[2024-06-01 15:20:31] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 106 places in 322 ms of which 25 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 102 places in 308 ms of which 3 ms to minimize.
[2024-06-01 15:21:01] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 2 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 199 places in 251 ms of which 9 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 207 places in 319 ms of which 3 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 3 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 198 places in 310 ms of which 3 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 183 places in 308 ms of which 3 ms to minimize.
SMT process timed out in 36162ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 36207ms
[2024-06-01 15:21:07] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-06-01 15:21:07] [INFO ] Invariant cache hit.
[2024-06-01 15:21:08] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-06-01 15:21:08] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-06-01 15:21:08] [INFO ] Invariant cache hit.
[2024-06-01 15:21:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-06-01 15:21:12] [INFO ] Implicit Places using invariants and state equation in 4306 ms returned []
Implicit Place search using SMT with State Equation took 4634 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-06-01 15:21:12] [INFO ] Flow matrix only has 1585 transitions (discarded 24 similar events)
[2024-06-01 15:21:12] [INFO ] Invariant cache hit.
[2024-06-01 15:21:12] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 15:21:37] [INFO ] Deduced a trap composed of 106 places in 309 ms of which 3 ms to minimize.
[2024-06-01 15:21:37] [INFO ] Deduced a trap composed of 102 places in 274 ms of which 3 ms to minimize.
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 61 places in 234 ms of which 1 ms to minimize.
[2024-06-01 15:21:38] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 210 places in 298 ms of which 3 ms to minimize.
[2024-06-01 15:21:39] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 2 ms to minimize.
[2024-06-01 15:21:40] [INFO ] Deduced a trap composed of 201 places in 409 ms of which 2 ms to minimize.
[2024-06-01 15:21:44] [INFO ] Deduced a trap composed of 198 places in 266 ms of which 3 ms to minimize.
[2024-06-01 15:21:46] [INFO ] Deduced a trap composed of 77 places in 270 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/2034 variables, and 46 constraints, problems are : Problem set: 0 solved, 1603 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 15/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1603/1603 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/437 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/437 variables, 22/37 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/437 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
Problem TDEAD35 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 4 (OVERLAPS) 6/443 variables, 6/52 constraints. Problems are: Problem set: 22 solved, 1581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 443/2034 variables, and 52 constraints, problems are : Problem set: 22 solved, 1581 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 22/29 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1603 constraints, Known Traps: 9/9 constraints]
After SMT, in 74484ms problems are : Problem set: 22 solved, 1581 unsolved
Search for dead transitions found 22 dead transitions in 74511ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 449/454 places, 1587/1614 transitions.
Applied a total of 0 rules in 17 ms. Remains 449 /449 variables (removed 0) and now considering 1587/1587 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 115592 ms. Remains : 449/454 places, 1587/1614 transitions.
Support contains 237 out of 449 places after structural reductions.
[2024-06-01 15:22:27] [INFO ] Flatten gal took : 240 ms
[2024-06-01 15:22:27] [INFO ] Flatten gal took : 192 ms
[2024-06-01 15:22:28] [INFO ] Input system was already deterministic with 1587 transitions.
Support contains 236 out of 449 places (down from 237) after GAL structural reductions.
RANDOM walk for 40001 steps (212 resets) in 2584 ms. (15 steps per ms) remains 53/86 properties
BEST_FIRST walk for 4003 steps (18 resets) in 93 ms. (42 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (22 resets) in 56 ms. (70 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (19 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (15 resets) in 36 ms. (108 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (14 resets) in 43 ms. (90 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (18 resets) in 49 ms. (80 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (24 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (26 resets) in 33 ms. (117 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (21 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (13 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (9 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (12 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (112 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (18 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (15 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (17 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (18 resets) in 38 ms. (102 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (17 resets) in 59 ms. (66 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (17 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (14 resets) in 61 ms. (64 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (18 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (19 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (18 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (12 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (11 resets) in 46 ms. (85 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (16 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (20 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (13 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (21 resets) in 28 ms. (137 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (30 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (17 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (12 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (14 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (13 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
[2024-06-01 15:22:29] [INFO ] Flow matrix only has 1563 transitions (discarded 24 similar events)
// Phase 1: matrix 1563 rows 449 cols
[2024-06-01 15:22:29] [INFO ] Computed 50 invariants in 45 ms
[2024-06-01 15:22:29] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp28 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 48 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 2 (OVERLAPS) 137/310 variables, 12/15 constraints. Problems are: Problem set: 26 solved, 27 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/310 variables, 2/17 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/17 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 11/321 variables, 4/21 constraints. Problems are: Problem set: 28 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 28 solved, 25 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 7 (OVERLAPS) 127/448 variables, 28/49 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/448 variables, 0/49 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/449 variables, 1/50 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/50 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1563/2012 variables, 449/499 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2012 variables, 112/611 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2012 variables, 0/611 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2012 variables, 0/611 constraints. Problems are: Problem set: 52 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2012/2012 variables, and 611 constraints, problems are : Problem set: 52 solved, 1 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 449/449 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/84 variables, 3/3 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/3 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 29/113 variables, 5/8 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/183 variables, 4/12 constraints. Problems are: Problem set: 52 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/183 variables, 0/12 constraints. Problems are: Problem set: 52 solved, 1 unsolved
Problem AtomicPropp78 is UNSAT
After SMT solving in domain Int declared 426/2012 variables, and 32 constraints, problems are : Problem set: 53 solved, 0 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 12/20 constraints, Generalized P Invariants (flows): 20/30 constraints, State Equation: 0/449 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 2591ms problems are : Problem set: 53 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 53 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:22:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 15:22:32] [INFO ] Flatten gal took : 86 ms
[2024-06-01 15:22:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:22:32] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:22:32] [INFO ] Input system was already deterministic with 1587 transitions.
Support contains 50 out of 449 places (down from 74) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 449/449 places, 1587/1587 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 443 transition count 1557
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 413 transition count 1557
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 60 place count 413 transition count 1509
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 156 place count 365 transition count 1509
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 246 place count 320 transition count 1464
Applied a total of 246 rules in 173 ms. Remains 320 /449 variables (removed 129) and now considering 1464/1587 (removed 123) transitions.
Running 1458 sub problems to find dead transitions.
[2024-06-01 15:22:33] [INFO ] Flow matrix only has 1440 transitions (discarded 24 similar events)
// Phase 1: matrix 1440 rows 320 cols
[2024-06-01 15:22:33] [INFO ] Computed 44 invariants in 47 ms
[2024-06-01 15:22:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 18 places in 239 ms of which 2 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 2 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 2 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 94 places in 255 ms of which 3 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 84 places in 297 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1760 variables, and 41 constraints, problems are : Problem set: 0 solved, 1458 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1458/1458 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1458 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1458 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD555 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD680 is UNSAT
Problem TDEAD682 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD707 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD869 is UNSAT
Problem TDEAD870 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD908 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD929 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD932 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1032 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1126 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/317 variables, 3/44 constraints. Problems are: Problem set: 315 solved, 1143 unsolved
[2024-06-01 15:23:24] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/1760 variables, and 45 constraints, problems are : Problem set: 315 solved, 1143 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 19/24 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1458 constraints, Known Traps: 6/6 constraints]
After SMT, in 54337ms problems are : Problem set: 315 solved, 1143 unsolved
Search for dead transitions found 315 dead transitions in 54355ms
Found 315 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 315 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 315 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 320/449 places, 1149/1587 transitions.
Applied a total of 0 rules in 35 ms. Remains 320 /320 variables (removed 0) and now considering 1149/1149 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54571 ms. Remains : 320/449 places, 1149/1587 transitions.
[2024-06-01 15:23:27] [INFO ] Flatten gal took : 63 ms
[2024-06-01 15:23:27] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:23:27] [INFO ] Input system was already deterministic with 1149 transitions.
RANDOM walk for 496 steps (4 resets) in 14 ms. (33 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 449/449 places, 1587/1587 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 443 transition count 1587
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 441 transition count 1585
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 441 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 440 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 440 transition count 1584
Applied a total of 12 rules in 110 ms. Remains 440 /449 variables (removed 9) and now considering 1584/1587 (removed 3) transitions.
Running 1578 sub problems to find dead transitions.
[2024-06-01 15:23:27] [INFO ] Flow matrix only has 1560 transitions (discarded 24 similar events)
// Phase 1: matrix 1560 rows 440 cols
[2024-06-01 15:23:27] [INFO ] Computed 44 invariants in 36 ms
[2024-06-01 15:23:27] [INFO ] State equation strengthened by 112 read => feed constraints.
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-S06J04T04-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-05
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-12
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-14
Could not compute solution for formula : PolyORBLF-PT-S06J04T04-CTLCardinality-2024-15
BK_STOP 1717255416739
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-S06J04T04-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/633/ctl_0_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/633/ctl_1_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/633/ctl_2_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/633/ctl_3_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/633/ctl_4_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/633/ctl_5_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/633/ctl_6_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/633/ctl_7_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/633/ctl_8_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/633/ctl_9_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/633/ctl_10_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/633/ctl_11_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/633/ctl_12_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/633/ctl_13_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/633/ctl_14_
ctl formula name PolyORBLF-PT-S06J04T04-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/633/ctl_15_
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-S06J04T04"
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-S06J04T04, 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-171654446800313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 ;