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-171620399100258.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-V50P50N20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399100258
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717221414725

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:56:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:56:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:56:56] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2024-06-01 05:56:56] [INFO ] Transformed 138 places.
[2024-06-01 05:56:56] [INFO ] Transformed 2348 transitions.
[2024-06-01 05:56:56] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 340 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 58 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:56:57] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:56:57] [INFO ] Computed 5 invariants in 18 ms
[2024-06-01 05:56:57] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:57:24] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 26 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20189 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 57811ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 57882ms
[2024-06-01 05:57:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-06-01 05:57:54] [INFO ] Invariant cache hit.
[2024-06-01 05:57:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 05:57:54] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-06-01 05:57:54] [INFO ] Invariant cache hit.
[2024-06-01 05:57:55] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:57:55] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:57:55] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-06-01 05:57:55] [INFO ] Invariant cache hit.
[2024-06-01 05:57:55] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:58:25] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 2 ms to minimize.
[2024-06-01 05:58:43] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 7 constraints, problems are : Problem set: 10 solved, 2335 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 10 solved, 2335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 2335 unsolved
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2130 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2235 is UNSAT
Problem TDEAD2256 is UNSAT
Problem TDEAD2277 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 50 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 50 solved, 2295 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 80469ms problems are : Problem set: 50 solved, 2295 unsolved
Search for dead transitions found 50 dead transitions in 80518ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2298/2348 transitions.
Applied a total of 0 rules in 11 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138882 ms. Remains : 136/138 places, 2298/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-06-01 05:59:16] [INFO ] Flatten gal took : 269 ms
[2024-06-01 05:59:16] [INFO ] Flatten gal took : 198 ms
[2024-06-01 05:59:17] [INFO ] Input system was already deterministic with 2298 transitions.
Reduction of identical properties reduced properties to check from 50 to 49
RANDOM walk for 40000 steps (92 resets) in 6105 ms. (6 steps per ms) remains 29/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 27/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
[2024-06-01 05:59:19] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-06-01 05:59:19] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:59:19] [INFO ] State equation strengthened by 41 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 24 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 41/133 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 289/422 variables, 133/138 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 41/179 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 3/425 variables, 3/182 constraints. Problems are: Problem set: 4 solved, 23 unsolved
[2024-06-01 05:59:21] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/183 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/183 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/183 constraints. Problems are: Problem set: 6 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 183 constraints, problems are : Problem set: 6 solved, 21 unsolved in 3062 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 87/129 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 287/416 variables, 129/134 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 41/175 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 0/175 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 9/425 variables, 7/182 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/183 constraints. Problems are: Problem set: 6 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 21/204 constraints. Problems are: Problem set: 6 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 204 constraints, problems are : Problem set: 6 solved, 21 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 21/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 8546ms problems are : Problem set: 6 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2297
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2297
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2296
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2294
Applied a total of 9 rules in 436 ms. Remains 131 /136 variables (removed 5) and now considering 2294/2298 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 449 ms. Remains : 131/136 places, 2294/2298 transitions.
RANDOM walk for 40000 steps (128 resets) in 1053 ms. (37 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 80195 steps, run timeout after 3003 ms. (steps per millisecond=26 ) properties seen :3 out of 21
Probabilistic random walk after 80195 steps, saw 27945 distinct states, run finished after 3007 ms. (steps per millisecond=26 ) properties seen :3
[2024-06-01 05:59:32] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
// Phase 1: matrix 285 rows 131 cols
[2024-06-01 05:59:32] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 05:59:32] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/416 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 176 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/416 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 194 constraints, problems are : Problem set: 0 solved, 18 unsolved in 10322 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 12158ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 973 ms.
Support contains 36 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2294/2294 transitions.
Applied a total of 0 rules in 373 ms. Remains 131 /131 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 375 ms. Remains : 131/131 places, 2294/2294 transitions.
RANDOM walk for 40000 steps (128 resets) in 983 ms. (40 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 111596 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 18
Probabilistic random walk after 111596 steps, saw 38646 distinct states, run finished after 3013 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 05:59:49] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 05:59:49] [INFO ] Invariant cache hit.
[2024-06-01 05:59:49] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/416 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 176 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/416 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/416 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 194 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 7759ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 2162 ms.
Support contains 36 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2294/2294 transitions.
Applied a total of 0 rules in 160 ms. Remains 131 /131 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 131/131 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2294/2294 transitions.
Applied a total of 0 rules in 267 ms. Remains 131 /131 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
[2024-06-01 06:00:00] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 06:00:00] [INFO ] Invariant cache hit.
[2024-06-01 06:00:00] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 06:00:00] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 06:00:00] [INFO ] Invariant cache hit.
[2024-06-01 06:00:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:00:00] [INFO ] Implicit Places using invariants and state equation in 632 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 879 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 2294/2294 transitions.
Applied a total of 0 rules in 194 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1343 ms. Remains : 129/131 places, 2294/2294 transitions.
RANDOM walk for 40000 steps (128 resets) in 754 ms. (52 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 141766 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 18
Probabilistic random walk after 141766 steps, saw 47502 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-06-01 06:00:04] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
// Phase 1: matrix 285 rows 129 cols
[2024-06-01 06:00:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 06:00:04] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/414 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/414 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 174 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 285/412 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 41/172 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 18/190 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/414 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/414 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 192 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6422 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 7804ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1126 ms.
Support contains 36 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2294/2294 transitions.
Applied a total of 0 rules in 188 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 129/129 places, 2294/2294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2294/2294 transitions.
Applied a total of 0 rules in 189 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
[2024-06-01 06:00:13] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 06:00:13] [INFO ] Invariant cache hit.
[2024-06-01 06:00:13] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 06:00:13] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 06:00:13] [INFO ] Invariant cache hit.
[2024-06-01 06:00:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-06-01 06:00:14] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 824 ms to find 0 implicit places.
[2024-06-01 06:00:14] [INFO ] Redundant transitions in 175 ms returned []
Running 2291 sub problems to find dead transitions.
[2024-06-01 06:00:14] [INFO ] Flow matrix only has 285 transitions (discarded 2009 similar events)
[2024-06-01 06:00:14] [INFO ] Invariant cache hit.
[2024-06-01 06:00:14] [INFO ] State equation strengthened by 41 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-15

BK_STOP 1717221628971

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/608/ctl_0_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/608/ctl_1_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/608/ctl_2_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/608/ctl_3_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/608/ctl_4_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/608/ctl_5_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/608/ctl_6_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/608/ctl_7_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/608/ctl_8_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/608/ctl_9_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/608/ctl_10_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/608/ctl_11_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/608/ctl_12_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/608/ctl_13_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/608/ctl_14_
ctl formula name BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/608/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="CTLFireability"
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-V50P50N20, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399100258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;