Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447200482.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-PT-S10J20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447200482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-PT-S10J20-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716932685660

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 21:44:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:44:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:44:47] [INFO ] Load time of PNML (sax parser for PT used): 737 ms
[2024-05-28 21:44:47] [INFO ] Transformed 474 places.
[2024-05-28 21:44:48] [INFO ] Transformed 11760 transitions.
[2024-05-28 21:44:48] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 971 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 148 ms.
[2024-05-28 21:44:48] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:44:48] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:44:48] [INFO ] Reduced 9285 identical enabling conditions.
[2024-05-28 21:44:48] [INFO ] Reduced 45 identical enabling conditions.
[2024-05-28 21:44:48] [INFO ] Reduced 780 identical enabling conditions.
[2024-05-28 21:44:48] [INFO ] Reduced 9285 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 177 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Applied a total of 0 rules in 81 ms. Remains 474 /474 variables (removed 0) and now considering 1650/1650 (removed 0) transitions.
Running 1639 sub problems to find dead transitions.
[2024-05-28 21:44:48] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-28 21:44:48] [INFO ] Computed 72 invariants in 79 ms
[2024-05-28 21:44:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2115 variables, and 51 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 20133 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1639 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
[2024-05-28 21:45:31] [INFO ] Deduced a trap composed of 70 places in 424 ms of which 31 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2115 variables, and 52 constraints, problems are : Problem set: 0 solved, 1639 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 43/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 56104ms problems are : Problem set: 0 solved, 1639 unsolved
Search for dead transitions found 0 dead transitions in 56188ms
[2024-05-28 21:45:44] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 21:45:44] [INFO ] Invariant cache hit.
[2024-05-28 21:45:45] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-28 21:45:45] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 21:45:45] [INFO ] Invariant cache hit.
[2024-05-28 21:45:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:45:47] [INFO ] Implicit Places using invariants and state equation in 2076 ms returned []
Implicit Place search using SMT with State Equation took 2394 ms to find 0 implicit places.
Running 1639 sub problems to find dead transitions.
[2024-05-28 21:45:47] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
[2024-05-28 21:45:47] [INFO ] Invariant cache hit.
[2024-05-28 21:45:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1639 unsolved
Problem TDEAD230 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD831 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1127 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1645 is UNSAT
At refinement iteration 3 (OVERLAPS) 2/455 variables, 2/53 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/2115 variables, and 53 constraints, problems are : Problem set: 66 solved, 1573 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1639/639 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 66 solved, 1573 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 43/43 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 8/51 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
[2024-05-28 21:46:40] [INFO ] Deduced a trap composed of 19 places in 456 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 1/52 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 0/52 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
At refinement iteration 4 (OVERLAPS) 2/455 variables, 2/54 constraints. Problems are: Problem set: 66 solved, 1573 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/2115 variables, and 54 constraints, problems are : Problem set: 66 solved, 1573 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/27 constraints, State Equation: 0/474 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 934/639 constraints, Known Traps: 1/1 constraints]
After SMT, in 77344ms problems are : Problem set: 66 solved, 1573 unsolved
Search for dead transitions found 66 dead transitions in 77370ms
Found 66 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 66 transitions
Dead transitions reduction (with SMT) removed 66 transitions
Starting structural reductions in LTL mode, iteration 1 : 474/474 places, 1584/1650 transitions.
Applied a total of 0 rules in 42 ms. Remains 474 /474 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136129 ms. Remains : 474/474 places, 1584/1650 transitions.
Support contains 177 out of 474 places after structural reductions.
[2024-05-28 21:47:05] [INFO ] Flatten gal took : 351 ms
[2024-05-28 21:47:05] [INFO ] Flatten gal took : 163 ms
[2024-05-28 21:47:06] [INFO ] Input system was already deterministic with 1584 transitions.
Support contains 174 out of 474 places (down from 177) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 75 to 74
RANDOM walk for 40000 steps (2243 resets) in 14135 ms. (2 steps per ms) remains 63/74 properties
BEST_FIRST walk for 4004 steps (40 resets) in 263 ms. (15 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 253 ms. (15 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 235 ms. (16 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (40 resets) in 235 ms. (16 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (40 resets) in 331 ms. (12 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 536 ms. (7 steps per ms) remains 53/63 properties
BEST_FIRST walk for 4004 steps (40 resets) in 111 ms. (35 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (40 resets) in 67 ms. (58 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 45/53 properties
BEST_FIRST walk for 4004 steps (40 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/38 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4004 steps (40 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (40 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/20 properties
[2024-05-28 21:47:11] [INFO ] Flow matrix only has 1575 transitions (discarded 9 similar events)
// Phase 1: matrix 1575 rows 474 cols
[2024-05-28 21:47:11] [INFO ] Computed 72 invariants in 41 ms
[2024-05-28 21:47:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 191/232 variables, 23/23 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 181/413 variables, 20/43 constraints. Problems are: Problem set: 4 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 0/43 constraints. Problems are: Problem set: 4 solved, 15 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 5 (OVERLAPS) 59/472 variables, 27/70 constraints. Problems are: Problem set: 15 solved, 4 unsolved
[2024-05-28 21:47:13] [INFO ] Deduced a trap composed of 24 places in 420 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/472 variables, 1/71 constraints. Problems are: Problem set: 15 solved, 4 unsolved
[2024-05-28 21:47:13] [INFO ] Deduced a trap composed of 188 places in 216 ms of which 4 ms to minimize.
[2024-05-28 21:47:14] [INFO ] Deduced a trap composed of 203 places in 270 ms of which 3 ms to minimize.
[2024-05-28 21:47:14] [INFO ] Deduced a trap composed of 213 places in 254 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/472 variables, 3/74 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/472 variables, 0/74 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/474 variables, 2/76 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 0/76 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Problem AtomicPropp63 is UNSAT
At refinement iteration 11 (OVERLAPS) 1575/2049 variables, 474/550 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2049 variables, 1/551 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2049 variables, 0/551 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/2049 variables, 0/551 constraints. Problems are: Problem set: 16 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2049/2049 variables, and 551 constraints, problems are : Problem set: 16 solved, 3 unsolved in 4255 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/18 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 16 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/19 variables, 1/1 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 24/43 variables, 2/3 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 200/243 variables, 20/23 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 0/23 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 152/395 variables, 19/42 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/42 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/402 variables, 1/43 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/402 variables, 0/43 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 70/472 variables, 27/70 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 4/74 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/472 variables, 0/74 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/474 variables, 2/76 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/76 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 1575/2049 variables, 474/550 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2049 variables, 1/551 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2049 variables, 3/554 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2049 variables, 0/554 constraints. Problems are: Problem set: 16 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/2049 variables, 0/554 constraints. Problems are: Problem set: 16 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2049/2049 variables, and 554 constraints, problems are : Problem set: 16 solved, 3 unsolved in 3520 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 474/474 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/18 constraints, Known Traps: 4/4 constraints]
After SMT, in 8200ms problems are : Problem set: 16 solved, 3 unsolved
Parikh walk visited 2 properties in 61 ms.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 464 transition count 1559
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 60 place count 439 transition count 1559
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 60 place count 439 transition count 1534
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 110 place count 414 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 111 place count 413 transition count 1533
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 413 transition count 1533
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 411 transition count 1531
Applied a total of 116 rules in 219 ms. Remains 411 /474 variables (removed 63) and now considering 1531/1584 (removed 53) transitions.
Running 1520 sub problems to find dead transitions.
[2024-05-28 21:47:19] [INFO ] Flow matrix only has 1522 transitions (discarded 9 similar events)
// Phase 1: matrix 1522 rows 411 cols
[2024-05-28 21:47:20] [INFO ] Computed 62 invariants in 15 ms
[2024-05-28 21:47:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 3 (OVERLAPS) 1/402 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1933 variables, and 53 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
[2024-05-28 21:48:02] [INFO ] Deduced a trap composed of 18 places in 341 ms of which 2 ms to minimize.
[2024-05-28 21:48:04] [INFO ] Deduced a trap composed of 112 places in 439 ms of which 3 ms to minimize.
[2024-05-28 21:48:05] [INFO ] Deduced a trap composed of 90 places in 459 ms of which 3 ms to minimize.
[2024-05-28 21:48:05] [INFO ] Deduced a trap composed of 89 places in 397 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/401 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/1933 variables, and 56 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 44/45 constraints, Generalized P Invariants (flows): 8/17 constraints, State Equation: 0/411 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 4/4 constraints]
After SMT, in 60913ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 60935ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61172 ms. Remains : 411/474 places, 1531/1584 transitions.
RANDOM walk for 40000 steps (2908 resets) in 810 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 22838 steps (230 resets) in 116 ms. (195 steps per ms) remains 0/1 properties
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:48:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 21:48:21] [INFO ] Flatten gal took : 106 ms
FORMULA PolyORBNT-PT-S10J20-CTLFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 21:48:21] [INFO ] Flatten gal took : 116 ms
[2024-05-28 21:48:22] [INFO ] Input system was already deterministic with 1584 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 1584/1584 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 464 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 463 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 463 transition count 1583
Applied a total of 12 rules in 42 ms. Remains 463 /474 variables (removed 11) and now considering 1583/1584 (removed 1) transitions.
Running 1572 sub problems to find dead transitions.
[2024-05-28 21:48:22] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
// Phase 1: matrix 1574 rows 463 cols
[2024-05-28 21:48:22] [INFO ] Computed 62 invariants in 37 ms
[2024-05-28 21:48:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1572/1572 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
At refinement iteration 3 (OVERLAPS) 1/453 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/2037 variables, and 52 constraints, problems are : Problem set: 0 solved, 1572 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 7/17 constraints, State Equation: 0/463 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1572 constraints, Known Traps: 0/0 constraints]
After SMT, in 60236ms problems are : Problem set: 0 solved, 1572 unsolved
Search for dead transitions found 0 dead transitions in 60257ms
[2024-05-28 21:49:22] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 21:49:22] [INFO ] Invariant cache hit.
[2024-05-28 21:49:23] [INFO ] Implicit Places using invariants in 707 ms returned []
[2024-05-28 21:49:23] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 21:49:23] [INFO ] Invariant cache hit.
[2024-05-28 21:49:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 21:49:27] [INFO ] Implicit Places using invariants and state equation in 4537 ms returned []
Implicit Place search using SMT with State Equation took 5261 ms to find 0 implicit places.
Running 1572 sub problems to find dead transitions.
[2024-05-28 21:49:27] [INFO ] Flow matrix only has 1574 transitions (discarded 9 similar events)
[2024-05-28 21:49:27] [INFO ] Invariant cache hit.
[2024-05-28 21:49:27] [INFO ] State equation strengthened by 1 read => feed constraints.

BK_STOP 1716932978909

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -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 CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S10J20, examination is CTLFireability"
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-171654447200482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J20.tgz
mv PolyORBNT-PT-S10J20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;