About the Execution of GreatSPN+red for FunctionPointer-PT-b002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
767.260 | 55607.00 | 79440.00 | 276.70 | ??F?F??F?FF?FTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601000217.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-b002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601000217
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 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 391K 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-b002-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b002-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716431355233
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-b002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:29:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:29:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:29:16] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-23 02:29:16] [INFO ] Transformed 306 places.
[2024-05-23 02:29:16] [INFO ] Transformed 840 transitions.
[2024-05-23 02:29:16] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 30 place count 192 transition count 504
Iterating global reduction 1 with 20 rules applied. Total rules applied 50 place count 192 transition count 504
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 68 place count 192 transition count 486
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 81 place count 179 transition count 460
Iterating global reduction 2 with 13 rules applied. Total rules applied 94 place count 179 transition count 460
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 179 transition count 456
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 178 transition count 454
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 178 transition count 454
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 177 transition count 450
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 177 transition count 450
Applied a total of 102 rules in 76 ms. Remains 177 /222 variables (removed 45) and now considering 450/648 (removed 198) transitions.
[2024-05-23 02:29:16] [INFO ] Flow matrix only has 308 transitions (discarded 142 similar events)
// Phase 1: matrix 308 rows 177 cols
[2024-05-23 02:29:16] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 02:29:17] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-23 02:29:17] [INFO ] Flow matrix only has 308 transitions (discarded 142 similar events)
[2024-05-23 02:29:17] [INFO ] Invariant cache hit.
[2024-05-23 02:29:17] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-05-23 02:29:17] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-05-23 02:29:17] [INFO ] Flow matrix only has 308 transitions (discarded 142 similar events)
[2024-05-23 02:29:17] [INFO ] Invariant cache hit.
[2024-05-23 02:29:17] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 308/485 variables, 177/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/485 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 239 constraints, problems are : Problem set: 0 solved, 448 unsolved in 18442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (OVERLAPS) 308/485 variables, 177/179 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 448/687 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 448 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 687 constraints, problems are : Problem set: 0 solved, 448 unsolved in 19932 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 0/0 constraints]
After SMT, in 39043ms problems are : Problem set: 0 solved, 448 unsolved
Search for dead transitions found 0 dead transitions in 39065ms
Starting structural reductions in LTL mode, iteration 1 : 177/222 places, 450/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39788 ms. Remains : 177/222 places, 450/648 transitions.
Support contains 42 out of 177 places after structural reductions.
[2024-05-23 02:29:56] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-23 02:29:56] [INFO ] Flatten gal took : 71 ms
FORMULA FunctionPointer-PT-b002-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b002-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:29:56] [INFO ] Flatten gal took : 26 ms
[2024-05-23 02:29:56] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 33 out of 177 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (79 resets) in 1390 ms. (28 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40004 steps (19 resets) in 114 ms. (347 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (22 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (13 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
[2024-05-23 02:29:57] [INFO ] Flow matrix only has 308 transitions (discarded 142 similar events)
[2024-05-23 02:29:57] [INFO ] Invariant cache hit.
[2024-05-23 02:29:57] [INFO ] State equation strengthened by 60 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 45/50 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/73 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/219 variables, 73/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 11/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 120/339 variables, 28/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 40/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 117/456 variables, 54/208 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 9/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/217 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 22/478 variables, 18/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/478 variables, 0/235 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 7/485 variables, 4/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/485 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/485 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 239 constraints, problems are : Problem set: 1 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/50 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/73 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 146/219 variables, 73/75 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 11/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/219 variables, 0/86 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 120/339 variables, 28/114 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 40/154 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 2/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 117/456 variables, 54/210 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 9/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/478 variables, 18/237 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/478 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 7/485 variables, 4/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/485 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/485 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 241 constraints, problems are : Problem set: 1 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 177/177 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 442ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 1 properties in 125 ms.
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 177/177 places, 450/450 transitions.
Graph (complete) has 713 edges and 177 vertex of which 153 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 153 transition count 402
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 138 transition count 372
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 138 transition count 372
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 93 place count 138 transition count 358
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 131 transition count 334
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 131 transition count 334
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 114 place count 124 transition count 318
Iterating global reduction 2 with 7 rules applied. Total rules applied 121 place count 124 transition count 318
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 117 transition count 292
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 117 transition count 292
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 142 place count 110 transition count 270
Iterating global reduction 2 with 7 rules applied. Total rules applied 149 place count 110 transition count 270
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 156 place count 103 transition count 252
Iterating global reduction 2 with 7 rules applied. Total rules applied 163 place count 103 transition count 252
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 97 transition count 236
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 97 transition count 236
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 91 transition count 224
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 91 transition count 224
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 192 place count 86 transition count 214
Iterating global reduction 2 with 5 rules applied. Total rules applied 197 place count 86 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 202 place count 81 transition count 204
Iterating global reduction 2 with 5 rules applied. Total rules applied 207 place count 81 transition count 204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 209 place count 79 transition count 200
Iterating global reduction 2 with 2 rules applied. Total rules applied 211 place count 79 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 213 place count 77 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 77 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 77 transition count 194
Applied a total of 217 rules in 58 ms. Remains 77 /177 variables (removed 100) and now considering 194/450 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 77/177 places, 194/450 transitions.
RANDOM walk for 40000 steps (8 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2022988 steps, run timeout after 3001 ms. (steps per millisecond=674 ) properties seen :0 out of 1
Probabilistic random walk after 2022988 steps, saw 1223545 distinct states, run finished after 3004 ms. (steps per millisecond=673 ) properties seen :0
[2024-05-23 02:30:01] [INFO ] Flow matrix only has 119 transitions (discarded 75 similar events)
// Phase 1: matrix 119 rows 77 cols
[2024-05-23 02:30:01] [INFO ] Computed 3 invariants in 2 ms
[2024-05-23 02:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 103/162 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/181 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/189 variables, 5/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/193 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/196 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/57 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/59 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 103/162 variables, 59/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/181 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/181 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/189 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/193 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/196 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/196 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/196 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 202ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 194/194 transitions.
Applied a total of 0 rules in 8 ms. Remains 77 /77 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 77/77 places, 194/194 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 194/194 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-23 02:30:01] [INFO ] Flow matrix only has 119 transitions (discarded 75 similar events)
[2024-05-23 02:30:01] [INFO ] Invariant cache hit.
[2024-05-23 02:30:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 02:30:01] [INFO ] Flow matrix only has 119 transitions (discarded 75 similar events)
[2024-05-23 02:30:01] [INFO ] Invariant cache hit.
[2024-05-23 02:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-23 02:30:01] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-23 02:30:01] [INFO ] Redundant transitions in 6 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-23 02:30:01] [INFO ] Flow matrix only has 119 transitions (discarded 75 similar events)
[2024-05-23 02:30:01] [INFO ] Invariant cache hit.
[2024-05-23 02:30:01] [INFO ] State equation strengthened by 18 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (OVERLAPS) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 98 constraints, problems are : Problem set: 0 solved, 192 unsolved in 2668 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 119/196 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 18/98 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 192/290 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 290 constraints, problems are : Problem set: 0 solved, 192 unsolved in 4169 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 77/77 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 6958ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 6961ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7142 ms. Remains : 77/77 places, 194/194 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 77 transition count 111
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 91 place count 69 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 69 transition count 99
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 115 place count 57 transition count 99
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 143 place count 43 transition count 85
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 150 place count 36 transition count 71
Iterating global reduction 2 with 7 rules applied. Total rules applied 157 place count 36 transition count 71
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 164 place count 29 transition count 57
Iterating global reduction 2 with 7 rules applied. Total rules applied 171 place count 29 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 178 place count 22 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 185 place count 22 transition count 43
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 190 place count 22 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 20 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 197 place count 20 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 198 place count 20 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 199 place count 20 transition count 35
Applied a total of 199 rules in 15 ms. Remains 20 /77 variables (removed 57) and now considering 35/194 (removed 159) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 35 rows 20 cols
[2024-05-23 02:30:08] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:30:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:08] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 02:30:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:30:08] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:30:08] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 02:30:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:30:08] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 02:30:08] [INFO ] After 1ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2024-05-23 02:30:08] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Over-approximation ignoring read arcs solved -1 properties in 95 ms.
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b002-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 28 ms
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 21 ms
[2024-05-23 02:30:08] [INFO ] Input system was already deterministic with 450 transitions.
Support contains 26 out of 177 places (down from 28) after GAL structural reductions.
Computed a total of 24 stabilizing places and 64 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 163 transition count 422
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 163 transition count 422
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 163 transition count 408
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 157 transition count 388
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 151 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 151 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 145 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 145 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 139 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 139 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 133 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 133 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 127 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 127 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 121 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 121 transition count 288
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 115 transition count 276
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 115 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 144 place count 109 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 150 place count 109 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 107 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 107 transition count 260
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 156 place count 105 transition count 256
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 105 transition count 256
Applied a total of 158 rules in 26 ms. Remains 105 /177 variables (removed 72) and now considering 256/450 (removed 194) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 105/177 places, 256/450 transitions.
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:30:08] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 163 transition count 422
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 163 transition count 422
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 163 transition count 408
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 157 transition count 388
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 151 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 151 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 145 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 145 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 139 transition count 334
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 139 transition count 334
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 133 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 133 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 108 place count 127 transition count 302
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 127 transition count 302
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 120 place count 121 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 126 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 111 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 109 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 109 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 107 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 107 transition count 262
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 158 place count 107 transition count 258
Applied a total of 158 rules in 57 ms. Remains 107 /177 variables (removed 70) and now considering 258/450 (removed 192) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 107/177 places, 258/450 transitions.
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:30:08] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 162 transition count 420
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 162 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 162 transition count 406
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 156 transition count 386
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 156 transition count 386
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 150 transition count 372
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 150 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 144 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 138 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 132 transition count 316
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 132 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 122 place count 120 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 128 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 110 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 108 transition count 264
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 108 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 106 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 160 place count 106 transition count 256
Applied a total of 160 rules in 53 ms. Remains 106 /177 variables (removed 71) and now considering 256/450 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 106/177 places, 256/450 transitions.
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:30:08] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 162 transition count 420
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 162 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 162 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 155 transition count 382
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 148 transition count 366
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 142 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 142 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 90 place count 136 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 136 transition count 322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 124 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 124 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 118 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 138 place count 112 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 144 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 150 place count 106 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 156 place count 106 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 104 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 102 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 102 transition count 246
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 166 place count 102 transition count 244
Applied a total of 166 rules in 46 ms. Remains 102 /177 variables (removed 75) and now considering 244/450 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 102/177 places, 244/450 transitions.
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 162 transition count 420
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 162 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 162 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 155 transition count 382
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 141 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 134 transition count 318
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 134 transition count 318
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 107 place count 127 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 114 place count 127 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 121 place count 120 transition count 282
Iterating global reduction 1 with 7 rules applied. Total rules applied 128 place count 120 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 114 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 114 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 109 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 150 place count 109 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 155 place count 104 transition count 250
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 104 transition count 250
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 102 transition count 246
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 102 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 166 place count 100 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 168 place count 100 transition count 242
Applied a total of 168 rules in 21 ms. Remains 100 /177 variables (removed 77) and now considering 242/450 (removed 208) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 100/177 places, 242/450 transitions.
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 169 transition count 432
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 163 transition count 412
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 163 transition count 412
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 157 transition count 398
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 157 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 151 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 151 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 145 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 145 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 139 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 139 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 133 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 133 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 128 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 128 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 123 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 123 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 112 place count 121 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 114 place count 121 transition count 302
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 116 place count 119 transition count 298
Iterating global reduction 1 with 2 rules applied. Total rules applied 118 place count 119 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 119 place count 118 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 120 place count 118 transition count 296
Applied a total of 120 rules in 22 ms. Remains 118 /177 variables (removed 59) and now considering 296/450 (removed 154) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 118/177 places, 296/450 transitions.
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 163 transition count 422
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 163 transition count 422
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 42 place count 163 transition count 408
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 157 transition count 388
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 157 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 151 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 151 transition count 376
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 70 place count 147 transition count 360
Iterating global reduction 1 with 4 rules applied. Total rules applied 74 place count 147 transition count 360
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 143 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 139 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 135 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 135 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 131 transition count 318
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 131 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 127 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 127 transition count 310
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 124 transition count 304
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 124 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 123 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 123 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 122 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 122 transition count 300
Applied a total of 124 rules in 22 ms. Remains 122 /177 variables (removed 55) and now considering 300/450 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 122/177 places, 300/450 transitions.
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 177/177 places, 450/450 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 162 transition count 420
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 162 transition count 420
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 44 place count 162 transition count 406
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 155 transition count 382
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 155 transition count 382
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 148 transition count 366
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 148 transition count 366
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 141 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 135 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 135 transition count 322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 129 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 123 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 123 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 128 place count 117 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 134 place count 117 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 139 place count 112 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 144 place count 112 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 107 transition count 258
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 107 transition count 258
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 156 place count 105 transition count 254
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 160 place count 103 transition count 250
Iterating global reduction 1 with 2 rules applied. Total rules applied 162 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 166 place count 103 transition count 246
Applied a total of 166 rules in 38 ms. Remains 103 /177 variables (removed 74) and now considering 246/450 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 103/177 places, 246/450 transitions.
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:30:09] [INFO ] Input system was already deterministic with 246 transitions.
RANDOM walk for 12454 steps (41 resets) in 60 ms. (204 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b002-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 14 ms
[2024-05-23 02:30:09] [INFO ] Flatten gal took : 15 ms
[2024-05-23 02:30:09] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-23 02:30:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 450 transitions and 1810 arcs took 5 ms.
Total runtime 53046 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running FunctionPointer-PT-b002
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: 177
TRANSITIONS: 450
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 592
MODEL NAME: /home/mcc/execution/412/model
177 places, 450 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.
Start RS construction.
Start RS construction.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716431410840
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b002"
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-b002, 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-171640601000217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b002.tgz
mv FunctionPointer-PT-b002 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 ;