About the Execution of GreatSPN+red for Parking-PT-864
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13803.876 | 1408458.00 | 4681017.00 | 1421.30 | ??F????T???FTT?? | 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.r267-smll-171654405700097.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 Parking-PT-864, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700097
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-00
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-01
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-02
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-03
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-04
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-05
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-06
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-07
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-08
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-09
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-10
FORMULA_NAME Parking-PT-864-CTLCardinality-2024-11
FORMULA_NAME Parking-PT-864-CTLCardinality-2023-12
FORMULA_NAME Parking-PT-864-CTLCardinality-2023-13
FORMULA_NAME Parking-PT-864-CTLCardinality-2023-14
FORMULA_NAME Parking-PT-864-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716662028522
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:33:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 18:33:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:33:50] [INFO ] Load time of PNML (sax parser for PT used): 273 ms
[2024-05-25 18:33:50] [INFO ] Transformed 1185 places.
[2024-05-25 18:33:50] [INFO ] Transformed 1697 transitions.
[2024-05-25 18:33:50] [INFO ] Found NUPN structural information;
[2024-05-25 18:33:50] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 461 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Parking-PT-864-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 115 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1177 transition count 1001
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1177 transition count 1001
Applied a total of 16 rules in 250 ms. Remains 1177 /1185 variables (removed 8) and now considering 1001/1009 (removed 8) transitions.
// Phase 1: matrix 1001 rows 1177 cols
[2024-05-25 18:33:51] [INFO ] Computed 280 invariants in 64 ms
[2024-05-25 18:33:52] [INFO ] Implicit Places using invariants in 1457 ms returned [152, 160, 168, 184, 192, 200, 208, 240, 242, 285, 293, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 506, 508, 551, 559, 567, 575, 583, 599, 607, 639, 641, 684, 692, 700, 708, 716, 724, 732, 772, 774, 817, 825, 849, 857, 865, 873, 905, 907, 950, 958, 966, 974, 982, 990, 998, 1006, 1038, 1040, 1083, 1091, 1099, 1107, 1115, 1123, 1131, 1139, 1171, 1173]
Discarding 75 places :
Implicit Place search using SMT only with invariants took 1547 ms to find 75 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1102/1185 places, 1001/1009 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 1050 transition count 949
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 1050 transition count 949
Applied a total of 104 rules in 150 ms. Remains 1050 /1102 variables (removed 52) and now considering 949/1001 (removed 52) transitions.
// Phase 1: matrix 949 rows 1050 cols
[2024-05-25 18:33:53] [INFO ] Computed 205 invariants in 11 ms
[2024-05-25 18:33:53] [INFO ] Implicit Places using invariants in 703 ms returned []
[2024-05-25 18:33:53] [INFO ] Invariant cache hit.
[2024-05-25 18:33:54] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 18:33:56] [INFO ] Implicit Places using invariants and state equation in 2914 ms returned []
Implicit Place search using SMT with State Equation took 3621 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1050/1185 places, 949/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5597 ms. Remains : 1050/1185 places, 949/1009 transitions.
Support contains 115 out of 1050 places after structural reductions.
[2024-05-25 18:33:57] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 18:33:57] [INFO ] Flatten gal took : 180 ms
FORMULA Parking-PT-864-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 18:33:57] [INFO ] Flatten gal took : 96 ms
[2024-05-25 18:33:57] [INFO ] Input system was already deterministic with 949 transitions.
Support contains 98 out of 1050 places (down from 115) after GAL structural reductions.
RANDOM walk for 40000 steps (154 resets) in 4329 ms. (9 steps per ms) remains 14/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 14/14 properties
[2024-05-25 18:34:00] [INFO ] Invariant cache hit.
[2024-05-25 18:34:00] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 564/595 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 455/1050 variables, 186/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 949/1999 variables, 1050/1255 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1999 variables, 248/1503 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1999 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/1999 variables, 0/1503 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1999/1999 variables, and 1503 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2980 ms.
Refiners :[Positive P Invariants (semi-flows): 205/205 constraints, State Equation: 1050/1050 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 564/595 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 455/1050 variables, 186/205 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-25 18:34:04] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 23 ms to minimize.
[2024-05-25 18:34:04] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1050 variables, 2/207 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1050 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 949/1999 variables, 1050/1257 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1999 variables, 248/1505 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1999 variables, 14/1519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1999 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/1999 variables, 0/1519 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1999/1999 variables, and 1519 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4971 ms.
Refiners :[Positive P Invariants (semi-flows): 205/205 constraints, State Equation: 1050/1050 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 8039ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 7 properties in 21744 ms.
Support contains 19 out of 1050 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1050 transition count 918
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1019 transition count 918
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1019 transition count 886
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 126 place count 987 transition count 886
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 985 transition count 884
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 985 transition count 884
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 236 place count 932 transition count 831
Free-agglomeration rule applied 253 times.
Iterating global reduction 2 with 253 rules applied. Total rules applied 489 place count 932 transition count 578
Reduce places removed 253 places and 0 transitions.
Graph (complete) has 1367 edges and 679 vertex of which 600 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.3 ms
Discarding 79 places :
Also discarding 58 output transitions
Drop transitions (Output transitions of discarded places.) removed 58 transitions
Iterating post reduction 2 with 254 rules applied. Total rules applied 743 place count 600 transition count 520
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 757 place count 600 transition count 506
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 760 place count 600 transition count 503
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 763 place count 597 transition count 503
Applied a total of 763 rules in 533 ms. Remains 597 /1050 variables (removed 453) and now considering 503/949 (removed 446) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 533 ms. Remains : 597/1050 places, 503/949 transitions.
RANDOM walk for 40000 steps (8 resets) in 488 ms. (81 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
// Phase 1: matrix 503 rows 597 cols
[2024-05-25 18:34:30] [INFO ] Computed 185 invariants in 4 ms
[2024-05-25 18:34:30] [INFO ] State equation strengthened by 485 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 535/597 variables, 184/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 503/1100 variables, 597/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1100 variables, 485/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1100 variables, 0/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 1267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 515 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 597/597 constraints, ReadFeed: 485/485 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 535/597 variables, 184/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 503/1100 variables, 597/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1100 variables, 485/1267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1100 variables, 1/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1100 variables, 0/1268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 1268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 524 ms.
Refiners :[Positive P Invariants (semi-flows): 185/185 constraints, State Equation: 597/597 constraints, ReadFeed: 485/485 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1070ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 12 ms.
[2024-05-25 18:34:31] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 63 ms
[2024-05-25 18:34:32] [INFO ] Input system was already deterministic with 949 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1050 transition count 917
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1018 transition count 917
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1018 transition count 885
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 986 transition count 885
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 979 transition count 878
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 979 transition count 878
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 182 place count 959 transition count 858
Applied a total of 182 rules in 155 ms. Remains 959 /1050 variables (removed 91) and now considering 858/949 (removed 91) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 155 ms. Remains : 959/1050 places, 858/949 transitions.
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 45 ms
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 46 ms
[2024-05-25 18:34:32] [INFO ] Input system was already deterministic with 858 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1044 transition count 943
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1044 transition count 943
Applied a total of 12 rules in 54 ms. Remains 1044 /1050 variables (removed 6) and now considering 943/949 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1044/1050 places, 943/949 transitions.
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 45 ms
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 47 ms
[2024-05-25 18:34:32] [INFO ] Input system was already deterministic with 943 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1044 transition count 943
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1044 transition count 943
Applied a total of 12 rules in 54 ms. Remains 1044 /1050 variables (removed 6) and now considering 943/949 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1044/1050 places, 943/949 transitions.
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 39 ms
[2024-05-25 18:34:32] [INFO ] Flatten gal took : 41 ms
[2024-05-25 18:34:33] [INFO ] Input system was already deterministic with 943 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1043 transition count 942
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1043 transition count 942
Applied a total of 14 rules in 53 ms. Remains 1043 /1050 variables (removed 7) and now considering 942/949 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1043/1050 places, 942/949 transitions.
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 35 ms
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 39 ms
[2024-05-25 18:34:33] [INFO ] Input system was already deterministic with 942 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1050 transition count 918
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1019 transition count 918
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 62 place count 1019 transition count 886
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 126 place count 987 transition count 886
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 131 place count 982 transition count 881
Iterating global reduction 2 with 5 rules applied. Total rules applied 136 place count 982 transition count 881
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 176 place count 962 transition count 861
Applied a total of 176 rules in 139 ms. Remains 962 /1050 variables (removed 88) and now considering 861/949 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 140 ms. Remains : 962/1050 places, 861/949 transitions.
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 32 ms
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 33 ms
[2024-05-25 18:34:33] [INFO ] Input system was already deterministic with 861 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1043 transition count 942
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1043 transition count 942
Applied a total of 14 rules in 83 ms. Remains 1043 /1050 variables (removed 7) and now considering 942/949 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1043/1050 places, 942/949 transitions.
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 34 ms
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 39 ms
[2024-05-25 18:34:33] [INFO ] Input system was already deterministic with 942 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1049 transition count 916
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1017 transition count 916
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1017 transition count 884
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 985 transition count 884
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 978 transition count 877
Iterating global reduction 2 with 7 rules applied. Total rules applied 142 place count 978 transition count 877
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 184 place count 957 transition count 856
Applied a total of 184 rules in 123 ms. Remains 957 /1050 variables (removed 93) and now considering 856/949 (removed 93) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 125 ms. Remains : 957/1050 places, 856/949 transitions.
[2024-05-25 18:34:33] [INFO ] Flatten gal took : 23 ms
[2024-05-25 18:34:34] [INFO ] Flatten gal took : 26 ms
[2024-05-25 18:34:34] [INFO ] Input system was already deterministic with 856 transitions.
RANDOM walk for 40000 steps (155 resets) in 926 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 271395 steps, run timeout after 3001 ms. (steps per millisecond=90 ) properties seen :0 out of 1
Probabilistic random walk after 271395 steps, saw 96971 distinct states, run finished after 3009 ms. (steps per millisecond=90 ) properties seen :0
// Phase 1: matrix 856 rows 957 cols
[2024-05-25 18:34:37] [INFO ] Computed 205 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/154 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/226 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/226 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 226/1813 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 25/205 constraints, State Equation: 119/957 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 70/71 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 83/154 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/226 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 24/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/228 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/230 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/234 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/242 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 138/380 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/380 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/381 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 172/553 variables, 147/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/553 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/553 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 126/679 variables, 84/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/679 variables, 42/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/679 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/679 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 679/1813 variables, and 435 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 76/205 constraints, State Equation: 358/957 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 618ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
FORMULA Parking-PT-864-CTLCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1050 transition count 917
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1018 transition count 917
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1018 transition count 885
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 986 transition count 885
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 981 transition count 880
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 981 transition count 880
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 176 place count 962 transition count 861
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 962 transition count 861
Applied a total of 178 rules in 227 ms. Remains 962 /1050 variables (removed 88) and now considering 861/949 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 227 ms. Remains : 962/1050 places, 861/949 transitions.
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 34 ms
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 31 ms
[2024-05-25 18:34:38] [INFO ] Input system was already deterministic with 861 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1050 transition count 918
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 1019 transition count 917
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 1018 transition count 917
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 64 place count 1018 transition count 886
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 126 place count 987 transition count 886
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 133 place count 980 transition count 879
Iterating global reduction 3 with 7 rules applied. Total rules applied 140 place count 980 transition count 879
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 180 place count 960 transition count 859
Applied a total of 180 rules in 130 ms. Remains 960 /1050 variables (removed 90) and now considering 859/949 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 960/1050 places, 859/949 transitions.
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 27 ms
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 30 ms
[2024-05-25 18:34:38] [INFO ] Input system was already deterministic with 859 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1045 transition count 944
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1045 transition count 944
Applied a total of 10 rules in 53 ms. Remains 1045 /1050 variables (removed 5) and now considering 944/949 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 1045/1050 places, 944/949 transitions.
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:34:38] [INFO ] Flatten gal took : 33 ms
[2024-05-25 18:34:39] [INFO ] Input system was already deterministic with 944 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1043 transition count 942
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1043 transition count 942
Applied a total of 14 rules in 53 ms. Remains 1043 /1050 variables (removed 7) and now considering 942/949 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 1043/1050 places, 942/949 transitions.
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 43 ms
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 29 ms
[2024-05-25 18:34:39] [INFO ] Input system was already deterministic with 942 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1044 transition count 943
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1044 transition count 943
Applied a total of 12 rules in 53 ms. Remains 1044 /1050 variables (removed 6) and now considering 943/949 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1044/1050 places, 943/949 transitions.
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 26 ms
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:34:39] [INFO ] Input system was already deterministic with 943 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1050/1050 places, 949/949 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 1043 transition count 942
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 1043 transition count 942
Applied a total of 14 rules in 70 ms. Remains 1043 /1050 variables (removed 7) and now considering 942/949 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1043/1050 places, 942/949 transitions.
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 26 ms
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:34:39] [INFO ] Input system was already deterministic with 942 transitions.
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:34:39] [INFO ] Flatten gal took : 29 ms
[2024-05-25 18:34:39] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-25 18:34:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1050 places, 949 transitions and 3168 arcs took 10 ms.
Total runtime 49192 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Parking-PT-864
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1050
TRANSITIONS: 949
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.011s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.002s]
----------------------------------------------------------------------
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: 582
MODEL NAME: /home/mcc/execution/415/model
1050 places, 949 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Parking-PT-864-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Parking-PT-864-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2023-14 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLCardinality-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716663436980
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
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 Parking-PT-864, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r267-smll-171654405700097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 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 ;