About the Execution of LTSMin+red for FunctionPointer-PT-a064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 396.936 | 45969.00 | 107649.00 | 93.40 | TFTF?TFF????T??? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602900201.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 ltsminxred
Input is FunctionPointer-PT-a064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602900201
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K 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 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 16:08 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-a064-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717187500139
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:31:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:31:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:31:41] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-31 20:31:41] [INFO ] Transformed 40 places.
[2024-05-31 20:31:41] [INFO ] Transformed 70 transitions.
[2024-05-31 20:31:41] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 8 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-31 20:31:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-31 20:31:41] [INFO ] Computed 4 invariants in 4 ms
[2024-05-31 20:31:41] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 20:31:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:31:41] [INFO ] Invariant cache hit.
[2024-05-31 20:31:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:31:41] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-31 20:31:41] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:31:41] [INFO ] Invariant cache hit.
[2024-05-31 20:31:41] [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 1084 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 1080 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 2258ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2271ms
Finished structural reductions in LTL mode , in 1 iterations and 2556 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 33 out of 34 places after structural reductions.
[2024-05-31 20:31:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 20:31:44] [INFO ] Flatten gal took : 25 ms
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:31:44] [INFO ] Flatten gal took : 10 ms
[2024-05-31 20:31:44] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 40057 steps (89 resets) in 2014 ms. (19 steps per ms) remains 33/56 properties
BEST_FIRST walk for 4003 steps (12 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (9 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (17 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (12 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (11 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (10 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (10 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (20 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (15 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (21 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2024-05-31 20:31:45] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-31 20:31:45] [INFO ] Invariant cache hit.
[2024-05-31 20:31:45] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/29 variables, 3/4 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 43/72 variables, 29/33 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 7/40 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/40 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/79 variables, 4/44 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/45 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 1/80 variables, 1/46 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 17 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 17 solved, 16 unsolved in 267 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: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 13/27 variables, 3/3 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/4 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 42/70 variables, 28/32 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 7/39 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 12/51 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/51 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 9/79 variables, 5/56 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 1/57 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 4/61 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1/80 variables, 1/62 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/80 variables, 0/62 constraints. Problems are: Problem set: 17 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 0/80 variables, 0/62 constraints. Problems are: Problem set: 17 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 62 constraints, problems are : Problem set: 17 solved, 16 unsolved in 343 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: 16/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 623ms problems are : Problem set: 17 solved, 16 unsolved
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 10 properties in 31215 ms.
Support contains 10 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 20 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 32/34 places, 64/66 transitions.
RANDOM walk for 40003 steps (85 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (61 resets) in 46 ms. (851 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (61 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (71 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 289828 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :1 out of 6
Probabilistic random walk after 289828 steps, saw 195167 distinct states, run finished after 3023 ms. (steps per millisecond=95 ) properties seen :1
[2024-05-31 20:32:20] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2024-05-31 20:32:20] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 20:32:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/76 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/77 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 43 constraints, problems are : Problem set: 0 solved, 5 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/76 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/77 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 48 constraints, problems are : Problem set: 0 solved, 5 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 204ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 64/64 transitions.
RANDOM walk for 40056 steps (88 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (57 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (48 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (56 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (70 resets) in 69 ms. (571 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 294178 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :0 out of 5
Probabilistic random walk after 294178 steps, saw 198055 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-31 20:32:23] [INFO ] Invariant cache hit.
[2024-05-31 20:32:23] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 21/76 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/77 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 43 constraints, problems are : Problem set: 0 solved, 5 unsolved in 100 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 37/55 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 21/76 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/77 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 48 constraints, problems are : Problem set: 0 solved, 5 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 226ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 6 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-31 20:32:23] [INFO ] Invariant cache hit.
[2024-05-31 20:32:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-31 20:32:23] [INFO ] Invariant cache hit.
[2024-05-31 20:32:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-31 20:32:23] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-31 20:32:23] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-31 20:32:23] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2024-05-31 20:32:23] [INFO ] Invariant cache hit.
[2024-05-31 20:32:23] [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, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 45/77 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 43 constraints, problems are : Problem set: 0 solved, 62 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 45/77 variables, 32/35 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 62/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 105 constraints, problems are : Problem set: 0 solved, 62 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 1243ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 1244ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1341 ms. Remains : 32/32 places, 64/64 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 18 edges and 32 vertex of which 3 / 32 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 30 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 29 transition count 41
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 3 place count 29 transition count 38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 26 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 25 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 25 transition count 36
Applied a total of 12 rules in 18 ms. Remains 25 /32 variables (removed 7) and now considering 36/64 (removed 28) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 36 rows 25 cols
[2024-05-31 20:32:25] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 20:32:25] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-31 20:32:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 20:32:25] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 20:32:25] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-31 20:32:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 20:32:25] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-31 20:32:25] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-31 20:32:25] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-31 20:32:25] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 181 ms.
Successfully simplified 17 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:32:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:32:25] [INFO ] Input system was already deterministic with 66 transitions.
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.1 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.1 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 9 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 9 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Input system was already deterministic with 60 transitions.
RANDOM walk for 40018 steps (82 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 23470 steps (55 resets) in 80 ms. (289 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /34 variables (removed 2) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 32/34 places, 66/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 19975 steps (52 resets) in 45 ms. (434 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-a064-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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.1 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 7 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 8 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [INFO ] Input system was already deterministic with 60 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.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 31 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 31 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 31 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 31 transition count 60
Applied a total of 7 rules in 7 ms. Remains 31 /34 variables (removed 3) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 31/34 places, 60/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [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 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 2 ms. Remains : 31/34 places, 66/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [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 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 2 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 2 ms. Remains : 31/34 places, 62/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [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.1 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 7 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 8 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [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 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-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [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 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 2 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 2 ms. Remains : 31/34 places, 62/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [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.1 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 8 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 8 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 2 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 3 ms
[2024-05-31 20:32:25] [INFO ] Flatten gal took : 4 ms
[2024-05-31 20:32:25] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 20:32:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 3 ms.
Total runtime 44515 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2024-04
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2024-08
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2024-09
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2024-10
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2024-11
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2023-13
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2023-14
Could not compute solution for formula : FunctionPointer-PT-a064-CTLCardinality-2023-15
BK_STOP 1717187546108
--------------------
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
mcc2024
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/564/ctl_0_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/564/ctl_1_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/564/ctl_2_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/564/ctl_3_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/564/ctl_4_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/564/ctl_5_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/564/ctl_6_
ctl formula name FunctionPointer-PT-a064-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/564/ctl_7_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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-a064"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is FunctionPointer-PT-a064, 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 r496-tall-171640602900201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;