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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
360.500 9442.00 22307.00 35.10 T?FTFT?F?TFT?TT? 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-171620398900161.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-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620398900161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 9.8K Apr 13 01:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 01:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 01:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 01:48 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 5.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 13 01:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 13 01:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 37K 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-V04P05N02-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219530915

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-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:25:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:25:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:25:32] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-06-01 05:25:32] [INFO ] Transformed 28 places.
[2024-06-01 05:25:32] [INFO ] Transformed 52 transitions.
[2024-06-01 05:25:32] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2024-06-01 05:25:32] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2024-06-01 05:25:32] [INFO ] Computed 7 invariants in 13 ms
[2024-06-01 05:25:32] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-01 05:25:32] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 7 ms to minimize.
[2024-06-01 05:25:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
[2024-06-01 05:25:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 8 solved, 41 unsolved
[2024-06-01 05:25:33] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 6 (OVERLAPS) 34/62 variables, 28/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 6/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 45 constraints, problems are : Problem set: 10 solved, 39 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 34/62 variables, 28/39 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 6/45 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 39/84 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/84 constraints. Problems are: Problem set: 10 solved, 39 unsolved
[2024-06-01 05:25:34] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/62 variables, 1/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/62 variables, 0/85 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 85 constraints, problems are : Problem set: 10 solved, 39 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 1835ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 1848ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2024-06-01 05:25:34] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 28 cols
[2024-06-01 05:25:34] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:25:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 05:25:34] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-06-01 05:25:34] [INFO ] Invariant cache hit.
[2024-06-01 05:25:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 05:25:34] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/28 places, 42/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1997 ms. Remains : 28/28 places, 42/52 transitions.
Support contains 27 out of 28 places after structural reductions.
[2024-06-01 05:25:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 05:25:34] [INFO ] Flatten gal took : 19 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:25:34] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:25:34] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (916 resets) in 2928 ms. (13 steps per ms) remains 27/46 properties
BEST_FIRST walk for 4001 steps (44 resets) in 77 ms. (51 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 56 ms. (70 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (39 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (44 resets) in 92 ms. (43 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (24 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (40 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (24 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (45 resets) in 48 ms. (81 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (40 resets) in 36 ms. (108 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 32 ms. (121 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (40 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 44 ms. (88 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (44 resets) in 37 ms. (105 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (40 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (39 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (28 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 28 ms. (138 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (48 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (44 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (40 resets) in 30 ms. (129 steps per ms) remains 27/27 properties
[2024-06-01 05:25:35] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2024-06-01 05:25:35] [INFO ] Invariant cache hit.
[2024-06-01 05:25:35] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp42 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 23 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/27 variables, 5/7 constraints. Problems are: Problem set: 18 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 18 solved, 9 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 4 (OVERLAPS) 1/28 variables, 2/9 constraints. Problems are: Problem set: 24 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 24 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 30/58 variables, 28/37 constraints. Problems are: Problem set: 24 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/41 constraints. Problems are: Problem set: 24 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/41 constraints. Problems are: Problem set: 24 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 41 constraints, problems are : Problem set: 24 solved, 3 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 3 unsolved
Problem AtomicPropp37 is UNSAT
At refinement iteration 1 (OVERLAPS) 11/18 variables, 5/5 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/28 variables, 4/9 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/58 variables, 28/37 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 4/41 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 2/43 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/43 constraints. Problems are: Problem set: 25 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/43 constraints. Problems are: Problem set: 25 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 43 constraints, problems are : Problem set: 25 solved, 2 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 25 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 28 ms.
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 138 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 24 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-06-01 05:25:36] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-06-01 05:25:36] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:25:36] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 05:25:36] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 348 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 05:25:36] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 934ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 935ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 960 ms. Remains : 25/28 places, 41/42 transitions.
RANDOM walk for 40001 steps (916 resets) in 277 ms. (143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (460 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (381 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 60 ms. (steps per millisecond=167 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 34 ms. (steps per millisecond=295 ) properties seen :0
Successfully simplified 27 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:25:37] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 05:25:37] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:25:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:25:37] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:25:37] [INFO ] Input system was already deterministic with 42 transitions.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 18 stable transitions
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 13 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2024-06-01 05:25:37] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
// Phase 1: matrix 29 rows 25 cols
[2024-06-01 05:25:37] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:25:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 05:25:37] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
[2024-06-01 05:25:38] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 756 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints]
After SMT, in 1111ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1112ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 1126 ms. Remains : 25/28 places, 41/42 transitions.
[2024-06-01 05:25:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:25:38] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:25:38] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2024-06-01 05:25:38] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2024-06-01 05:25:38] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 05:25:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:25:38] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 412 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 05:25:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 78 constraints, problems are : Problem set: 0 solved, 39 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints]
After SMT, in 1130ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1131ms
Finished structural reductions in LTL mode , in 1 iterations and 1132 ms. Remains : 26/28 places, 42/42 transitions.
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 8 ms
[2024-06-01 05:25:39] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 40
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 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 38
Applied a total of 10 rules in 11 ms. Remains 21 /28 variables (removed 7) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 21/28 places, 38/42 transitions.
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Input system was already deterministic with 38 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 22 transition count 39
Applied a total of 8 rules in 8 ms. Remains 22 /28 variables (removed 6) and now considering 39/42 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 22/28 places, 39/42 transitions.
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 2 ms
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:25:39] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 23 transition count 40
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 0 with 4 rules applied. Total rules applied 10 place count 21 transition count 38
Applied a total of 10 rules in 9 ms. Remains 21 /28 variables (removed 7) and now considering 38/42 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 21/28 places, 38/42 transitions.
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 3 ms
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Input system was already deterministic with 38 transitions.
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Flatten gal took : 4 ms
[2024-06-01 05:25:39] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:25:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 42 transitions and 254 arcs took 3 ms.
Total runtime 7795 ms.
There are residual formulas that ITS could not solve within timeout
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-V04P05N02-CTLCardinality-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-15

BK_STOP 1717219540357

--------------------
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-V04P05N02-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/581/ctl_0_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/581/ctl_1_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/581/ctl_2_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/581/ctl_3_
ctl formula name BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/581/ctl_4_
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-V04P05N02"
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-V04P05N02, 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-171620398900161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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