fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r179-tall-171640602400801
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for HealthRecord-PT-14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
382.756 45488.00 78815.00 149.90 TTTFTFFTFTTTFFTF 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-171640602400801.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-14, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602400801
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 20:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 12 20:29 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 72K 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-14-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-14-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716491209012

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-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:06:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:06:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:06:50] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-23 19:06:50] [INFO ] Transformed 162 places.
[2024-05-23 19:06:50] [INFO ] Transformed 347 transitions.
[2024-05-23 19:06:50] [INFO ] Found NUPN structural information;
[2024-05-23 19:06:50] [INFO ] Parsed PT model containing 162 places and 347 transitions and 915 arcs in 167 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-14-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 318/318 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 104 transition count 208
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 104 transition count 208
Applied a total of 116 rules in 25 ms. Remains 104 /162 variables (removed 58) and now considering 208/318 (removed 110) transitions.
[2024-05-23 19:06:50] [INFO ] Flow matrix only has 202 transitions (discarded 6 similar events)
// Phase 1: matrix 202 rows 104 cols
[2024-05-23 19:06:50] [INFO ] Computed 12 invariants in 15 ms
[2024-05-23 19:06:50] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-23 19:06:50] [INFO ] Flow matrix only has 202 transitions (discarded 6 similar events)
[2024-05-23 19:06:50] [INFO ] Invariant cache hit.
[2024-05-23 19:06:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:06:50] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 207 sub problems to find dead transitions.
[2024-05-23 19:06:50] [INFO ] Flow matrix only has 202 transitions (discarded 6 similar events)
[2024-05-23 19:06:50] [INFO ] Invariant cache hit.
[2024-05-23 19:06:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 13 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 2 ms to minimize.
[2024-05-23 19:06:52] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 2 ms to minimize.
[2024-05-23 19:06:53] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 201/305 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 7 (OVERLAPS) 1/306 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 0/306 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 126 constraints, problems are : Problem set: 0 solved, 207 unsolved in 7932 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 207 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 5 (OVERLAPS) 201/305 variables, 104/125 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 207/332 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:07:00] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:07:01] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 9/341 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 9 (OVERLAPS) 1/306 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-23 19:07:06] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:06] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:07:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/306 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 207 unsolved
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:07:12] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:07:14] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/306 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/306 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 207 unsolved
At refinement iteration 14 (OVERLAPS) 0/306 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 207 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 349 constraints, problems are : Problem set: 0 solved, 207 unsolved in 23371 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 207/207 constraints, Known Traps: 25/25 constraints]
After SMT, in 31470ms problems are : Problem set: 0 solved, 207 unsolved
Search for dead transitions found 0 dead transitions in 31486ms
Starting structural reductions in LTL mode, iteration 1 : 104/162 places, 208/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31925 ms. Remains : 104/162 places, 208/318 transitions.
Support contains 63 out of 104 places after structural reductions.
[2024-05-23 19:07:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 19:07:22] [INFO ] Flatten gal took : 44 ms
FORMULA HealthRecord-PT-14-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:07:22] [INFO ] Flatten gal took : 19 ms
[2024-05-23 19:07:22] [INFO ] Input system was already deterministic with 208 transitions.
RANDOM walk for 40000 steps (3396 resets) in 1836 ms. (21 steps per ms) remains 12/40 properties
BEST_FIRST walk for 40003 steps (396 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (385 resets) in 137 ms. (289 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (390 resets) in 110 ms. (360 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (392 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (392 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (386 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (383 resets) in 76 ms. (519 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (375 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (383 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (388 resets) in 79 ms. (500 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (380 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
[2024-05-23 19:07:23] [INFO ] Flow matrix only has 202 transitions (discarded 6 similar events)
[2024-05-23 19:07:23] [INFO ] Invariant cache hit.
[2024-05-23 19:07:23] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 47/104 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:07:23] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 201/305 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/306 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 118 constraints, problems are : Problem set: 0 solved, 10 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 47/104 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 201/305 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:07:24] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 2 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 6/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:07:25] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 1/306 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/306 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 0/306 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 146 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1474 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 19/19 constraints]
After SMT, in 1911ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 7138 steps, including 281 resets, run visited all 1 properties in 17 ms. (steps per millisecond=419 )
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 10 properties in 383 ms.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 11 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 11 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 208 transitions.
Computed a total of 8 stabilizing places and 13 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 121 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 62 transition count 130
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 62 transition count 130
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 88 place count 53 transition count 111
Iterating global reduction 0 with 9 rules applied. Total rules applied 97 place count 53 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 107 place count 53 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 110 place count 50 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 113 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 116 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 48 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 48 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 126 place count 48 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 48 transition count 79
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 129 place count 47 transition count 78
Applied a total of 129 rules in 33 ms. Remains 47 /104 variables (removed 57) and now considering 78/208 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 47/104 places, 78/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 126 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 41 place count 61 transition count 128
Iterating global reduction 0 with 40 rules applied. Total rules applied 81 place count 61 transition count 128
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 90 place count 52 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 99 place count 52 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 108 place count 52 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 49 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 49 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 117 place count 49 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 47 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 47 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 127 place count 47 transition count 79
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 129 place count 47 transition count 77
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 131 place count 46 transition count 76
Applied a total of 131 rules in 22 ms. Remains 46 /104 variables (removed 58) and now considering 76/208 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 46/104 places, 76/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 69 transition count 141
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 69 transition count 141
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 65 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 65 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 80 place count 65 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 81 place count 64 transition count 128
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 64 transition count 128
Applied a total of 82 rules in 5 ms. Remains 64 /104 variables (removed 40) and now considering 128/208 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/104 places, 128/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 63 transition count 129
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 63 transition count 129
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 54 transition count 110
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 54 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 54 transition count 101
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 51 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 51 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 51 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 49 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 49 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 49 transition count 80
Applied a total of 128 rules in 6 ms. Remains 49 /104 variables (removed 55) and now considering 80/208 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 49/104 places, 80/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 69 transition count 140
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 69 transition count 140
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 77 place count 62 transition count 125
Iterating global reduction 0 with 7 rules applied. Total rules applied 84 place count 62 transition count 125
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 93 place count 62 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 61 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 61 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 60 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 60 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 60 transition count 109
Applied a total of 99 rules in 6 ms. Remains 60 /104 variables (removed 44) and now considering 109/208 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 60/104 places, 109/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 63 transition count 128
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 63 transition count 128
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 91 place count 54 transition count 109
Iterating global reduction 0 with 9 rules applied. Total rules applied 100 place count 54 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 109 place count 54 transition count 100
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 51 transition count 92
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 51 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 51 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 49 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 49 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 49 transition count 79
Applied a total of 128 rules in 5 ms. Remains 49 /104 variables (removed 55) and now considering 79/208 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/104 places, 79/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 79 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 67 transition count 137
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 67 transition count 137
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 58 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 58 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 100 place count 58 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 55 transition count 102
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 55 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 108 place count 55 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 53 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 53 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 53 transition count 90
Applied a total of 118 rules in 9 ms. Remains 53 /104 variables (removed 51) and now considering 90/208 (removed 118) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 53/104 places, 90/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 128 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 63 transition count 133
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 63 transition count 133
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 85 place count 53 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 95 place count 53 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 104 place count 53 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 51 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 51 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 111 place count 51 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 50 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 50 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 50 transition count 89
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 119 place count 49 transition count 88
Applied a total of 119 rules in 16 ms. Remains 49 /104 variables (removed 55) and now considering 88/208 (removed 120) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 49/104 places, 88/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 63 transition count 129
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 63 transition count 129
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 90 place count 55 transition count 113
Iterating global reduction 0 with 8 rules applied. Total rules applied 98 place count 55 transition count 113
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 107 place count 55 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 109 place count 53 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 53 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 113 place count 51 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 115 place count 51 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 121 place count 51 transition count 88
Applied a total of 121 rules in 2 ms. Remains 51 /104 variables (removed 53) and now considering 88/208 (removed 120) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/104 places, 88/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 62 transition count 127
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 62 transition count 127
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 53 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 53 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 111 place count 53 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 50 transition count 91
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 50 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 48 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 48 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 130 place count 48 transition count 78
Applied a total of 130 rules in 3 ms. Remains 48 /104 variables (removed 56) and now considering 78/208 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/104 places, 78/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 78 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 116 edges and 104 vertex of which 4 / 104 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 65 transition count 136
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 65 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 81 place count 57 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 89 place count 57 transition count 120
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 98 place count 57 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 55 transition count 105
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 55 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 53 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 53 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 111 place count 53 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 112 place count 53 transition count 95
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 2 with 2 rules applied. Total rules applied 114 place count 52 transition count 94
Applied a total of 114 rules in 13 ms. Remains 52 /104 variables (removed 52) and now considering 94/208 (removed 114) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 52/104 places, 94/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 128 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 38 place count 64 transition count 134
Iterating global reduction 0 with 37 rules applied. Total rules applied 75 place count 64 transition count 134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 85 place count 54 transition count 113
Iterating global reduction 0 with 10 rules applied. Total rules applied 95 place count 54 transition count 113
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 105 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 108 place count 51 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 111 place count 51 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 114 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 49 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 49 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 122 place count 49 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 49 transition count 83
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 125 place count 48 transition count 82
Applied a total of 125 rules in 12 ms. Remains 48 /104 variables (removed 56) and now considering 82/208 (removed 126) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 48/104 places, 82/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 121 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 64 transition count 135
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 64 transition count 135
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 80 place count 57 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 87 place count 57 transition count 121
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 93 place count 57 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 57 transition count 114
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 1 with 2 rules applied. Total rules applied 96 place count 56 transition count 113
Applied a total of 96 rules in 11 ms. Remains 56 /104 variables (removed 48) and now considering 113/208 (removed 95) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 56/104 places, 113/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 208/208 transitions.
Graph (trivial) has 127 edges and 104 vertex of which 6 / 104 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 64 transition count 134
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 64 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 80 place count 57 transition count 119
Iterating global reduction 0 with 7 rules applied. Total rules applied 87 place count 57 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 94 place count 57 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 55 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 55 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 101 place count 55 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 54 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 54 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 54 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 54 transition count 98
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 109 place count 53 transition count 97
Applied a total of 109 rules in 11 ms. Remains 53 /104 variables (removed 51) and now considering 97/208 (removed 111) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 53/104 places, 97/208 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:07:26] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:07:26] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:07:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 19:07:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 208 transitions and 622 arcs took 4 ms.
Total runtime 36342 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 104
TRANSITIONS: 208
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 688
MODEL NAME: /home/mcc/execution/412/model
104 places, 208 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-14-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-14-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716491254500

--------------------
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-14"
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-14, 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-171640602400801"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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