fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r472-tajo-171620399100233
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P20N20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15939.808 140251.00 217345.00 160.30 TTT?TTTF?F???F?? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 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 1.9M 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-V50P20N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717220685590

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:44:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:44:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:44:47] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-06-01 05:44:47] [INFO ] Transformed 138 places.
[2024-06-01 05:44:47] [INFO ] Transformed 2348 transitions.
[2024-06-01 05:44:47] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 80 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 65 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:44:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-06-01 05:44:47] [INFO ] Computed 7 invariants in 25 ms
[2024-06-01 05:44:47] [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-06-01 05:45:16] [INFO ] Deduced a trap composed of 5 places in 369 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 20117 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
[2024-06-01 05:45:47] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 7 constraints, problems are : Problem set: 1 solved, 2344 unsolved in 20047 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 60161ms problems are : Problem set: 1 solved, 2344 unsolved
Search for dead transitions found 1 dead transitions in 60243ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:45:47] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-06-01 05:45:47] [INFO ] Computed 7 invariants in 4 ms
[2024-06-01 05:45:48] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-06-01 05:45:48] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:45:48] [INFO ] Invariant cache hit.
[2024-06-01 05:45:48] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:45:48] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 20 ms. Remains 138 /138 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61203 ms. Remains : 138/138 places, 2347/2348 transitions.
Support contains 80 out of 138 places after structural reductions.
[2024-06-01 05:45:49] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 05:45:49] [INFO ] Flatten gal took : 298 ms
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:45:49] [INFO ] Flatten gal took : 137 ms
[2024-06-01 05:45:49] [INFO ] Input system was already deterministic with 2347 transitions.
Support contains 77 out of 138 places (down from 80) after GAL structural reductions.
RANDOM walk for 40000 steps (92 resets) in 3633 ms. (11 steps per ms) remains 41/71 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
[2024-06-01 05:45:51] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:45:51] [INFO ] Invariant cache hit.
[2024-06-01 05:45:51] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 97/138 variables, 7/7 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 290/428 variables, 138/145 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 42/187 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/187 constraints. Problems are: Problem set: 39 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/187 constraints. Problems are: Problem set: 39 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 187 constraints, problems are : Problem set: 39 solved, 2 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 2 unsolved
Problem AtomicPropp44 is UNSAT
At refinement iteration 1 (OVERLAPS) 68/75 variables, 3/3 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/3 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/81 variables, 2/5 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/5 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/367 variables, 81/86 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/367 variables, 40/126 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/367 variables, 0/126 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 61/428 variables, 57/183 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 2/185 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 2/187 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 1/188 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/428 variables, 0/188 constraints. Problems are: Problem set: 40 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/428 variables, 0/188 constraints. Problems are: Problem set: 40 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 188 constraints, problems are : Problem set: 40 solved, 1 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 946ms problems are : Problem set: 40 solved, 1 unsolved
Finished Parikh walk after 4818 steps, including 254 resets, run visited all 1 properties in 96 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 105 ms.
Successfully simplified 40 atomic propositions for a total of 15 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:45:52] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 05:45:52] [INFO ] Flatten gal took : 112 ms
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:45:52] [INFO ] Flatten gal took : 112 ms
[2024-06-01 05:45:53] [INFO ] Input system was already deterministic with 2347 transitions.
Support contains 23 out of 138 places (down from 45) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3849 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.66 ms
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2347
Applied a total of 2 rules in 69 ms. Remains 136 /138 variables (removed 2) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-06-01 05:45:53] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:45:53] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:45:53] [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, 2344 unsolved
[2024-06-01 05:46:21] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:46:49] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1520 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 13 solved, 2331 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 2/2 constraints]
After SMT, in 59139ms problems are : Problem set: 13 solved, 2331 unsolved
Search for dead transitions found 13 dead transitions in 59171ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 13 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2334/2347 transitions.
Applied a total of 0 rules in 14 ms. Remains 136 /136 variables (removed 0) and now considering 2334/2334 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59290 ms. Remains : 136/138 places, 2334/2347 transitions.
[2024-06-01 05:46:52] [INFO ] Flatten gal took : 63 ms
[2024-06-01 05:46:52] [INFO ] Flatten gal took : 71 ms
[2024-06-01 05:46:52] [INFO ] Input system was already deterministic with 2334 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2347/2347 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2346
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2346
Applied a total of 4 rules in 49 ms. Remains 135 /138 variables (removed 3) and now considering 2346/2347 (removed 1) transitions.
Running 2343 sub problems to find dead transitions.
[2024-06-01 05:46:52] [INFO ] Flow matrix only has 289 transitions (discarded 2057 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-06-01 05:46:52] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:46:52] [INFO ] State equation strengthened by 42 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-15

BK_STOP 1717220825841

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/567/ctl_0_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/567/ctl_1_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/567/ctl_2_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/567/ctl_3_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/567/ctl_4_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/567/ctl_5_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/567/ctl_6_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/567/ctl_7_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/567/ctl_8_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/567/ctl_9_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/567/ctl_10_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/567/ctl_11_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/567/ctl_12_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/567/ctl_13_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/567/ctl_14_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/567/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P20N20, 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 r472-tajo-171620399100233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N20.tgz
mv BridgeAndVehicles-PT-V50P20N20 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 ;