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-171640602300785.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-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300785
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 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-12-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-12-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716490998217

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-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:03:19] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-23 19:03:19] [INFO ] Transformed 160 places.
[2024-05-23 19:03:19] [INFO ] Transformed 340 transitions.
[2024-05-23 19:03:19] [INFO ] Found NUPN structural information;
[2024-05-23 19:03:19] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 135 transition count 264
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 135 transition count 264
Applied a total of 50 rules in 23 ms. Remains 135 /160 variables (removed 25) and now considering 264/312 (removed 48) transitions.
[2024-05-23 19:03:19] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
// Phase 1: matrix 254 rows 135 cols
[2024-05-23 19:03:19] [INFO ] Computed 16 invariants in 13 ms
[2024-05-23 19:03:19] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-23 19:03:19] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-23 19:03:19] [INFO ] Invariant cache hit.
[2024-05-23 19:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 19:03:19] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2024-05-23 19:03:20] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-23 19:03:20] [INFO ] Invariant cache hit.
[2024-05-23 19:03:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 13 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:03:22] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-23 19:03:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 3 ms to minimize.
[2024-05-23 19:03:24] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:25] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:25] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:03:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-23 19:03:25] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:25] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 253/388 variables, 135/192 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:28] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 1/389 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/389 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/389 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 195 constraints, problems are : Problem set: 0 solved, 263 unsolved in 16180 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 43/59 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 36 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:37] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 0 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 4 ms to minimize.
[2024-05-23 19:03:38] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-23 19:03:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:40] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:41] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 253/388 variables, 135/212 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 263/475 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:03:43] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:03:44] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:45] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:03:45] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:45] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:46] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 14/489 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:03:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:03:49] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 4/493 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-23 19:03:53] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:03:53] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 2/495 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 16 (OVERLAPS) 1/389 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 496 constraints, problems are : Problem set: 0 solved, 263 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 81/81 constraints]
After SMT, in 46364ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 46390ms
Starting structural reductions in LTL mode, iteration 1 : 135/160 places, 264/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46803 ms. Remains : 135/160 places, 264/312 transitions.
Support contains 101 out of 135 places after structural reductions.
[2024-05-23 19:04:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 19:04:06] [INFO ] Flatten gal took : 42 ms
FORMULA HealthRecord-PT-12-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 19:04:06] [INFO ] Flatten gal took : 16 ms
[2024-05-23 19:04:06] [INFO ] Input system was already deterministic with 264 transitions.
Support contains 86 out of 135 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (2897 resets) in 1623 ms. (24 steps per ms) remains 27/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (38 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (34 resets) in 15 ms. (250 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (34 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (35 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (33 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (33 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (37 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (36 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (37 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (33 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
[2024-05-23 19:04:07] [INFO ] Flow matrix only has 254 transitions (discarded 10 similar events)
[2024-05-23 19:04:07] [INFO ] Invariant cache hit.
[2024-05-23 19:04:07] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 46/86 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 49/135 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-23 19:04:07] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 253/388 variables, 135/152 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-23 19:04:08] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/388 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 1/389 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/389 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-23 19:04:08] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/389 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-23 19:04:08] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/389 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (OVERLAPS) 0/389 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 156 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 46/86 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
Problem AtomicPropp20 is UNSAT
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 4/12 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 4/16 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 49/135 variables, 8/24 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 4/28 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:09] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 20/48 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:10] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 18/66 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-23 19:04:11] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/135 variables, 7/73 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/135 variables, 2/75 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 2 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 13/88 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:12] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:04:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:04:13] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 3/91 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:13] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 1/92 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 15 (OVERLAPS) 253/388 variables, 135/227 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/388 variables, 25/252 constraints. Problems are: Problem set: 2 solved, 25 unsolved
[2024-05-23 19:04:13] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/388 variables, 1/253 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/388 variables, 0/253 constraints. Problems are: Problem set: 2 solved, 25 unsolved
At refinement iteration 19 (OVERLAPS) 1/389 variables, 1/254 constraints. Problems are: Problem set: 2 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 254 constraints, problems are : Problem set: 2 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 135/135 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/27 constraints, Known Traps: 77/77 constraints]
After SMT, in 6711ms problems are : Problem set: 2 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 135 edges and 135 vertex of which 4 / 135 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 576 edges and 133 vertex of which 130 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 247
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 128 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 128 transition count 244
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 127 transition count 244
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 48 place count 89 transition count 168
Iterating global reduction 2 with 38 rules applied. Total rules applied 86 place count 89 transition count 168
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 90 place count 85 transition count 160
Iterating global reduction 2 with 4 rules applied. Total rules applied 94 place count 85 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 85 transition count 157
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 99 place count 84 transition count 156
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 113 place count 77 transition count 189
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 77 transition count 184
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 138 place count 77 transition count 184
Applied a total of 138 rules in 67 ms. Remains 77 /135 variables (removed 58) and now considering 184/264 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 77/135 places, 184/264 transitions.
RANDOM walk for 40000 steps (1694 resets) in 647 ms. (61 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4003 steps (76 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (74 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (80 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (72 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (83 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (84 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (57 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (76 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (79 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (91 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (66 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (82 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (79 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (86 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (75 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
[2024-05-23 19:04:14] [INFO ] Flow matrix only has 173 transitions (discarded 11 similar events)
// Phase 1: matrix 173 rows 77 cols
[2024-05-23 19:04:14] [INFO ] Computed 13 invariants in 11 ms
[2024-05-23 19:04:14] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 48/77 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 173/250 variables, 77/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 13/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 103 constraints, problems are : Problem set: 0 solved, 15 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 7/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 48/77 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:14] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:04:14] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-05-23 19:04:14] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:15] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-23 19:04:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 173/250 variables, 77/114 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 13/127 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 15/142 constraints. Problems are: Problem set: 0 solved, 15 unsolved
[2024-05-23 19:04:16] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-23 19:04:16] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-23 19:04:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 3/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 15 (OVERLAPS) 0/250 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 145 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 27/27 constraints]
After SMT, in 2184ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 13 properties in 1080 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 184/184 transitions.
Graph (trivial) has 61 edges and 77 vertex of which 2 / 77 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 446 edges and 76 vertex of which 72 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 21 place count 53 transition count 145
Iterating global reduction 0 with 19 rules applied. Total rules applied 40 place count 53 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 53 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 51 transition count 138
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 51 transition count 138
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 47 place count 50 transition count 137
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 47 transition count 149
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 45 transition count 141
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 45 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 45 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 61 place count 43 transition count 139
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 79 place count 43 transition count 139
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 43 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 42 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 42 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 86 place count 42 transition count 133
Applied a total of 86 rules in 38 ms. Remains 42 /77 variables (removed 35) and now considering 133/184 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 42/77 places, 133/184 transitions.
RANDOM walk for 40000 steps (5681 resets) in 493 ms. (80 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (848 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (816 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4205 steps, run visited all 2 properties in 24 ms. (steps per millisecond=175 )
Probabilistic random walk after 4205 steps, saw 1348 distinct states, run finished after 27 ms. (steps per millisecond=155 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 12 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 13 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 264 transitions.
Computed a total of 14 stabilizing places and 25 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 180 edges and 135 vertex of which 6 / 135 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.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 69 transition count 142
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 69 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 136 place count 60 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 145 place count 60 transition count 124
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 152 place count 60 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 59 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 59 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 58 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 58 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 159 place count 58 transition count 109
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 161 place count 58 transition count 107
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 2 with 4 rules applied. Total rules applied 165 place count 56 transition count 105
Applied a total of 165 rules in 22 ms. Remains 56 /135 variables (removed 79) and now considering 105/264 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 56/135 places, 105/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 71 transition count 142
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 71 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 137 place count 62 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 146 place count 62 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 151 place count 62 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 60 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 156 place count 59 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 157 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 160 place count 59 transition count 108
Applied a total of 160 rules in 7 ms. Remains 59 /135 variables (removed 76) and now considering 108/264 (removed 156) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 59/135 places, 108/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 10 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 194 edges and 135 vertex of which 8 / 135 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 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 67 place count 65 transition count 135
Iterating global reduction 0 with 66 rules applied. Total rules applied 133 place count 65 transition count 135
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 54 transition count 113
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 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 165 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 174 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 48 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 186 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 45 transition count 73
Applied a total of 195 rules in 18 ms. Remains 45 /135 variables (removed 90) and now considering 73/264 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 45/135 places, 73/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 189 edges and 135 vertex of which 8 / 135 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.
Reduce places removed 1 places and 1 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 66 transition count 137
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 66 transition count 137
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 140 place count 55 transition count 115
Iterating global reduction 0 with 11 rules applied. Total rules applied 151 place count 55 transition count 115
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 161 place count 55 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 162 place count 54 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 163 place count 54 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 164 place count 53 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 165 place count 53 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 167 place count 53 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 170 place count 53 transition count 95
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 2 with 4 rules applied. Total rules applied 174 place count 51 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 50 transition count 92
Applied a total of 175 rules in 18 ms. Remains 50 /135 variables (removed 85) and now considering 92/264 (removed 172) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 50/135 places, 92/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 188 edges and 135 vertex of which 8 / 135 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.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 68 transition count 141
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 68 transition count 141
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 137 place count 58 transition count 121
Iterating global reduction 0 with 10 rules applied. Total rules applied 147 place count 58 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 156 place count 58 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 56 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 56 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 54 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 54 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 170 place count 54 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 173 place count 54 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 51 transition count 90
Applied a total of 179 rules in 14 ms. Remains 51 /135 variables (removed 84) and now considering 90/264 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 51/135 places, 90/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 75 transition count 151
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 75 transition count 151
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 127 place count 68 transition count 137
Iterating global reduction 0 with 7 rules applied. Total rules applied 134 place count 68 transition count 137
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 142 place count 68 transition count 129
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 67 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 67 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 66 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 66 transition count 124
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 149 place count 66 transition count 121
Applied a total of 149 rules in 5 ms. Remains 66 /135 variables (removed 69) and now considering 121/264 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 66/135 places, 121/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 194 edges and 135 vertex of which 8 / 135 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 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 67 place count 65 transition count 135
Iterating global reduction 0 with 66 rules applied. Total rules applied 133 place count 65 transition count 135
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 144 place count 54 transition count 113
Iterating global reduction 0 with 11 rules applied. Total rules applied 155 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 165 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 51 transition count 94
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 51 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 174 place count 48 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 177 place count 48 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 186 place count 48 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 189 place count 48 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 195 place count 45 transition count 73
Applied a total of 195 rules in 13 ms. Remains 45 /135 variables (removed 90) and now considering 73/264 (removed 191) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 45/135 places, 73/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 73 transitions.
RANDOM walk for 40000 steps (3371 resets) in 228 ms. (174 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (435 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 481695 steps, run visited all 1 properties in 378 ms. (steps per millisecond=1274 )
Probabilistic random walk after 481695 steps, saw 63274 distinct states, run finished after 379 ms. (steps per millisecond=1270 ) properties seen :1
FORMULA HealthRecord-PT-12-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 74 transition count 148
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 74 transition count 148
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 65 transition count 130
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 65 transition count 130
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 149 place count 65 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 150 place count 64 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 151 place count 64 transition count 118
Applied a total of 151 rules in 3 ms. Remains 64 /135 variables (removed 71) and now considering 118/264 (removed 146) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 64/135 places, 118/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 5 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 177 edges and 135 vertex of which 8 / 135 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 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 65 place count 66 transition count 138
Iterating global reduction 0 with 64 rules applied. Total rules applied 129 place count 66 transition count 138
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 136 place count 59 transition count 124
Iterating global reduction 0 with 7 rules applied. Total rules applied 143 place count 59 transition count 124
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 147 place count 59 transition count 120
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 149 place count 57 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 151 place count 57 transition count 114
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 55 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 55 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 160 place count 55 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 55 transition count 102
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 2 with 4 rules applied. Total rules applied 167 place count 53 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 52 transition count 99
Applied a total of 168 rules in 13 ms. Remains 52 /135 variables (removed 83) and now considering 99/264 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 52/135 places, 99/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 68 transition count 136
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 68 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 59 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 59 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 158 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 56 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 167 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 170 place count 53 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 179 place count 53 transition count 88
Applied a total of 179 rules in 3 ms. Remains 53 /135 variables (removed 82) and now considering 88/264 (removed 176) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/135 places, 88/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 68 transition count 136
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 68 transition count 136
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 143 place count 59 transition count 118
Iterating global reduction 0 with 9 rules applied. Total rules applied 152 place count 59 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 158 place count 59 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 159 place count 58 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 160 place count 58 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 57 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 57 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 165 place count 57 transition count 104
Applied a total of 165 rules in 3 ms. Remains 57 /135 variables (removed 78) and now considering 104/264 (removed 160) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/135 places, 104/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 6 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 66 place count 69 transition count 139
Iterating global reduction 0 with 66 rules applied. Total rules applied 132 place count 69 transition count 139
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 141 place count 60 transition count 121
Iterating global reduction 0 with 9 rules applied. Total rules applied 150 place count 60 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 159 place count 60 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 57 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 57 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 54 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 54 transition count 97
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 178 place count 54 transition count 90
Applied a total of 178 rules in 2 ms. Remains 54 /135 variables (removed 81) and now considering 90/264 (removed 174) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/135 places, 90/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 3 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 90 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Graph (trivial) has 179 edges and 135 vertex of which 8 / 135 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.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 61 place count 71 transition count 146
Iterating global reduction 0 with 60 rules applied. Total rules applied 121 place count 71 transition count 146
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 130 place count 62 transition count 128
Iterating global reduction 0 with 9 rules applied. Total rules applied 139 place count 62 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 145 place count 62 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 62 transition count 119
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 154 place count 59 transition count 116
Applied a total of 154 rules in 9 ms. Remains 59 /135 variables (removed 76) and now considering 116/264 (removed 148) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 59/135 places, 116/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 264/264 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 70 transition count 141
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 70 transition count 141
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 138 place count 62 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 146 place count 62 transition count 125
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 154 place count 62 transition count 117
Applied a total of 154 rules in 2 ms. Remains 62 /135 variables (removed 73) and now considering 117/264 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 62/135 places, 117/264 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 4 ms
[2024-05-23 19:04:18] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:04:18] [INFO ] Flatten gal took : 8 ms
[2024-05-23 19:04:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 19:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 264 transitions and 738 arcs took 2 ms.
Total runtime 59654 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HealthRecord-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 135
TRANSITIONS: 264
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/402/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: 1111
MODEL NAME: /home/mcc/execution/402/model
135 places, 264 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-12-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HealthRecord-PT-12-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716491088849

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-12"
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-12, 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-171640602300785"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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