About the Execution of LTSMin+red for Railroad-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1855.048 | 72893.00 | 110401.00 | 306.10 | ???????F????T??? | normal |
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.r520-tall-171662338700498.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 Railroad-PT-050, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338700498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K 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 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:43 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 Railroad-PT-050-CTLFireability-2024-00
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-01
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-02
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-03
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-04
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-05
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-06
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-07
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-08
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-09
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-10
FORMULA_NAME Railroad-PT-050-CTLFireability-2024-11
FORMULA_NAME Railroad-PT-050-CTLFireability-2023-12
FORMULA_NAME Railroad-PT-050-CTLFireability-2023-13
FORMULA_NAME Railroad-PT-050-CTLFireability-2023-14
FORMULA_NAME Railroad-PT-050-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717261138163
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:58:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:58:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:58:59] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-01 16:58:59] [INFO ] Transformed 518 places.
[2024-06-01 16:58:59] [INFO ] Transformed 2756 transitions.
[2024-06-01 16:58:59] [INFO ] Found NUPN structural information;
[2024-06-01 16:58:59] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Deduced a syphon composed of 151 places in 32 ms
Reduce places removed 151 places and 50 transitions.
Support contains 101 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 51 places
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 316 transition count 2706
Applied a total of 51 rules in 53 ms. Remains 316 /367 variables (removed 51) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 316 cols
[2024-06-01 16:58:59] [INFO ] Invariants computation overflowed in 32 ms
[2024-06-01 16:59:00] [INFO ] Implicit Places using invariants in 326 ms returned []
// Phase 1: matrix 2706 rows 316 cols
[2024-06-01 16:59:00] [INFO ] Invariants computation overflowed in 10 ms
[2024-06-01 16:59:01] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 272, 274, 276, 278, 279, 280, 282, 295, 302, 303]
Discarding 53 places :
Implicit Place search using SMT with State Equation took 1471 ms to find 53 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 263/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 14 ms. Remains 263 /263 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1554 ms. Remains : 263/367 places, 2706/2706 transitions.
Support contains 101 out of 263 places after structural reductions.
[2024-06-01 16:59:01] [INFO ] Flatten gal took : 237 ms
[2024-06-01 16:59:01] [INFO ] Flatten gal took : 152 ms
[2024-06-01 16:59:02] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 99 out of 263 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1981 ms. (20 steps per ms) remains 56/91 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
// Phase 1: matrix 2706 rows 263 cols
[2024-06-01 16:59:03] [INFO ] Invariants computation overflowed in 12 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 2576/2659 variables, 83/166 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2659 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 4 (OVERLAPS) 240/2899 variables, 118/284 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2899 variables, 118/402 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2899 variables, 0/402 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 70/2969 variables, 62/464 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2969 variables, 62/526 constraints. Problems are: Problem set: 9 solved, 46 unsolved
[2024-06-01 16:59:08] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 19 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2969/2969 variables, and 527 constraints, problems are : Problem set: 9 solved, 46 unsolved in 5010 ms.
Refiners :[Domain max(s): 263/263 constraints, State Equation: 263/263 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 2348/2413 variables, 65/130 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2413 variables, 0/130 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 469/2882 variables, 127/257 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2882 variables, 127/384 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2882 variables, 46/430 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2882 variables, 0/430 constraints. Problems are: Problem set: 9 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 87/2969 variables, 71/501 constraints. Problems are: Problem set: 9 solved, 46 unsolved
SMT process timed out in 10523ms, After SMT, problems are : Problem set: 9 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 263 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 260 transition count 2704
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 5 place count 260 transition count 2688
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 37 place count 244 transition count 2688
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 2 with 4 rules applied. Total rules applied 41 place count 242 transition count 2686
Applied a total of 41 rules in 645 ms. Remains 242 /263 variables (removed 21) and now considering 2686/2706 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 646 ms. Remains : 242/263 places, 2686/2706 transitions.
RANDOM walk for 40000 steps (8 resets) in 720 ms. (55 steps per ms) remains 42/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
// Phase 1: matrix 2686 rows 242 cols
[2024-06-01 16:59:15] [INFO ] Invariants computation overflowed in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2283/2343 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 527/2870 variables, 127/247 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2870 variables, 127/374 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2870 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 58/2928 variables, 55/429 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2928 variables, 55/484 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 16:59:18] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2928 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2928 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (OVERLAPS) 0/2928 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2928/2928 variables, and 485 constraints, problems are : Problem set: 0 solved, 41 unsolved in 13301 ms.
Refiners :[Domain max(s): 242/242 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2283/2343 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2343 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 527/2870 variables, 127/247 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2870 variables, 127/374 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2870 variables, 41/415 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2870 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 58/2928 variables, 55/470 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2928 variables, 55/525 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2928 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2928 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/2928 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2928/2928 variables, and 526 constraints, problems are : Problem set: 0 solved, 41 unsolved in 22937 ms.
Refiners :[Domain max(s): 242/242 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 1/1 constraints]
After SMT, in 36445ms problems are : Problem set: 0 solved, 41 unsolved
Finished Parikh walk after 72736 steps, including 765 resets, run visited all 2 properties in 848 ms. (steps per millisecond=85 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 41 properties in 10448 ms.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Railroad-PT-050-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:00:02] [INFO ] Flatten gal took : 94 ms
[2024-06-01 17:00:02] [INFO ] Flatten gal took : 104 ms
[2024-06-01 17:00:02] [INFO ] Input system was already deterministic with 2706 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 4 place count 260 transition count 2662
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 88 place count 218 transition count 2662
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 2 with 4 rules applied. Total rules applied 92 place count 216 transition count 2660
Applied a total of 92 rules in 750 ms. Remains 216 /263 variables (removed 47) and now considering 2660/2706 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 751 ms. Remains : 216/263 places, 2660/2706 transitions.
[2024-06-01 17:00:03] [INFO ] Flatten gal took : 61 ms
[2024-06-01 17:00:03] [INFO ] Flatten gal took : 68 ms
[2024-06-01 17:00:03] [INFO ] Input system was already deterministic with 2660 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 12 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:03] [INFO ] Flatten gal took : 79 ms
[2024-06-01 17:00:03] [INFO ] Flatten gal took : 88 ms
[2024-06-01 17:00:03] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 24 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:03] [INFO ] Flatten gal took : 84 ms
[2024-06-01 17:00:04] [INFO ] Flatten gal took : 96 ms
[2024-06-01 17:00:04] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 10 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:04] [INFO ] Flatten gal took : 77 ms
[2024-06-01 17:00:04] [INFO ] Flatten gal took : 93 ms
[2024-06-01 17:00:04] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 11 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:04] [INFO ] Flatten gal took : 80 ms
[2024-06-01 17:00:04] [INFO ] Flatten gal took : 88 ms
[2024-06-01 17:00:04] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 4 place count 260 transition count 2656
Deduced a syphon composed of 48 places in 3 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 100 place count 212 transition count 2656
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 210 transition count 2654
Applied a total of 104 rules in 509 ms. Remains 210 /263 variables (removed 53) and now considering 2654/2706 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 512 ms. Remains : 210/263 places, 2654/2706 transitions.
[2024-06-01 17:00:05] [INFO ] Flatten gal took : 53 ms
[2024-06-01 17:00:05] [INFO ] Flatten gal took : 59 ms
[2024-06-01 17:00:05] [INFO ] Input system was already deterministic with 2654 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Applied a total of 0 rules in 8 ms. Remains 263 /263 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 263/263 places, 2706/2706 transitions.
[2024-06-01 17:00:05] [INFO ] Flatten gal took : 72 ms
[2024-06-01 17:00:05] [INFO ] Flatten gal took : 80 ms
[2024-06-01 17:00:06] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 4 place count 260 transition count 2655
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 102 place count 211 transition count 2655
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 2 with 4 rules applied. Total rules applied 106 place count 209 transition count 2653
Applied a total of 106 rules in 508 ms. Remains 209 /263 variables (removed 54) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 508 ms. Remains : 209/263 places, 2653/2706 transitions.
[2024-06-01 17:00:06] [INFO ] Flatten gal took : 50 ms
[2024-06-01 17:00:06] [INFO ] Flatten gal took : 56 ms
[2024-06-01 17:00:06] [INFO ] Input system was already deterministic with 2653 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 9 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:06] [INFO ] Flatten gal took : 72 ms
[2024-06-01 17:00:06] [INFO ] Flatten gal took : 81 ms
[2024-06-01 17:00:07] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 8 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:07] [INFO ] Flatten gal took : 75 ms
[2024-06-01 17:00:07] [INFO ] Flatten gal took : 85 ms
[2024-06-01 17:00:07] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 8 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:07] [INFO ] Flatten gal took : 73 ms
[2024-06-01 17:00:07] [INFO ] Flatten gal took : 103 ms
[2024-06-01 17:00:07] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 260 transition count 2654
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 210 transition count 2654
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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 209 transition count 2653
Applied a total of 106 rules in 522 ms. Remains 209 /263 variables (removed 54) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 523 ms. Remains : 209/263 places, 2653/2706 transitions.
[2024-06-01 17:00:08] [INFO ] Flatten gal took : 52 ms
[2024-06-01 17:00:08] [INFO ] Flatten gal took : 62 ms
[2024-06-01 17:00:08] [INFO ] Input system was already deterministic with 2653 transitions.
RANDOM walk for 6942 steps (0 resets) in 105 ms. (65 steps per ms) remains 0/1 properties
FORMULA Railroad-PT-050-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 262 transition count 2706
Applied a total of 1 rules in 8 ms. Remains 262 /263 variables (removed 1) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 262/263 places, 2706/2706 transitions.
[2024-06-01 17:00:08] [INFO ] Flatten gal took : 73 ms
[2024-06-01 17:00:08] [INFO ] Flatten gal took : 81 ms
[2024-06-01 17:00:09] [INFO ] Input system was already deterministic with 2706 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 4 place count 260 transition count 2657
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 98 place count 213 transition count 2657
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 211 transition count 2655
Applied a total of 102 rules in 503 ms. Remains 211 /263 variables (removed 52) and now considering 2655/2706 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 504 ms. Remains : 211/263 places, 2655/2706 transitions.
[2024-06-01 17:00:09] [INFO ] Flatten gal took : 50 ms
[2024-06-01 17:00:09] [INFO ] Flatten gal took : 56 ms
[2024-06-01 17:00:09] [INFO ] Input system was already deterministic with 2655 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 263/263 places, 2706/2706 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 262 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 260 transition count 2704
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 49 Pre rules applied. Total rules applied 4 place count 260 transition count 2655
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 102 place count 211 transition count 2655
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 2 with 4 rules applied. Total rules applied 106 place count 209 transition count 2653
Applied a total of 106 rules in 466 ms. Remains 209 /263 variables (removed 54) and now considering 2653/2706 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 466 ms. Remains : 209/263 places, 2653/2706 transitions.
[2024-06-01 17:00:10] [INFO ] Flatten gal took : 50 ms
[2024-06-01 17:00:10] [INFO ] Flatten gal took : 56 ms
[2024-06-01 17:00:10] [INFO ] Input system was already deterministic with 2653 transitions.
[2024-06-01 17:00:10] [INFO ] Flatten gal took : 78 ms
[2024-06-01 17:00:10] [INFO ] Flatten gal took : 80 ms
[2024-06-01 17:00:10] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 17:00:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 263 places, 2706 transitions and 15818 arcs took 14 ms.
Total runtime 71409 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-00
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-01
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-02
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-03
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-04
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-05
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-06
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-08
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-09
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-10
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2024-11
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2023-13
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2023-14
Could not compute solution for formula : Railroad-PT-050-CTLFireability-2023-15
BK_STOP 1717261211056
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name Railroad-PT-050-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/542/ctl_0_
ctl formula name Railroad-PT-050-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/542/ctl_1_
ctl formula name Railroad-PT-050-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/542/ctl_2_
ctl formula name Railroad-PT-050-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/542/ctl_3_
ctl formula name Railroad-PT-050-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/542/ctl_4_
ctl formula name Railroad-PT-050-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/542/ctl_5_
ctl formula name Railroad-PT-050-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/542/ctl_6_
ctl formula name Railroad-PT-050-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/542/ctl_7_
ctl formula name Railroad-PT-050-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/542/ctl_8_
ctl formula name Railroad-PT-050-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/542/ctl_9_
ctl formula name Railroad-PT-050-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/542/ctl_10_
ctl formula name Railroad-PT-050-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/542/ctl_11_
ctl formula name Railroad-PT-050-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/542/ctl_12_
ctl formula name Railroad-PT-050-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/542/ctl_13_
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="Railroad-PT-050"
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 Railroad-PT-050, 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 r520-tall-171662338700498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-050.tgz
mv Railroad-PT-050 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 '
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 ;