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.r267-smll-171654406000257.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 Peterson-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 27K Apr 12 02:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 12 02:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K Apr 12 02:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 134K Apr 12 02:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 108K Apr 12 02:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 511K Apr 12 02:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 12 02:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 12 02:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 143K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-3-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716767312290

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 23:48:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 23:48:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 23:48:34] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-05-26 23:48:34] [INFO ] Transformed 244 places.
[2024-05-26 23:48:34] [INFO ] Transformed 332 transitions.
[2024-05-26 23:48:34] [INFO ] Found NUPN structural information;
[2024-05-26 23:48:34] [INFO ] Parsed PT model containing 244 places and 332 transitions and 1016 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 109 ms.
Support contains 230 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2024-05-26 23:48:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2024-05-26 23:48:34] [INFO ] Computed 15 invariants in 29 ms
[2024-05-26 23:48:35] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-26 23:48:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 23:48:35] [INFO ] Invariant cache hit.
[2024-05-26 23:48:35] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-26 23:48:35] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-05-26 23:48:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 23:48:35] [INFO ] Invariant cache hit.
[2024-05-26 23:48:35] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:38] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 14 ms to minimize.
[2024-05-26 23:48:39] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 4 ms to minimize.
[2024-05-26 23:48:39] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-05-26 23:48:39] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 1 ms to minimize.
[2024-05-26 23:48:40] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:48:40] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 6/253 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:45] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:46] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 4/244 variables, 6/261 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 4/265 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 3 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 3 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 3 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 4 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:48:53] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 45 places in 124 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 3 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-26 23:48:54] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 5 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 3 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 3 ms to minimize.
[2024-05-26 23:48:55] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 20/287 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 3 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 1 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 1 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-26 23:48:56] [INFO ] Deduced a trap composed of 30 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 8 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:48:57] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:48:58] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-26 23:48:58] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2024-05-26 23:48:58] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 20/307 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:48:59] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:48:59] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2024-05-26 23:48:59] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:48:59] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-26 23:48:59] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-05-26 23:49:00] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2024-05-26 23:49:00] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:49:00] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 2 ms to minimize.
[2024-05-26 23:49:00] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-05-26 23:49:01] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 2 ms to minimize.
[2024-05-26 23:49:01] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-05-26 23:49:01] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-26 23:49:02] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 13/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/552 variables, and 320 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30033 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/244 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 5/245 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 59/306 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (OVERLAPS) 4/244 variables, 6/312 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 4/316 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-26 23:49:11] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 2 ms to minimize.
[2024-05-26 23:49:12] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/244 variables, 3/323 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:49:15] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-26 23:49:15] [INFO ] Deduced a trap composed of 74 places in 69 ms of which 1 ms to minimize.
[2024-05-26 23:49:16] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/244 variables, 3/326 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-05-26 23:49:18] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-26 23:49:19] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 2 ms to minimize.
[2024-05-26 23:49:19] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/244 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/244 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 13 (OVERLAPS) 308/552 variables, 244/573 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/552 variables, 57/630 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/552 variables, 328/958 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 958 constraints, problems are : Problem set: 0 solved, 328 unsolved in 30016 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 70/70 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Finished structural reductions in LTL mode , in 1 iterations and 61311 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 230 out of 244 places after structural reductions.
[2024-05-26 23:49:36] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-26 23:49:36] [INFO ] Flatten gal took : 76 ms
FORMULA Peterson-PT-3-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 23:49:36] [INFO ] Flatten gal took : 32 ms
[2024-05-26 23:49:36] [INFO ] Input system was already deterministic with 332 transitions.
RANDOM walk for 40000 steps (8 resets) in 4635 ms. (8 steps per ms) remains 25/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
[2024-05-26 23:49:38] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2024-05-26 23:49:38] [INFO ] Invariant cache hit.
[2024-05-26 23:49:38] [INFO ] State equation strengthened by 57 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 13 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 13 solved, 12 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/226 variables, 6/226 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 6/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 17 solved, 8 unsolved
[2024-05-26 23:49:39] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 308/540 variables, 232/477 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 57/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 12/552 variables, 12/546 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/552 variables, 12/558 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 3/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 0/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/552 variables, 0/561 constraints. Problems are: Problem set: 17 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 561 constraints, problems are : Problem set: 17 solved, 8 unsolved in 1598 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 17 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 14/14 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/14 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 212/226 variables, 6/20 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 212/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 0/232 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/228 variables, 2/234 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 2/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/236 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 4/232 variables, 4/240 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 4/244 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/232 variables, 1/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 0/245 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 308/540 variables, 232/477 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 57/534 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/542 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/542 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 12/552 variables, 12/554 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/552 variables, 12/566 constraints. Problems are: Problem set: 17 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/552 variables, 3/569 constraints. Problems are: Problem set: 17 solved, 8 unsolved
[2024-05-26 23:49:40] [INFO ] Deduced a trap composed of 16 places in 103 ms of which 3 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 2 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
Problem AtomicPropp10 is UNSAT
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 3 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 49 places in 79 ms of which 2 ms to minimize.
[2024-05-26 23:49:41] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-26 23:49:42] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/552 variables, 10/579 constraints. Problems are: Problem set: 18 solved, 7 unsolved
[2024-05-26 23:49:42] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-26 23:49:42] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/552 variables, 2/581 constraints. Problems are: Problem set: 18 solved, 7 unsolved
[2024-05-26 23:49:42] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-26 23:49:43] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-26 23:49:43] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/552 variables, 3/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/552 variables, 0/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 0/552 variables, 0/584 constraints. Problems are: Problem set: 18 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 584 constraints, problems are : Problem set: 18 solved, 7 unsolved in 3713 ms.
Refiners :[Domain max(s): 244/244 constraints, Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 244/244 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 8/25 constraints, Known Traps: 16/16 constraints]
After SMT, in 5401ms problems are : Problem set: 18 solved, 7 unsolved
Parikh walk visited 5 properties in 1972 ms.
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 244 transition count 241
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 153 transition count 241
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 182 place count 153 transition count 194
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 276 place count 106 transition count 194
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 300 place count 94 transition count 182
Applied a total of 300 rules in 58 ms. Remains 94 /244 variables (removed 150) and now considering 182/332 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 94/244 places, 182/332 transitions.
RANDOM walk for 40000 steps (8 resets) in 372 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 122035 steps, run visited all 2 properties in 598 ms. (steps per millisecond=204 )
Probabilistic random walk after 122035 steps, saw 24639 distinct states, run finished after 607 ms. (steps per millisecond=201 ) properties seen :2
Successfully simplified 18 atomic propositions for a total of 14 simplifications.
FORMULA Peterson-PT-3-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 23:49:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 23 ms
[2024-05-26 23:49:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Peterson-PT-3-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 23 ms
[2024-05-26 23:49:46] [INFO ] Input system was already deterministic with 332 transitions.
Support contains 124 out of 244 places (down from 215) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 20 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 20 ms
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 22 ms
[2024-05-26 23:49:46] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 244 transition count 296
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 208 transition count 296
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 72 place count 208 transition count 272
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 120 place count 184 transition count 272
Applied a total of 120 rules in 29 ms. Remains 184 /244 variables (removed 60) and now considering 272/332 (removed 60) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 184/244 places, 272/332 transitions.
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 14 ms
[2024-05-26 23:49:46] [INFO ] Flatten gal took : 15 ms
[2024-05-26 23:49:46] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 18 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 18 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 152 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 186 place count 151 transition count 193
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 302 place count 93 transition count 181
Applied a total of 302 rules in 28 ms. Remains 93 /244 variables (removed 151) and now considering 181/332 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 93/244 places, 181/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 9 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 10 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 16 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 14 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 96 place count 244 transition count 236
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 148 transition count 236
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 192 place count 148 transition count 188
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 288 place count 100 transition count 188
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 312 place count 88 transition count 176
Applied a total of 312 rules in 21 ms. Remains 88 /244 variables (removed 156) and now considering 176/332 (removed 156) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 88/244 places, 176/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 7 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 8 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 244 transition count 240
Reduce places removed 92 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 185 place count 152 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 186 place count 151 transition count 239
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 186 place count 151 transition count 193
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 302 place count 93 transition count 181
Applied a total of 302 rules in 23 ms. Remains 93 /244 variables (removed 151) and now considering 181/332 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 93/244 places, 181/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 8 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 8 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 13 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 14 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 332 transitions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 244/244 places, 332/332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 13 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 13 ms
[2024-05-26 23:49:47] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 13 ms
[2024-05-26 23:49:47] [INFO ] Flatten gal took : 12 ms
[2024-05-26 23:49:47] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-26 23:49:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 6 ms.
Total runtime 73349 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-PT-3

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 819
MODEL NAME: /home/mcc/execution/412/model
244 places, 332 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 Peterson-PT-3-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-3-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-3-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-3-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-3-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Peterson-PT-3-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA Peterson-PT-3-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA Peterson-PT-3-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA Peterson-PT-3-CTLCardinality-2024-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716768255965

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Peterson-PT-3"
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 Peterson-PT-3, 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 r267-smll-171654406000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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