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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 16:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 11 16:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K 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 FunctionPointer-PT-a128-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-a128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716431279133

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:28:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:28:00] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2024-05-23 02:28:00] [INFO ] Transformed 40 places.
[2024-05-23 02:28:00] [INFO ] Transformed 70 transitions.
[2024-05-23 02:28:00] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Support contains 33 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 18 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-23 02:28:00] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:28:00] [INFO ] Computed 4 invariants in 22 ms
[2024-05-23 02:28:00] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-23 02:28:00] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:28:01] [INFO ] Invariant cache hit.
[2024-05-23 02:28:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:28:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:28:01] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:28:01] [INFO ] Invariant cache hit.
[2024-05-23 02:28:01] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 60/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 110 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 3197ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 3220ms
Finished structural reductions in LTL mode , in 1 iterations and 3621 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 33 out of 34 places after structural reductions.
[2024-05-23 02:28:04] [INFO ] Flatten gal took : 25 ms
[2024-05-23 02:28:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-a128-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:28:04] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:28:04] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 40159 steps (80 resets) in 1158 ms. (34 steps per ms) remains 50/87 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (14 resets) in 62 ms. (63 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 44 ms. (88 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (24 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (10 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (13 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (28 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 15 ms. (250 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (15 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (33 resets) in 10 ms. (363 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 40 ms. (97 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 14 ms. (266 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (15 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (15 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (10 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (23 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4003 steps (16 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (22 resets) in 8 ms. (444 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (14 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 50/50 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 50/50 properties
[2024-05-23 02:28:05] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:28:05] [INFO ] Invariant cache hit.
[2024-05-23 02:28:05] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp83 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 22 solved, 28 unsolved
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/4 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 41/68 variables, 27/31 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 7/38 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/38 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 11/79 variables, 6/44 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 1/45 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 1/80 variables, 1/46 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 26 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 26 solved, 24 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 26 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 2/2 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 1/3 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/4 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 41/68 variables, 27/31 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 7/38 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 16/54 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/54 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 11/79 variables, 6/60 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 8/69 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 0/69 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 1/80 variables, 1/70 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/80 variables, 0/70 constraints. Problems are: Problem set: 26 solved, 24 unsolved
At refinement iteration 17 (OVERLAPS) 0/80 variables, 0/70 constraints. Problems are: Problem set: 26 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 70 constraints, problems are : Problem set: 26 solved, 24 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 24/50 constraints, Known Traps: 0/0 constraints]
After SMT, in 915ms problems are : Problem set: 26 solved, 24 unsolved
Fused 24 Parikh solutions to 20 different solutions.
Finished Parikh walk after 8033 steps, including 1 resets, run visited all 1 properties in 10 ms. (steps per millisecond=803 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 24 properties in 10475 ms.
Successfully simplified 26 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-a128-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:28:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:28:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FunctionPointer-PT-a128-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a128-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 5 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 25 out of 34 places (down from 28) after GAL structural reductions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Applied a total of 5 rules in 17 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 10 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 60 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 33 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 32 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 32 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 32 transition count 62
Applied a total of 5 rules in 2 ms. Remains 32 /34 variables (removed 2) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 32/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 3 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 31/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 3 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 31/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 64
Applied a total of 3 rules in 5 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 32/34 places, 64/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:28:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:28:17] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-23 02:28:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 1 ms.
Total runtime 16938 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-a128

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: 34
TRANSITIONS: 66
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/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: 547
MODEL NAME: /home/mcc/execution/412/model
34 places, 66 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 9 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431298209

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-a128"
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 FunctionPointer-PT-a128, 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-171640601000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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