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.r480-tall-171624189900746.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 DES-PT-60a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900746
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 08:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 178K Apr 12 08:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 12 08:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 110K 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 DES-PT-60a-CTLFireability-2024-00
FORMULA_NAME DES-PT-60a-CTLFireability-2024-01
FORMULA_NAME DES-PT-60a-CTLFireability-2024-02
FORMULA_NAME DES-PT-60a-CTLFireability-2024-03
FORMULA_NAME DES-PT-60a-CTLFireability-2024-04
FORMULA_NAME DES-PT-60a-CTLFireability-2024-05
FORMULA_NAME DES-PT-60a-CTLFireability-2024-06
FORMULA_NAME DES-PT-60a-CTLFireability-2024-07
FORMULA_NAME DES-PT-60a-CTLFireability-2024-08
FORMULA_NAME DES-PT-60a-CTLFireability-2024-09
FORMULA_NAME DES-PT-60a-CTLFireability-2024-10
FORMULA_NAME DES-PT-60a-CTLFireability-2024-11
FORMULA_NAME DES-PT-60a-CTLFireability-2023-12
FORMULA_NAME DES-PT-60a-CTLFireability-2023-13
FORMULA_NAME DES-PT-60a-CTLFireability-2023-14
FORMULA_NAME DES-PT-60a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717198630867

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:37:12] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-31 23:37:12] [INFO ] Transformed 354 places.
[2024-05-31 23:37:12] [INFO ] Transformed 311 transitions.
[2024-05-31 23:37:12] [INFO ] Found NUPN structural information;
[2024-05-31 23:37:12] [INFO ] Parsed PT model containing 354 places and 311 transitions and 1496 arcs in 225 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 119 out of 354 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 297/297 transitions.
Applied a total of 0 rules in 35 ms. Remains 354 /354 variables (removed 0) and now considering 297/297 (removed 0) transitions.
// Phase 1: matrix 297 rows 354 cols
[2024-05-31 23:37:12] [INFO ] Computed 59 invariants in 41 ms
[2024-05-31 23:37:13] [INFO ] Implicit Places using invariants in 538 ms returned [251]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 576 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 353/354 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 646 ms. Remains : 353/354 places, 297/297 transitions.
Support contains 119 out of 353 places after structural reductions.
[2024-05-31 23:37:13] [INFO ] Flatten gal took : 63 ms
[2024-05-31 23:37:13] [INFO ] Flatten gal took : 29 ms
[2024-05-31 23:37:13] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 118 out of 353 places (down from 119) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 77 to 76
RANDOM walk for 40000 steps (882 resets) in 2192 ms. (18 steps per ms) remains 57/76 properties
BEST_FIRST walk for 4000 steps (24 resets) in 67 ms. (58 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 37 ms. (105 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (17 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (18 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (24 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (18 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (19 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (25 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (17 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (19 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (25 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (17 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (17 resets) in 18 ms. (210 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (25 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (15 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (23 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (25 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (18 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (23 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (22 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (17 resets) in 14 ms. (266 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (18 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (20 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (17 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (19 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (15 resets) in 21 ms. (181 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (22 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (19 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
// Phase 1: matrix 297 rows 353 cols
[2024-05-31 23:37:14] [INFO ] Computed 58 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 34/121 variables, 19/106 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 34/140 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 31/152 variables, 14/155 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 31/186 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 151/303 variables, 24/210 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 151/361 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 57 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 12 (OVERLAPS) 297/600 variables, 303/664 constraints. Problems are: Problem set: 8 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 600/650 variables, and 664 constraints, problems are : Problem set: 8 solved, 49 unsolved in 5021 ms.
Refiners :[Domain max(s): 303/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 303/353 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 65/65 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 27/92 variables, 15/80 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 27/107 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 1/108 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 0/108 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 44/136 variables, 18/126 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 44/170 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/170 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 163/299 variables, 23/193 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 163/356 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/356 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 3/302 variables, 1/357 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 3/360 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/360 constraints. Problems are: Problem set: 8 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 297/599 variables, 302/662 constraints. Problems are: Problem set: 8 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 599/650 variables, and 674 constraints, problems are : Problem set: 8 solved, 49 unsolved in 5036 ms.
Refiners :[Domain max(s): 302/353 constraints, Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 302/353 constraints, PredecessorRefiner: 12/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 10265ms problems are : Problem set: 8 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 297/297 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 353 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 352 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 352 transition count 295
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 352 transition count 295
Applied a total of 7 rules in 68 ms. Remains 352 /353 variables (removed 1) and now considering 295/297 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 352/353 places, 295/297 transitions.
RANDOM walk for 40000 steps (892 resets) in 724 ms. (55 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 13 ms. (285 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (16 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (31 resets) in 27 ms. (142 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (18 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (20 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (19 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (18 resets) in 28 ms. (138 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (30 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (27 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (28 resets) in 21 ms. (181 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4001 steps (19 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (30 resets) in 22 ms. (174 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 23 ms. (166 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (21 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (33 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (32 resets) in 24 ms. (160 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (26 resets) in 11 ms. (333 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (30 resets) in 13 ms. (286 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (14 resets) in 19 ms. (200 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (32 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (27 resets) in 15 ms. (250 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (28 resets) in 14 ms. (266 steps per ms) remains 49/49 properties
Interrupted probabilistic random walk after 631937 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 49
Probabilistic random walk after 631937 steps, saw 88305 distinct states, run finished after 3006 ms. (steps per millisecond=210 ) properties seen :0
// Phase 1: matrix 295 rows 352 cols
[2024-05-31 23:37:28] [INFO ] Computed 59 invariants in 6 ms
[2024-05-31 23:37:28] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/92 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 49/141 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 160/301 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 295/596 variables, 301/360 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/596 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-31 23:37:31] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 23 ms to minimize.
[2024-05-31 23:37:31] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-31 23:37:32] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/596 variables, 3/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 51/647 variables, 51/416 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-31 23:37:36] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 2 ms to minimize.
[2024-05-31 23:37:36] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 3 ms to minimize.
[2024-05-31 23:37:37] [INFO ] Deduced a trap composed of 6 places in 132 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 3/419 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-31 23:37:41] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/647 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-31 23:37:42] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 18 (OVERLAPS) 0/647 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 421 constraints, problems are : Problem set: 0 solved, 49 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (OVERLAPS) 27/92 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 49/141 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 160/301 variables, 23/60 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (OVERLAPS) 295/596 variables, 301/367 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/596 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/596 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-31 23:37:59] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/596 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 15 (OVERLAPS) 51/647 variables, 51/433 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 37/470 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/647 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 471 constraints, problems are : Problem set: 0 solved, 49 unsolved in 45017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 9/9 constraints]
After SMT, in 65164ms problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 295/295 transitions.
Applied a total of 0 rules in 21 ms. Remains 352 /352 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 352/352 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 295/295 transitions.
Applied a total of 0 rules in 15 ms. Remains 352 /352 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-31 23:38:34] [INFO ] Invariant cache hit.
[2024-05-31 23:38:34] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-31 23:38:34] [INFO ] Invariant cache hit.
[2024-05-31 23:38:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:38:34] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2024-05-31 23:38:34] [INFO ] Redundant transitions in 16 ms returned []
Running 294 sub problems to find dead transitions.
[2024-05-31 23:38:34] [INFO ] Invariant cache hit.
[2024-05-31 23:38:34] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (OVERLAPS) 295/647 variables, 352/411 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/647 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 413 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15602 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-31 23:38:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-31 23:38:54] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 295/647 variables, 352/413 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 294/709 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 709 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 352/352 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 2/2 constraints]
After SMT, in 45935ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 45940ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46542 ms. Remains : 352/352 places, 295/295 transitions.
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-60a-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:39:20] [INFO ] Flatten gal took : 44 ms
[2024-05-31 23:39:20] [INFO ] Flatten gal took : 29 ms
[2024-05-31 23:39:20] [INFO ] Input system was already deterministic with 297 transitions.
Support contains 94 out of 353 places (down from 96) after GAL structural reductions.
Computed a total of 256 stabilizing places and 251 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 28 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:20] [INFO ] Flatten gal took : 18 ms
[2024-05-31 23:39:20] [INFO ] Flatten gal took : 22 ms
[2024-05-31 23:39:20] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 33 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 30 ms
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 20 ms
[2024-05-31 23:39:21] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Applied a total of 0 rules in 18 ms. Remains 353 /353 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 353/353 places, 297/297 transitions.
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:39:21] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 8 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:39:21] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 8 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 25 ms
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 14 ms
[2024-05-31 23:39:21] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 22 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:39:21] [INFO ] Flatten gal took : 14 ms
[2024-05-31 23:39:21] [INFO ] Input system was already deterministic with 296 transitions.
RANDOM walk for 40000 steps (896 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (176 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1458619 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :0 out of 1
Probabilistic random walk after 1458619 steps, saw 204187 distinct states, run finished after 3001 ms. (steps per millisecond=486 ) properties seen :0
// Phase 1: matrix 296 rows 352 cols
[2024-05-31 23:39:24] [INFO ] Computed 58 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/648 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 648/648 variables, and 410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 72/79 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/283 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/289 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 295/584 variables, 289/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/584 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/648 variables, 63/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/648 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/648 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 648/648 variables, and 411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 457 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 725ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 561 ms.
Support contains 2 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 296/296 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 352 transition count 294
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 352 transition count 294
Applied a total of 8 rules in 24 ms. Remains 352 /352 variables (removed 0) and now considering 294/296 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 352/352 places, 294/296 transitions.
RANDOM walk for 4000000 steps (53865 resets) in 17746 ms. (225 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (6947 resets) in 4858 ms. (823 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9197989 steps, run timeout after 18001 ms. (steps per millisecond=510 ) properties seen :0 out of 1
Probabilistic random walk after 9197989 steps, saw 1171698 distinct states, run finished after 18001 ms. (steps per millisecond=510 ) properties seen :0
// Phase 1: matrix 294 rows 352 cols
[2024-05-31 23:39:50] [INFO ] Computed 60 invariants in 11 ms
[2024-05-31 23:39:50] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 60/646 variables, 60/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/646 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 415 constraints, problems are : Problem set: 0 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 78/85 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 207/292 variables, 25/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 294/586 variables, 292/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/586 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:39:50] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-05-31 23:39:50] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/586 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/586 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 60/646 variables, 60/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/646 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/646 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 352/352 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 127501 steps, including 454 resets, run visited all 1 properties in 467 ms. (steps per millisecond=273 )
FORMULA DES-PT-60a-CTLFireability-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 473 ms.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:51] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 17 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:51] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:51] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 17 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:51] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 16 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:51] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 6 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:51] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:52] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:52] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 14 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:52] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 297/297 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 352 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 352 transition count 296
Applied a total of 2 rules in 7 ms. Remains 352 /353 variables (removed 1) and now considering 296/297 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 352/353 places, 296/297 transitions.
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:52] [INFO ] Input system was already deterministic with 296 transitions.
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:39:52] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:39:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 23:39:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 353 places, 297 transitions and 1429 arcs took 3 ms.
Total runtime 160039 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-04
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-60a-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-60a-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-60a-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-60a-CTLFireability-2023-14
Could not compute solution for formula : DES-PT-60a-CTLFireability-2023-15

BK_STOP 1717198792635

--------------------
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 DES-PT-60a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/596/ctl_0_
ctl formula name DES-PT-60a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/596/ctl_1_
ctl formula name DES-PT-60a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/596/ctl_2_
ctl formula name DES-PT-60a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/596/ctl_3_
ctl formula name DES-PT-60a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/596/ctl_4_
ctl formula name DES-PT-60a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/596/ctl_5_
ctl formula name DES-PT-60a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/596/ctl_6_
ctl formula name DES-PT-60a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/596/ctl_7_
ctl formula name DES-PT-60a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/596/ctl_8_
ctl formula name DES-PT-60a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/596/ctl_9_
ctl formula name DES-PT-60a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/596/ctl_10_
ctl formula name DES-PT-60a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/596/ctl_11_
ctl formula name DES-PT-60a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/596/ctl_12_
ctl formula name DES-PT-60a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/596/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="DES-PT-60a"
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 DES-PT-60a, 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 r480-tall-171624189900746"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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