About the Execution of ITS-Tools for PolyORBLF-PT-S04J04T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 450118.00 | 0.00 | 0.00 | F??FF?TTTTFFFF?? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446700273.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S04J04T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446700273
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.4M
-rw-r--r-- 1 mcc users 21K Apr 11 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 109K Apr 11 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 501K Apr 11 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 11 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 11 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 780K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 3.3M 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-S04J04T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716917197287
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J04T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 17:26:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 17:26:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:26:39] [INFO ] Load time of PNML (sax parser for PT used): 347 ms
[2024-05-28 17:26:39] [INFO ] Transformed 712 places.
[2024-05-28 17:26:39] [INFO ] Transformed 4012 transitions.
[2024-05-28 17:26:39] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 573 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 474 out of 712 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 54 ms. Remains 712 /712 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 17:26:40] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2024-05-28 17:26:40] [INFO ] Computed 54 invariants in 141 ms
[2024-05-28 17:26:40] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:27:05] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 45 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2524 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20113 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:27:11] [INFO ] Deduced a trap composed of 41 places in 450 ms of which 5 ms to minimize.
[2024-05-28 17:27:11] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 3 ms to minimize.
[2024-05-28 17:27:12] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 2 ms to minimize.
[2024-05-28 17:27:12] [INFO ] Deduced a trap composed of 75 places in 96 ms of which 2 ms to minimize.
[2024-05-28 17:27:12] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-05-28 17:27:12] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2024-05-28 17:27:12] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-28 17:27:14] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 2 ms to minimize.
[2024-05-28 17:27:19] [INFO ] Deduced a trap composed of 146 places in 250 ms of which 4 ms to minimize.
[2024-05-28 17:27:28] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 52 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 11/11 constraints]
After SMT, in 48567ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 48627ms
[2024-05-28 17:27:28] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:27:28] [INFO ] Invariant cache hit.
[2024-05-28 17:27:29] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-28 17:27:29] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:27:29] [INFO ] Invariant cache hit.
[2024-05-28 17:27:30] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:27:39] [INFO ] Implicit Places using invariants and state equation in 10047 ms returned []
Implicit Place search using SMT with State Equation took 10422 ms to find 0 implicit places.
Running 1840 sub problems to find dead transitions.
[2024-05-28 17:27:39] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:27:39] [INFO ] Invariant cache hit.
[2024-05-28 17:27:39] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:28:01] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:28:08] [INFO ] Deduced a trap composed of 146 places in 130 ms of which 2 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 Real declared 704/2524 variables, and 43 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:28:27] [INFO ] Deduced a trap composed of 61 places in 369 ms of which 4 ms to minimize.
[2024-05-28 17:28:28] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 3 ms to minimize.
[2024-05-28 17:28:28] [INFO ] Deduced a trap composed of 75 places in 297 ms of which 3 ms to minimize.
[2024-05-28 17:28:28] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 3 ms to minimize.
[2024-05-28 17:28:28] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-28 17:28:29] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:28:29] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 1 ms to minimize.
[2024-05-28 17:28:29] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:28:29] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-28 17:28:33] [INFO ] Deduced a trap composed of 19 places in 269 ms of which 3 ms to minimize.
[2024-05-28 17:28:33] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
[2024-05-28 17:28:33] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2524 variables, and 55 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 14/14 constraints]
After SMT, in 67943ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 67989ms
Finished structural reductions in LTL mode , in 1 iterations and 127169 ms. Remains : 712/712 places, 1844/1844 transitions.
Support contains 474 out of 712 places after structural reductions.
[2024-05-28 17:28:47] [INFO ] Flatten gal took : 197 ms
[2024-05-28 17:28:47] [INFO ] Flatten gal took : 110 ms
[2024-05-28 17:28:48] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 458 out of 712 places (down from 474) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4553 ms. (8 steps per ms) remains 59/106 properties
BEST_FIRST walk for 4002 steps (8 resets) in 145 ms. (27 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 58/59 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
[2024-05-28 17:28:51] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:28:51] [INFO ] Invariant cache hit.
[2024-05-28 17:28:51] [INFO ] State equation strengthened by 160 read => feed constraints.
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp38 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 55 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp98 is UNSAT
Problem AtomicPropp100 is UNSAT
At refinement iteration 2 (OVERLAPS) 124/436 variables, 10/11 constraints. Problems are: Problem set: 15 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/436 variables, 2/13 constraints. Problems are: Problem set: 15 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 0/13 constraints. Problems are: Problem set: 15 solved, 43 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp101 is UNSAT
Problem AtomicPropp105 is UNSAT
At refinement iteration 5 (OVERLAPS) 273/709 variables, 39/52 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/709 variables, 0/52 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/710 variables, 1/53 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/710 variables, 0/53 constraints. Problems are: Problem set: 56 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1812/2522 variables, 710/763 constraints. Problems are: Problem set: 56 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2522/2524 variables, and 923 constraints, problems are : Problem set: 56 solved, 2 unsolved in 4512 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 710/712 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 56 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 56 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 598/655 variables, 20/20 constraints. Problems are: Problem set: 57 solved, 1 unsolved
[2024-05-28 17:28:56] [INFO ] Deduced a trap composed of 410 places in 517 ms of which 3 ms to minimize.
[2024-05-28 17:28:56] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/655 variables, 2/22 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/655 variables, 0/22 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 27/682 variables, 11/33 constraints. Problems are: Problem set: 57 solved, 1 unsolved
[2024-05-28 17:28:57] [INFO ] Deduced a trap composed of 75 places in 234 ms of which 5 ms to minimize.
[2024-05-28 17:28:57] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 1 ms to minimize.
[2024-05-28 17:28:57] [INFO ] Deduced a trap composed of 76 places in 233 ms of which 3 ms to minimize.
[2024-05-28 17:28:58] [INFO ] Deduced a trap composed of 75 places in 623 ms of which 2 ms to minimize.
[2024-05-28 17:28:58] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 2 ms to minimize.
[2024-05-28 17:28:58] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 1 ms to minimize.
[2024-05-28 17:28:58] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/682 variables, 7/40 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/682 variables, 0/40 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 27/709 variables, 21/61 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/709 variables, 0/61 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/710 variables, 1/62 constraints. Problems are: Problem set: 57 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/710 variables, 0/62 constraints. Problems are: Problem set: 57 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2522/2524 variables, and 772 constraints, problems are : Problem set: 57 solved, 1 unsolved in 4957 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 710/712 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/58 constraints, Known Traps: 9/9 constraints]
After SMT, in 9722ms problems are : Problem set: 57 solved, 1 unsolved
Parikh walk visited 0 properties in 219 ms.
Support contains 1 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 14 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 468 place count 476 transition count 1612
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 484 place count 476 transition count 1596
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 500 place count 460 transition count 1596
Applied a total of 500 rules in 558 ms. Remains 460 /712 variables (removed 252) and now considering 1596/1844 (removed 248) transitions.
Running 1592 sub problems to find dead transitions.
[2024-05-28 17:29:01] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
// Phase 1: matrix 1564 rows 460 cols
[2024-05-28 17:29:01] [INFO ] Computed 50 invariants in 37 ms
[2024-05-28 17:29:01] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
[2024-05-28 17:29:21] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 6 ms to minimize.
[2024-05-28 17:29:21] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2024-05-28 17:29:21] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 0 ms to minimize.
[2024-05-28 17:29:21] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:29:21] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 17:29:22] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-05-28 17:29:22] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-28 17:29:22] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 17:29:22] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 17:29:23] [INFO ] Deduced a trap composed of 34 places in 244 ms of which 2 ms to minimize.
[2024-05-28 17:29:24] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 2 ms to minimize.
[2024-05-28 17:29:28] [INFO ] Deduced a trap composed of 165 places in 232 ms of which 3 ms to minimize.
[2024-05-28 17:29:29] [INFO ] Deduced a trap composed of 172 places in 251 ms of which 2 ms to minimize.
[2024-05-28 17:29:29] [INFO ] Deduced a trap composed of 180 places in 265 ms of which 2 ms to minimize.
[2024-05-28 17:29:30] [INFO ] Deduced a trap composed of 190 places in 319 ms of which 3 ms to minimize.
[2024-05-28 17:29:30] [INFO ] Deduced a trap composed of 198 places in 294 ms of which 3 ms to minimize.
[2024-05-28 17:29:32] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 3 ms to minimize.
[2024-05-28 17:29:32] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 3 ms to minimize.
[2024-05-28 17:29:33] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 1 ms to minimize.
SMT process timed out in 31466ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 31494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32070 ms. Remains : 460/712 places, 1596/1844 transitions.
RANDOM walk for 40000 steps (13 resets) in 732 ms. (54 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 167267 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 167267 steps, saw 120721 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 17:29:36] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2024-05-28 17:29:36] [INFO ] Invariant cache hit.
[2024-05-28 17:29:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 409/420 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/439 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:29:36] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-05-28 17:29:37] [INFO ] Deduced a trap composed of 45 places in 444 ms of which 9 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 44 places in 383 ms of which 2 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 3 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 0 ms to minimize.
[2024-05-28 17:29:38] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/458 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2022/2024 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 458/460 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 409/420 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/439 variables, 10/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 19/458 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1564/2022 variables, 458/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2022 variables, 160/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2022 variables, 1/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2022 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/2024 variables, 2/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2024 variables, 1/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2024 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/2024 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2024/2024 variables, and 678 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3450 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 460/460 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 48489ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 175 ms.
Support contains 1 out of 460 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1596/1596 transitions.
Applied a total of 0 rules in 46 ms. Remains 460 /460 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 460/460 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 460/460 places, 1596/1596 transitions.
Applied a total of 0 rules in 46 ms. Remains 460 /460 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-28 17:30:25] [INFO ] Flow matrix only has 1564 transitions (discarded 32 similar events)
[2024-05-28 17:30:25] [INFO ] Invariant cache hit.
[2024-05-28 17:30:26] [INFO ] Implicit Places using invariants in 999 ms returned [93, 145, 163, 227, 312, 351, 359, 447]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1026 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 452/460 places, 1596/1596 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 446 transition count 1590
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 446 transition count 1590
Applied a total of 12 rules in 61 ms. Remains 446 /452 variables (removed 6) and now considering 1590/1596 (removed 6) transitions.
[2024-05-28 17:30:26] [INFO ] Flow matrix only has 1558 transitions (discarded 32 similar events)
// Phase 1: matrix 1558 rows 446 cols
[2024-05-28 17:30:26] [INFO ] Computed 42 invariants in 37 ms
[2024-05-28 17:30:26] [INFO ] Implicit Places using invariants in 679 ms returned []
[2024-05-28 17:30:26] [INFO ] Flow matrix only has 1558 transitions (discarded 32 similar events)
[2024-05-28 17:30:26] [INFO ] Invariant cache hit.
[2024-05-28 17:30:28] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:30:43] [INFO ] Implicit Places using invariants and state equation in 16639 ms returned []
Implicit Place search using SMT with State Equation took 17320 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/460 places, 1590/1596 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18454 ms. Remains : 446/460 places, 1590/1596 transitions.
Successfully simplified 57 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 4 formulas.
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:30:43] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 17:30:43] [INFO ] Flatten gal took : 77 ms
[2024-05-28 17:30:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J04T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:30:43] [INFO ] Flatten gal took : 80 ms
[2024-05-28 17:30:43] [INFO ] Input system was already deterministic with 1844 transitions.
Support contains 72 out of 712 places (down from 184) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 708 transition count 1844
Applied a total of 4 rules in 20 ms. Remains 708 /712 variables (removed 4) and now considering 1844/1844 (removed 0) transitions.
Running 1840 sub problems to find dead transitions.
[2024-05-28 17:30:44] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 708 cols
[2024-05-28 17:30:44] [INFO ] Computed 50 invariants in 79 ms
[2024-05-28 17:30:44] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:31:07] [INFO ] Deduced a trap composed of 147 places in 177 ms of which 4 ms to minimize.
[2024-05-28 17:31:08] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 704/2520 variables, and 42 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1840/1840 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1840 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/704 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/704 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/704 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
[2024-05-28 17:31:17] [INFO ] Deduced a trap composed of 5 places in 366 ms of which 4 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 76 places in 283 ms of which 4 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 0 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
[2024-05-28 17:31:18] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 0 ms to minimize.
[2024-05-28 17:31:24] [INFO ] Deduced a trap composed of 146 places in 124 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 704/2520 variables, and 50 constraints, problems are : Problem set: 0 solved, 1840 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 28/38 constraints, State Equation: 0/708 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1840 constraints, Known Traps: 10/10 constraints]
After SMT, in 49277ms problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 49291ms
[2024-05-28 17:31:33] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
[2024-05-28 17:31:33] [INFO ] Invariant cache hit.
[2024-05-28 17:31:33] [INFO ] Implicit Places using invariants in 524 ms returned [142, 228, 251, 352, 479, 545, 558, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 541 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 700/712 places, 1844/1844 transitions.
Applied a total of 0 rules in 28 ms. Remains 700 /700 variables (removed 0) and now considering 1844/1844 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49887 ms. Remains : 700/712 places, 1844/1844 transitions.
[2024-05-28 17:31:33] [INFO ] Flatten gal took : 101 ms
[2024-05-28 17:31:34] [INFO ] Flatten gal took : 61 ms
[2024-05-28 17:31:34] [INFO ] Input system was already deterministic with 1844 transitions.
[2024-05-28 17:31:34] [INFO ] Flatten gal took : 151 ms
[2024-05-28 17:31:34] [INFO ] Flatten gal took : 152 ms
[2024-05-28 17:31:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality15457963972620016949.gal : 82 ms
[2024-05-28 17:31:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality12216049666152931356.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15457963972620016949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12216049666152931356.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 17:32:05] [INFO ] Flatten gal took : 120 ms
[2024-05-28 17:32:05] [INFO ] Applying decomposition
[2024-05-28 17:32:05] [INFO ] Flatten gal took : 81 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13641740329377542987.txt' '-o' '/tmp/graph13641740329377542987.bin' '-w' '/tmp/graph13641740329377542987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13641740329377542987.bin' '-l' '-1' '-v' '-w' '/tmp/graph13641740329377542987.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:32:05] [INFO ] Decomposing Gal with order
[2024-05-28 17:32:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:32:06] [INFO ] Removed a total of 1492 redundant transitions.
[2024-05-28 17:32:06] [INFO ] Flatten gal took : 220 ms
[2024-05-28 17:32:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 139 labels/synchronizations in 44 ms.
[2024-05-28 17:32:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality6814442298941504316.gal : 17 ms
[2024-05-28 17:32:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality517016368763235299.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6814442298941504316.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality517016368763235299.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 636 transition count 1772
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 144 place count 636 transition count 1724
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 240 place count 588 transition count 1724
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 400 place count 508 transition count 1644
Applied a total of 400 rules in 88 ms. Remains 508 /712 variables (removed 204) and now considering 1644/1844 (removed 200) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 17:32:36] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
// Phase 1: matrix 1612 rows 508 cols
[2024-05-28 17:32:36] [INFO ] Computed 50 invariants in 31 ms
[2024-05-28 17:32:36] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 17:32:54] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-28 17:32:58] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 504/2120 variables, and 43 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 28/35 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1640/1640 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1640 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 28/41 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/504 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 50 places in 270 ms of which 3 ms to minimize.
[2024-05-28 17:33:07] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-05-28 17:33:08] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 2 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 2 ms to minimize.
[2024-05-28 17:33:09] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 2 ms to minimize.
[2024-05-28 17:33:13] [INFO ] Deduced a trap composed of 52 places in 43 ms of which 1 ms to minimize.
[2024-05-28 17:33:14] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/504 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/2120 variables, and 53 constraints, problems are : Problem set: 0 solved, 1640 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 28/35 constraints, State Equation: 0/508 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1640 constraints, Known Traps: 12/12 constraints]
After SMT, in 47261ms problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 47274ms
[2024-05-28 17:33:24] [INFO ] Flow matrix only has 1612 transitions (discarded 32 similar events)
[2024-05-28 17:33:24] [INFO ] Invariant cache hit.
[2024-05-28 17:33:24] [INFO ] Implicit Places using invariants in 598 ms returned [101, 159, 179, 248, 343, 387, 396, 493]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 604 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 500/712 places, 1644/1844 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 493 transition count 1637
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 493 transition count 1637
Applied a total of 14 rules in 45 ms. Remains 493 /500 variables (removed 7) and now considering 1637/1644 (removed 7) transitions.
[2024-05-28 17:33:24] [INFO ] Flow matrix only has 1605 transitions (discarded 32 similar events)
// Phase 1: matrix 1605 rows 493 cols
[2024-05-28 17:33:24] [INFO ] Computed 42 invariants in 46 ms
[2024-05-28 17:33:25] [INFO ] Implicit Places using invariants in 629 ms returned []
[2024-05-28 17:33:25] [INFO ] Flow matrix only has 1605 transitions (discarded 32 similar events)
[2024-05-28 17:33:25] [INFO ] Invariant cache hit.
[2024-05-28 17:33:26] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:33:47] [INFO ] Implicit Places using invariants and state equation in 21622 ms returned []
Implicit Place search using SMT with State Equation took 22270 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 493/712 places, 1637/1844 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 70289 ms. Remains : 493/712 places, 1637/1844 transitions.
[2024-05-28 17:33:47] [INFO ] Flatten gal took : 109 ms
[2024-05-28 17:33:47] [INFO ] Flatten gal took : 112 ms
[2024-05-28 17:33:47] [INFO ] Input system was already deterministic with 1637 transitions.
[2024-05-28 17:33:47] [INFO ] Flatten gal took : 104 ms
[2024-05-28 17:33:47] [INFO ] Flatten gal took : 85 ms
[2024-05-28 17:33:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality6960957054996693692.gal : 12 ms
[2024-05-28 17:33:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality12426632792208503481.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6960957054996693692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12426632792208503481.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
BK_STOP 1716917647405
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S04J04T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBLF-PT-S04J04T08, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654446700273"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 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 ;