About the Execution of LTSMin+red for PolyORBLF-PT-S04J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15170.128 | 469169.00 | 650034.00 | 140.70 | ?FFT?FF?????F??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-171654446800281.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-S04J04T10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800281
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.7M
-rw-r--r-- 1 mcc users 27K Apr 11 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 11 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Apr 11 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 530K Apr 11 17:12 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 12K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 17:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 263K Apr 11 17:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 17:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.2M 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-S04J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T10-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717254103670
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-S04J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:01:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:01:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:01:45] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-06-01 15:01:45] [INFO ] Transformed 870 places.
[2024-06-01 15:01:45] [INFO ] Transformed 5034 transitions.
[2024-06-01 15:01:45] [INFO ] Parsed PT model containing 870 places and 5034 transitions and 34774 arcs in 455 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Support contains 563 out of 870 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Applied a total of 0 rules in 62 ms. Remains 870 /870 variables (removed 0) and now considering 2324/2324 (removed 0) transitions.
Running 2320 sub problems to find dead transitions.
[2024-06-01 15:01:45] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
// Phase 1: matrix 2284 rows 870 cols
[2024-06-01 15:01:46] [INFO ] Computed 58 invariants in 184 ms
[2024-06-01 15:01:46] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
SMT process timed out in 32493ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 32555ms
[2024-06-01 15:02:18] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:02:18] [INFO ] Invariant cache hit.
[2024-06-01 15:02:19] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-06-01 15:02:19] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:02:19] [INFO ] Invariant cache hit.
[2024-06-01 15:02:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:02:32] [INFO ] Implicit Places using invariants and state equation in 13703 ms returned []
Implicit Place search using SMT with State Equation took 14551 ms to find 0 implicit places.
Running 2320 sub problems to find dead transitions.
[2024-06-01 15:02:32] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:02:32] [INFO ] Invariant cache hit.
[2024-06-01 15:02:33] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/862 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/862 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 2320 unsolved
[2024-06-01 15:03:09] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 16 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 2 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 75 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:03:10] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 1 ms to minimize.
[2024-06-01 15:03:11] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:03:11] [INFO ] Deduced a trap composed of 75 places in 52 ms of which 2 ms to minimize.
[2024-06-01 15:03:11] [INFO ] Deduced a trap composed of 498 places in 563 ms of which 6 ms to minimize.
[2024-06-01 15:03:12] [INFO ] Deduced a trap composed of 442 places in 695 ms of which 5 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 23 places in 599 ms of which 4 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 1 ms to minimize.
[2024-06-01 15:03:13] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-06-01 15:03:14] [INFO ] Deduced a trap composed of 237 places in 493 ms of which 4 ms to minimize.
[2024-06-01 15:03:16] [INFO ] Deduced a trap composed of 427 places in 594 ms of which 6 ms to minimize.
SMT process timed out in 43467ms, After SMT, problems are : Problem set: 0 solved, 2320 unsolved
Search for dead transitions found 0 dead transitions in 43496ms
Finished structural reductions in LTL mode , in 1 iterations and 90739 ms. Remains : 870/870 places, 2324/2324 transitions.
Support contains 563 out of 870 places after structural reductions.
[2024-06-01 15:03:16] [INFO ] Flatten gal took : 205 ms
[2024-06-01 15:03:17] [INFO ] Flatten gal took : 137 ms
[2024-06-01 15:03:17] [INFO ] Input system was already deterministic with 2324 transitions.
RANDOM walk for 40000 steps (8 resets) in 3274 ms. (12 steps per ms) remains 78/121 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 78/78 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 78/78 properties
[2024-06-01 15:03:19] [INFO ] Flow matrix only has 2284 transitions (discarded 40 similar events)
[2024-06-01 15:03:19] [INFO ] Invariant cache hit.
[2024-06-01 15:03:19] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp94 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp106 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp108 is UNSAT
Problem AtomicPropp110 is UNSAT
Problem AtomicPropp112 is UNSAT
Problem AtomicPropp117 is UNSAT
At refinement iteration 1 (OVERLAPS) 178/610 variables, 14/14 constraints. Problems are: Problem set: 31 solved, 47 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 4/18 constraints. Problems are: Problem set: 32 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 0/18 constraints. Problems are: Problem set: 32 solved, 46 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp109 is UNSAT
Problem AtomicPropp111 is UNSAT
Problem AtomicPropp113 is UNSAT
At refinement iteration 4 (OVERLAPS) 256/866 variables, 37/55 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 0/55 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/867 variables, 1/56 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 0/56 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/868 variables, 1/57 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/868 variables, 0/57 constraints. Problems are: Problem set: 76 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3152/3154 variables, and 925 constraints, problems are : Problem set: 76 solved, 2 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 868/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 76 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/139 variables, 2/2 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/141 variables, 2/4 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/4 constraints. Problems are: Problem set: 76 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 679/820 variables, 20/24 constraints. Problems are: Problem set: 76 solved, 2 unsolved
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 4 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 75 places in 219 ms of which 3 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 2 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 75 places in 145 ms of which 2 ms to minimize.
[2024-06-01 15:03:25] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:03:26] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp120 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 8/32 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 0/32 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/832 variables, 10/42 constraints. Problems are: Problem set: 77 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 0/42 constraints. Problems are: Problem set: 77 solved, 1 unsolved
Problem AtomicPropp98 is UNSAT
After SMT solving in domain Int declared 867/3154 variables, and 64 constraints, problems are : Problem set: 78 solved, 0 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/870 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/78 constraints, Known Traps: 8/8 constraints]
After SMT, in 6779ms problems are : Problem set: 78 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 78 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:03:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 15:03:26] [INFO ] Flatten gal took : 131 ms
[2024-06-01 15:03:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:03:26] [INFO ] Flatten gal took : 149 ms
[2024-06-01 15:03:26] [INFO ] Input system was already deterministic with 2324 transitions.
Support contains 103 out of 870 places (down from 153) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 135 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:03:27] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:03:27] [INFO ] Computed 54 invariants in 112 ms
[2024-06-01 15:03:27] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 3.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 3.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 4.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 3.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 2.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 2.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 4.0)
(s226 1.0)
(s227 2.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 2.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 4.0)
(s261 1.0)
(s262 4.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 3.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 2.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 9.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 4.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 4.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 2.0)
(s366 1.0)
(s367 1.0)
(s368 3.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 4.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 2.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 4.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 3.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 timeout
1.0)
(s507 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34235ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34263ms
Finished structural reductions in LTL mode , in 1 iterations and 34407 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 15:04:01] [INFO ] Flatten gal took : 75 ms
[2024-06-01 15:04:01] [INFO ] Flatten gal took : 78 ms
[2024-06-01 15:04:01] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 866 transition count 2264
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 806 transition count 2254
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 796 transition count 2254
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 140 place count 796 transition count 2154
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 340 place count 696 transition count 2154
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 440 place count 646 transition count 2104
Applied a total of 440 rules in 256 ms. Remains 646 /870 variables (removed 224) and now considering 2104/2324 (removed 220) transitions.
Running 2100 sub problems to find dead transitions.
[2024-06-01 15:04:02] [INFO ] Flow matrix only has 2064 transitions (discarded 40 similar events)
// Phase 1: matrix 2064 rows 646 cols
[2024-06-01 15:04:02] [INFO ] Computed 54 invariants in 64 ms
[2024-06-01 15:04:02] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 15:04:32] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2024-06-01 15:04:35] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/2710 variables, and 47 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/43 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2100/2100 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/642 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/642 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/642 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2100 unsolved
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 53 places in 503 ms of which 4 ms to minimize.
[2024-06-01 15:04:41] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 3 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 53 places in 444 ms of which 4 ms to minimize.
[2024-06-01 15:04:42] [INFO ] Deduced a trap composed of 53 places in 457 ms of which 3 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 39 places in 389 ms of which 3 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:04:43] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-06-01 15:04:44] [INFO ] Deduced a trap composed of 55 places in 359 ms of which 4 ms to minimize.
[2024-06-01 15:04:50] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/2710 variables, and 58 constraints, problems are : Problem set: 0 solved, 2100 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/11 constraints, Generalized P Invariants (flows): 35/43 constraints, State Equation: 0/646 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2100 constraints, Known Traps: 13/13 constraints]
After SMT, in 54015ms problems are : Problem set: 0 solved, 2100 unsolved
Search for dead transitions found 0 dead transitions in 54043ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 54307 ms. Remains : 646/870 places, 2104/2324 transitions.
[2024-06-01 15:04:56] [INFO ] Flatten gal took : 64 ms
[2024-06-01 15:04:56] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:04:56] [INFO ] Input system was already deterministic with 2104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 62 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:04:56] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:04:56] [INFO ] Computed 54 invariants in 78 ms
[2024-06-01 15:04:56] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 34516ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 34545ms
Finished structural reductions in LTL mode , in 1 iterations and 34619 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 15:05:31] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:05:31] [INFO ] Flatten gal took : 74 ms
[2024-06-01 15:05:31] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 866 transition count 2236
Reduce places removed 88 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 89 rules applied. Total rules applied 177 place count 778 transition count 2235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 178 place count 777 transition count 2235
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 178 place count 777 transition count 2136
Deduced a syphon composed of 99 places in 4 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 376 place count 678 transition count 2136
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 4 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 572 place count 580 transition count 2038
Applied a total of 572 rules in 222 ms. Remains 580 /870 variables (removed 290) and now considering 2038/2324 (removed 286) transitions.
Running 2034 sub problems to find dead transitions.
[2024-06-01 15:05:31] [INFO ] Flow matrix only has 1998 transitions (discarded 40 similar events)
// Phase 1: matrix 1998 rows 580 cols
[2024-06-01 15:05:31] [INFO ] Computed 54 invariants in 66 ms
[2024-06-01 15:05:31] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 3 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:05:59] [INFO ] Deduced a trap composed of 198 places in 414 ms of which 4 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:06:00] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:06:02] [INFO ] Deduced a trap composed of 39 places in 330 ms of which 3 ms to minimize.
[2024-06-01 15:06:03] [INFO ] Deduced a trap composed of 23 places in 327 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 576/2578 variables, and 63 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2034/2034 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2034 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/576 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/576 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/576 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 2034 unsolved
[2024-06-01 15:06:15] [INFO ] Deduced a trap composed of 234 places in 485 ms of which 4 ms to minimize.
[2024-06-01 15:06:18] [INFO ] Deduced a trap composed of 199 places in 445 ms of which 5 ms to minimize.
[2024-06-01 15:06:19] [INFO ] Deduced a trap composed of 294 places in 389 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 576/2578 variables, and 66 constraints, problems are : Problem set: 0 solved, 2034 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 39/42 constraints, State Equation: 0/580 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2034 constraints, Known Traps: 16/16 constraints]
After SMT, in 53124ms problems are : Problem set: 0 solved, 2034 unsolved
Search for dead transitions found 0 dead transitions in 53151ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 53381 ms. Remains : 580/870 places, 2038/2324 transitions.
[2024-06-01 15:06:24] [INFO ] Flatten gal took : 67 ms
[2024-06-01 15:06:24] [INFO ] Flatten gal took : 71 ms
[2024-06-01 15:06:25] [INFO ] Input system was already deterministic with 2038 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 52 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:06:25] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:06:25] [INFO ] Computed 54 invariants in 76 ms
[2024-06-01 15:06:25] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 2.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 3.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 3.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 4.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 3.0)
(s83 0.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 2.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 2.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 0.0)
(s199 1.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 4.0)
(s226 1.0)
(s227 2.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 2.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 4.0)
(s261 1.0)
(s262 4.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 3.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 1.0)
(s314 0.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 2.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 9.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 4.0)
(s353 0.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 4.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 2.0)
(s366 1.0)
(s367 1.0)
(s368 3.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 1.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 1.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 0.0)
(s420 1.0)
(s421 4.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 0.0)
(s438 1.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 1.0)
(s466 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 1.0)
(s472 2.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 0.0)
(s483 4.0)
(s484 1.0)
(s485 0.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 3.0)
(s498 1.0)
(s499 1.0)
(s500 0.0)
(s501 1.0)
(s502 1.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 0.0)
(s512 1.0)
(s513 2.0)
(s514 0.0)
(s515 0.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 0.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 0.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 0.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32446ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32467ms
Finished structural reductions in LTL mode , in 1 iterations and 32525 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 15:06:57] [INFO ] Flatten gal took : 73 ms
[2024-06-01 15:06:57] [INFO ] Flatten gal took : 82 ms
[2024-06-01 15:06:57] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 89 place count 866 transition count 2235
Reduce places removed 89 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 90 rules applied. Total rules applied 179 place count 777 transition count 2234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 180 place count 776 transition count 2234
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 180 place count 776 transition count 2134
Deduced a syphon composed of 100 places in 2 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 380 place count 676 transition count 2134
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 576 place count 578 transition count 2036
Applied a total of 576 rules in 131 ms. Remains 578 /870 variables (removed 292) and now considering 2036/2324 (removed 288) transitions.
Running 2032 sub problems to find dead transitions.
[2024-06-01 15:06:58] [INFO ] Flow matrix only has 1996 transitions (discarded 40 similar events)
// Phase 1: matrix 1996 rows 578 cols
[2024-06-01 15:06:58] [INFO ] Computed 54 invariants in 57 ms
[2024-06-01 15:06:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
[2024-06-01 15:07:27] [INFO ] Deduced a trap composed of 207 places in 318 ms of which 3 ms to minimize.
[2024-06-01 15:07:28] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 2 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 42 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:07:29] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:07:30] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 574/2574 variables, and 55 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/578 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2032/2032 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2032 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/574 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/574 variables, 37/49 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 2032 unsolved
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 46 places in 213 ms of which 3 ms to minimize.
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 3 ms to minimize.
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 2 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 46 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:07:41] [INFO ] Deduced a trap composed of 197 places in 329 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/2574 variables, and 65 constraints, problems are : Problem set: 0 solved, 2032 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 37/41 constraints, State Equation: 0/578 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2032 constraints, Known Traps: 16/16 constraints]
After SMT, in 52950ms problems are : Problem set: 0 solved, 2032 unsolved
Search for dead transitions found 0 dead transitions in 52968ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 53103 ms. Remains : 578/870 places, 2036/2324 transitions.
[2024-06-01 15:07:51] [INFO ] Flatten gal took : 58 ms
[2024-06-01 15:07:51] [INFO ] Flatten gal took : 63 ms
[2024-06-01 15:07:51] [INFO ] Input system was already deterministic with 2036 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 75 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:07:51] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:07:51] [INFO ] Computed 54 invariants in 64 ms
[2024-06-01 15:07:51] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 33638ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 33669ms
Finished structural reductions in LTL mode , in 1 iterations and 33752 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 15:08:25] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:08:25] [INFO ] Flatten gal took : 67 ms
[2024-06-01 15:08:25] [INFO ] Input system was already deterministic with 2304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 866 transition count 2234
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 180 place count 776 transition count 2234
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 180 place count 776 transition count 2135
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 378 place count 677 transition count 2135
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 558 place count 587 transition count 2045
Applied a total of 558 rules in 100 ms. Remains 587 /870 variables (removed 283) and now considering 2045/2324 (removed 279) transitions.
Running 2041 sub problems to find dead transitions.
[2024-06-01 15:08:25] [INFO ] Flow matrix only has 2005 transitions (discarded 40 similar events)
// Phase 1: matrix 2005 rows 587 cols
[2024-06-01 15:08:25] [INFO ] Computed 54 invariants in 64 ms
[2024-06-01 15:08:25] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/583 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 2041 unsolved
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 47 places in 152 ms of which 3 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:08:53] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 0 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 231 places in 369 ms of which 4 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 4 ms to minimize.
[2024-06-01 15:08:54] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:08:55] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 241 places in 412 ms of which 5 ms to minimize.
[2024-06-01 15:08:57] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 3 ms to minimize.
[2024-06-01 15:08:58] [INFO ] Deduced a trap composed of 198 places in 453 ms of which 6 ms to minimize.
SMT process timed out in 33074ms, After SMT, problems are : Problem set: 0 solved, 2041 unsolved
Search for dead transitions found 0 dead transitions in 33093ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 33197 ms. Remains : 587/870 places, 2045/2324 transitions.
[2024-06-01 15:08:58] [INFO ] Flatten gal took : 84 ms
[2024-06-01 15:08:58] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:08:58] [INFO ] Input system was already deterministic with 2045 transitions.
Starting structural reductions in LTL mode, iteration 0 : 870/870 places, 2324/2324 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 866 transition count 2324
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 856 transition count 2314
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 856 transition count 2314
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 34 place count 846 transition count 2304
Iterating global reduction 1 with 10 rules applied. Total rules applied 44 place count 846 transition count 2304
Applied a total of 44 rules in 62 ms. Remains 846 /870 variables (removed 24) and now considering 2304/2324 (removed 20) transitions.
Running 2300 sub problems to find dead transitions.
[2024-06-01 15:08:59] [INFO ] Flow matrix only has 2264 transitions (discarded 40 similar events)
// Phase 1: matrix 2264 rows 846 cols
[2024-06-01 15:08:59] [INFO ] Computed 54 invariants in 76 ms
[2024-06-01 15:08:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/842 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2300 unsolved
SMT process timed out in 32911ms, After SMT, problems are : Problem set: 0 solved, 2300 unsolved
Search for dead transitions found 0 dead transitions in 32934ms
Finished structural reductions in LTL mode , in 1 iterations and 33002 ms. Remains : 846/870 places, 2304/2324 transitions.
[2024-06-01 15:09:31] [INFO ] Flatten gal took : 70 ms
[2024-06-01 15:09:32] [INFO ] Flatten gal took : 75 ms
[2024-06-01 15:09:32] [INFO ] Input system was already deterministic with 2304 transitions.
[2024-06-01 15:09:32] [INFO ] Flatten gal took : 75 ms
[2024-06-01 15:09:32] [INFO ] Flatten gal took : 82 ms
[2024-06-01 15:09:32] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:09:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 870 places, 2324 transitions and 11844 arcs took 35 ms.
Total runtime 467451 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-S04J04T10-CTLCardinality-2024-00
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-04
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-07
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-08
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-09
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-11
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J04T10-CTLCardinality-2024-14
BK_STOP 1717254572839
--------------------
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-S04J04T10-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/858/ctl_0_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/858/ctl_1_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/858/ctl_2_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/858/ctl_3_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/858/ctl_4_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/858/ctl_5_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/858/ctl_6_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/858/ctl_7_
ctl formula name PolyORBLF-PT-S04J04T10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/858/ctl_8_
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-S04J04T10"
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-S04J04T10, 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-171654446800281"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T10.tgz
mv PolyORBLF-PT-S04J04T10 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 ;