Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100257.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 BridgeAndVehicles-PT-V50P50N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:42 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 BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716329613759

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 22:13:35] [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-21 22:13:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:13:35] [INFO ] Load time of PNML (sax parser for PT used): 303 ms
[2024-05-21 22:13:35] [INFO ] Transformed 138 places.
[2024-05-21 22:13:35] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:13:35] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 553 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 66 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:13:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 22:13:36] [INFO ] Computed 7 invariants in 26 ms
[2024-05-21 22:13:36] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:14:03] [INFO ] Deduced a trap composed of 5 places in 561 ms of which 11 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 57341ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 57472ms
[2024-05-21 22:14:33] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:14:33] [INFO ] Invariant cache hit.
[2024-05-21 22:14:34] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-21 22:14:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:14:34] [INFO ] Invariant cache hit.
[2024-05-21 22:14:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:14:34] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:14:34] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:14:34] [INFO ] Invariant cache hit.
[2024-05-21 22:14:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:15:01] [INFO ] Deduced a trap composed of 5 places in 334 ms of which 3 ms to minimize.
[2024-05-21 22:15:17] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 9 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 7 constraints, problems are : Problem set: 19 solved, 2326 unsolved in 30082 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 2326 unsolved
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 78106ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 78137ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 13 ms. Remains 138 /138 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136671 ms. Remains : 138/138 places, 2298/2348 transitions.
Support contains 57 out of 138 places after structural reductions.
[2024-05-21 22:15:53] [INFO ] Flatten gal took : 229 ms
[2024-05-21 22:15:53] [INFO ] Flatten gal took : 191 ms
[2024-05-21 22:15:53] [INFO ] Input system was already deterministic with 2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 3666 ms. (10 steps per ms) remains 36/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
[2024-05-21 22:15:55] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 138 cols
[2024-05-21 22:15:55] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 22:15:55] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 33 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 2 (OVERLAPS) 96/138 variables, 5/7 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 289/427 variables, 138/145 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/427 variables, 41/186 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/427 variables, 0/186 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/427 variables, 0/186 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 186 constraints, problems are : Problem set: 35 solved, 1 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/9 variables, 2/3 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/213 variables, 9/12 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/12 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 191/404 variables, 106/118 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 2/120 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 41/161 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/404 variables, 1/162 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/404 variables, 0/162 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/406 variables, 1/163 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 2/165 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/165 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 21/427 variables, 21/186 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 1/187 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/427 variables, 0/187 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/427 variables, 0/187 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 187 constraints, problems are : Problem set: 35 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 35 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2298/2298 transitions.
Graph (complete) has 1301 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2297
Applied a total of 3 rules in 380 ms. Remains 135 /138 variables (removed 3) and now considering 2297/2298 (removed 1) transitions.
Running 2294 sub problems to find dead transitions.
[2024-05-21 22:15:56] [INFO ] Flow matrix only has 288 transitions (discarded 2009 similar events)
// Phase 1: matrix 288 rows 135 cols
[2024-05-21 22:15:56] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 22:15:56] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716329770418

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="BridgeAndVehicles-PT-V50P50N20"
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 BridgeAndVehicles-PT-V50P50N20, 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 r048-tajo-171620399100257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;