Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505100089.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505100089
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 07:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 07:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 12 07:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K Apr 12 07:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-CTLCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2023-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717185441196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:57:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:57:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:57:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-31 19:57:22] [INFO ] Transformed 114 places.
[2024-05-31 19:57:22] [INFO ] Transformed 180 transitions.
[2024-05-31 19:57:22] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 74 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 17 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 114 cols
[2024-05-31 19:57:22] [INFO ] Computed 8 invariants in 13 ms
[2024-05-31 19:57:22] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-31 19:57:22] [INFO ] Invariant cache hit.
[2024-05-31 19:57:23] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-31 19:57:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-31 19:57:23] [INFO ] Invariant cache hit.
[2024-05-31 19:57:23] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:57:23] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 10 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 2 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-31 19:57:24] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-31 19:57:25] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:57:25] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-31 19:57:25] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 1/113 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 2 ms to minimize.
[2024-05-31 19:57:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:57:27] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 180/293 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 1/294 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 193 constraints, problems are : Problem set: 0 solved, 175 unsolved in 11292 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 1/113 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:57:35] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 180/293 variables, 113/149 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 45/194 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 175/369 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 1/294 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 370 constraints, problems are : Problem set: 0 solved, 175 unsolved in 10041 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 28/28 constraints]
After SMT, in 21415ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 21432ms
Finished structural reductions in LTL mode , in 1 iterations and 21871 ms. Remains : 114/114 places, 180/180 transitions.
Support contains 74 out of 114 places after structural reductions.
[2024-05-31 19:57:44] [INFO ] Flatten gal took : 34 ms
[2024-05-31 19:57:44] [INFO ] Flatten gal took : 13 ms
[2024-05-31 19:57:44] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 71 out of 114 places (down from 74) after GAL structural reductions.
RANDOM walk for 40000 steps (405 resets) in 1581 ms. (25 steps per ms) remains 10/76 properties
BEST_FIRST walk for 40003 steps (95 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (100 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (95 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (106 resets) in 107 ms. (370 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (95 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (91 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (104 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (97 resets) in 156 ms. (254 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (103 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (93 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
[2024-05-31 19:57:45] [INFO ] Invariant cache hit.
[2024-05-31 19:57:45] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 93/106 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/110 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 180/291 variables, 111/118 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 45/163 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/163 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/294 variables, 3/166 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 1/167 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/167 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 167 constraints, problems are : Problem set: 2 solved, 8 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 93/104 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 6/110 variables, 3/7 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-31 19:57:46] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-31 19:57:47] [INFO ] Deduced a trap composed of 25 places in 810 ms of which 0 ms to minimize.
[2024-05-31 19:57:47] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:57:47] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 4 ms to minimize.
[2024-05-31 19:57:47] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 6/14 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 2 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 2 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 233 ms of which 1 ms to minimize.
[2024-05-31 19:57:48] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 10/25 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 180/291 variables, 111/136 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp58 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 45/181 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 5/186 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/186 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/294 variables, 3/189 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/294 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/294 variables, 2/192 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/294 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/294 variables, 0/192 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 192 constraints, problems are : Problem set: 3 solved, 7 unsolved in 3147 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 18/18 constraints]
After SMT, in 3547ms problems are : Problem set: 3 solved, 7 unsolved
Parikh walk visited 0 properties in 979 ms.
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 113 transition count 150
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 83 transition count 150
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 95 place count 66 transition count 133
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 66 transition count 124
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 66 transition count 119
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 61 transition count 119
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 143 place count 61 transition count 119
Applied a total of 143 rules in 40 ms. Remains 61 /114 variables (removed 53) and now considering 119/180 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 61/114 places, 119/180 transitions.
RANDOM walk for 40000 steps (1422 resets) in 398 ms. (100 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (286 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (289 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (286 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (263 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (266 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (256 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
Probably explored full state space saw : 16224 states, properties seen :0
Probabilistic random walk after 90079 steps, saw 16224 distinct states, run finished after 424 ms. (steps per millisecond=212 ) properties seen :0
Explored full state space saw : 16224 states, properties seen :0
Exhaustive walk after 90079 steps, saw 16224 distinct states, run finished after 263 ms. (steps per millisecond=342 ) properties seen :0
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 19:57:51] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 10 ms
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 10 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 62 out of 114 places (down from 65) after GAL structural reductions.
Computed a total of 23 stabilizing places and 35 stable transitions
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 17 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 8 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 78 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 81 place count 73 transition count 140
Applied a total of 81 rules in 12 ms. Remains 73 /114 variables (removed 41) and now considering 140/180 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 73/114 places, 140/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 114/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 7 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 1 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 114/114 places, 180/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 82 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 75 transition count 142
Partial Post-agglomeration rule applied 14 times.
Drop transitions (Partial Post agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 75 transition count 142
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 69 transition count 136
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 69 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 69 transition count 133
Applied a total of 106 rules in 22 ms. Remains 69 /114 variables (removed 45) and now considering 133/180 (removed 47) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 69/114 places, 133/180 transitions.
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:57:51] [INFO ] Flatten gal took : 4 ms
[2024-05-31 19:57:51] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 6 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 10 ms
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:52] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 113/114 places, 180/180 transitions.
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:57:52] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 6 ms
[2024-05-31 19:57:52] [INFO ] Flatten gal took : 5 ms
[2024-05-31 19:57:52] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 19:57:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 114 places, 180 transitions and 500 arcs took 2 ms.
Total runtime 29739 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 : CANInsertWithFailure-PT-005-CTLCardinality-2024-00
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-01
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-02
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-03
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-04
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-06
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-07
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-08
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-09
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2024-10
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2023-12
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2023-13
Could not compute solution for formula : CANInsertWithFailure-PT-005-CTLCardinality-2023-14

BK_STOP 1717185472551

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CANInsertWithFailure-PT-005-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/660/ctl_0_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/660/ctl_1_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/660/ctl_2_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/660/ctl_3_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/660/ctl_4_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/660/ctl_5_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/660/ctl_6_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/660/ctl_7_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/660/ctl_8_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/660/ctl_9_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/660/ctl_10_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/660/ctl_11_
ctl formula name CANInsertWithFailure-PT-005-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/660/ctl_12_
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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r476-tall-171620505100089"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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