About the Execution of GreatSPN+red for HealthRecord-PT-13
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
364.987 | 41334.00 | 64288.00 | 133.50 | TFFFFFFTFFFFTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r179-tall-171640602300793.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 greatspnxred
Input is HealthRecord-PT-13, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300793
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K 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 HealthRecord-PT-13-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-13-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716491128101
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-13
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:05:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:05:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:05:29] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-23 19:05:29] [INFO ] Transformed 161 places.
[2024-05-23 19:05:29] [INFO ] Transformed 341 transitions.
[2024-05-23 19:05:29] [INFO ] Found NUPN structural information;
[2024-05-23 19:05:29] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-13-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 102 transition count 198
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 102 transition count 198
Applied a total of 118 rules in 22 ms. Remains 102 /161 variables (removed 59) and now considering 198/313 (removed 115) transitions.
[2024-05-23 19:05:29] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
// Phase 1: matrix 189 rows 102 cols
[2024-05-23 19:05:29] [INFO ] Computed 15 invariants in 13 ms
[2024-05-23 19:05:29] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-23 19:05:29] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-23 19:05:29] [INFO ] Invariant cache hit.
[2024-05-23 19:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:05:29] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Running 197 sub problems to find dead transitions.
[2024-05-23 19:05:29] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-23 19:05:29] [INFO ] Invariant cache hit.
[2024-05-23 19:05:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 10 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:31] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:32] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:05:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 0 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:34] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:35] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:05:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:05:35] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:35] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:36] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:05:36] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:36] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 0 ms to minimize.
[2024-05-23 19:05:36] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-23 19:05:36] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:05:37] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 10 (OVERLAPS) 188/290 variables, 102/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (OVERLAPS) 1/291 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 170 constraints, problems are : Problem set: 0 solved, 197 unsolved in 11829 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 5 (OVERLAPS) 188/290 variables, 102/169 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 197/366 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:43] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:43] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 9 (OVERLAPS) 1/291 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 197 unsolved
[2024-05-23 19:05:50] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 370 constraints, problems are : Problem set: 0 solved, 197 unsolved in 18002 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 197/197 constraints, Known Traps: 55/55 constraints]
After SMT, in 29983ms problems are : Problem set: 0 solved, 197 unsolved
Search for dead transitions found 0 dead transitions in 30002ms
Starting structural reductions in LTL mode, iteration 1 : 102/161 places, 198/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30409 ms. Remains : 102/161 places, 198/313 transitions.
Support contains 60 out of 102 places after structural reductions.
[2024-05-23 19:06:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 19:06:00] [INFO ] Flatten gal took : 38 ms
FORMULA HealthRecord-PT-13-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:06:00] [INFO ] Flatten gal took : 15 ms
[2024-05-23 19:06:00] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 56 out of 102 places (down from 60) after GAL structural reductions.
RANDOM walk for 40000 steps (3123 resets) in 2080 ms. (19 steps per ms) remains 17/37 properties
BEST_FIRST walk for 4004 steps (43 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (40 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 23 ms. (166 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (41 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (41 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (41 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (41 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (42 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (42 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (39 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (43 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (43 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
[2024-05-23 19:06:01] [INFO ] Flow matrix only has 189 transitions (discarded 9 similar events)
[2024-05-23 19:06:01] [INFO ] Invariant cache hit.
[2024-05-23 19:06:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp24 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 38/65 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 37/102 variables, 8/15 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 2 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 8/23 constraints. Problems are: Problem set: 1 solved, 15 unsolved
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
Problem AtomicPropp23 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 4/27 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:06:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/29 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 188/290 variables, 102/131 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 1/291 variables, 1/132 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/291 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 132 constraints, problems are : Problem set: 2 solved, 14 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 41/63 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 7/16 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 39/102 variables, 8/25 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 12/37 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:06:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 2/39 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 188/290 variables, 102/141 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 14/155 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:03] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:06:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 2/157 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-05-23 19:06:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/290 variables, 1/158 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/290 variables, 0/158 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 1/291 variables, 1/159 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 0/291 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 159 constraints, problems are : Problem set: 2 solved, 14 unsolved in 1441 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 27/27 constraints]
After SMT, in 2720ms problems are : Problem set: 2 solved, 14 unsolved
Fused 14 Parikh solutions to 10 different solutions.
Finished Parikh walk after 600 steps, including 30 resets, run visited all 1 properties in 2 ms. (steps per millisecond=300 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 14 properties in 308 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 16 ms
[2024-05-23 19:06:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA HealthRecord-PT-13-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 11 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 43 out of 102 places (down from 47) after GAL structural reductions.
Computed a total of 8 stabilizing places and 12 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 65 transition count 128
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 65 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 57 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 57 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 99 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 54 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 54 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 51 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 51 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 120 place count 51 transition count 79
Applied a total of 120 rules in 12 ms. Remains 51 /102 variables (removed 51) and now considering 79/198 (removed 119) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 51/102 places, 79/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 123 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 61 transition count 127
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 61 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 74 place count 61 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 54 transition count 112
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 54 transition count 112
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 94 place count 54 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 53 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 53 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 52 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 52 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 101 place count 52 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 52 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 51 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 50 transition count 94
Applied a total of 106 rules in 38 ms. Remains 50 /102 variables (removed 52) and now considering 94/198 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 50/102 places, 94/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 74 transition count 147
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 74 transition count 147
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 62 place count 68 transition count 135
Iterating global reduction 0 with 6 rules applied. Total rules applied 68 place count 68 transition count 135
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 76 place count 68 transition count 127
Applied a total of 76 rules in 5 ms. Remains 68 /102 variables (removed 34) and now considering 127/198 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 68/102 places, 127/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 64 transition count 128
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 64 transition count 128
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 57 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 57 transition count 114
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 96 place count 57 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 54 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 54 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 51 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 51 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 117 place count 51 transition count 84
Applied a total of 117 rules in 8 ms. Remains 51 /102 variables (removed 51) and now considering 84/198 (removed 114) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 51/102 places, 84/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 64 transition count 128
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 64 transition count 128
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 56 transition count 112
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 56 transition count 112
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 101 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 53 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 50 transition count 88
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 121 place count 50 transition count 80
Applied a total of 121 rules in 7 ms. Remains 50 /102 variables (removed 52) and now considering 80/198 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/102 places, 80/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 69 transition count 137
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 69 transition count 137
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 73 place count 62 transition count 123
Iterating global reduction 0 with 7 rules applied. Total rules applied 80 place count 62 transition count 123
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 89 place count 62 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 60 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 60 transition count 108
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 58 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 103 place count 58 transition count 98
Applied a total of 103 rules in 7 ms. Remains 58 /102 variables (removed 44) and now considering 98/198 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 58/102 places, 98/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 67 transition count 134
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 67 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 60 transition count 120
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 60 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 87 place count 60 transition count 117
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 90 place count 57 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 93 place count 57 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 54 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 54 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 108 place count 54 transition count 93
Applied a total of 108 rules in 7 ms. Remains 54 /102 variables (removed 48) and now considering 93/198 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 54/102 places, 93/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 130 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 39 place count 59 transition count 123
Iterating global reduction 0 with 38 rules applied. Total rules applied 77 place count 59 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 78 place count 59 transition count 122
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 86 place count 51 transition count 106
Iterating global reduction 1 with 8 rules applied. Total rules applied 94 place count 51 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 103 place count 51 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 48 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 45 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 45 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 45 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 44 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 43 transition count 69
Applied a total of 129 rules in 20 ms. Remains 43 /102 variables (removed 59) and now considering 69/198 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 43/102 places, 69/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Graph (trivial) has 124 edges and 102 vertex of which 8 / 102 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 36 place count 63 transition count 130
Iterating global reduction 0 with 35 rules applied. Total rules applied 71 place count 63 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 72 place count 63 transition count 129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 57 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 57 transition count 117
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 89 place count 57 transition count 112
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 55 transition count 106
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 55 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 53 transition count 102
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 103 place count 53 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 53 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 51 transition count 92
Applied a total of 109 rules in 19 ms. Remains 51 /102 variables (removed 51) and now considering 92/198 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 51/102 places, 92/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 92 transitions.
RANDOM walk for 10565 steps (974 resets) in 32 ms. (320 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-13-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 198/198 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 65 transition count 130
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 65 transition count 130
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 58 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 58 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 97 place count 58 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 56 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 56 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 55 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 55 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 106 place count 55 transition count 96
Applied a total of 106 rules in 5 ms. Remains 55 /102 variables (removed 47) and now considering 96/198 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 55/102 places, 96/198 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:06:04] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:06:04] [INFO ] Flatten gal took : 7 ms
[2024-05-23 19:06:04] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 19:06:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 198 transitions and 604 arcs took 2 ms.
Total runtime 35277 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running HealthRecord-PT-13
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 102
TRANSITIONS: 198
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 803
MODEL NAME: /home/mcc/execution/413/model
102 places, 198 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA HealthRecord-PT-13-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-13-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716491169435
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
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="HealthRecord-PT-13"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is HealthRecord-PT-13, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640602300793"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;