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 |
| 12430.596 | 1583841.00 | 5911902.00 | 1014.30 | ?T?????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405700098.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405700098
=====================================================================
--------------------
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-CTLFireability-2024-00
FORMULA_NAME Parking-PT-864-CTLFireability-2024-01
FORMULA_NAME Parking-PT-864-CTLFireability-2024-02
FORMULA_NAME Parking-PT-864-CTLFireability-2024-03
FORMULA_NAME Parking-PT-864-CTLFireability-2024-04
FORMULA_NAME Parking-PT-864-CTLFireability-2024-05
FORMULA_NAME Parking-PT-864-CTLFireability-2024-06
FORMULA_NAME Parking-PT-864-CTLFireability-2024-07
FORMULA_NAME Parking-PT-864-CTLFireability-2024-08
FORMULA_NAME Parking-PT-864-CTLFireability-2024-09
FORMULA_NAME Parking-PT-864-CTLFireability-2024-10
FORMULA_NAME Parking-PT-864-CTLFireability-2024-11
FORMULA_NAME Parking-PT-864-CTLFireability-2023-12
FORMULA_NAME Parking-PT-864-CTLFireability-2023-13
FORMULA_NAME Parking-PT-864-CTLFireability-2023-14
FORMULA_NAME Parking-PT-864-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716662171095
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
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:36:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 18:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:36:13] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-05-25 18:36:13] [INFO ] Transformed 1185 places.
[2024-05-25 18:36:13] [INFO ] Transformed 1697 transitions.
[2024-05-25 18:36:13] [INFO ] Found NUPN structural information;
[2024-05-25 18:36:13] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 611 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 97 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Support contains 179 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1179 transition count 1003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1179 transition count 1003
Applied a total of 12 rules in 269 ms. Remains 1179 /1185 variables (removed 6) and now considering 1003/1009 (removed 6) transitions.
// Phase 1: matrix 1003 rows 1179 cols
[2024-05-25 18:36:14] [INFO ] Computed 280 invariants in 63 ms
[2024-05-25 18:36:15] [INFO ] Implicit Places using invariants in 1836 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 685, 693, 701, 709, 717, 725, 733, 741, 773, 775, 818, 826, 834, 842, 850, 858, 874, 906, 908, 976, 992, 1000, 1008, 1040, 1042, 1085, 1109, 1117, 1125, 1133, 1141, 1173, 1175]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1889 ms to find 70 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1109/1185 places, 1003/1009 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1055 transition count 949
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1055 transition count 949
Applied a total of 108 rules in 150 ms. Remains 1055 /1109 variables (removed 54) and now considering 949/1003 (removed 54) transitions.
// Phase 1: matrix 949 rows 1055 cols
[2024-05-25 18:36:16] [INFO ] Computed 210 invariants in 10 ms
[2024-05-25 18:36:16] [INFO ] Implicit Places using invariants in 786 ms returned []
[2024-05-25 18:36:16] [INFO ] Invariant cache hit.
[2024-05-25 18:36:17] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-05-25 18:36:20] [INFO ] Implicit Places using invariants and state equation in 3623 ms returned []
Implicit Place search using SMT with State Equation took 4414 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1055/1185 places, 949/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6752 ms. Remains : 1055/1185 places, 949/1009 transitions.
Support contains 179 out of 1055 places after structural reductions.
[2024-05-25 18:36:21] [INFO ] Flatten gal took : 188 ms
[2024-05-25 18:36:21] [INFO ] Flatten gal took : 121 ms
[2024-05-25 18:36:21] [INFO ] Input system was already deterministic with 949 transitions.
RANDOM walk for 40000 steps (156 resets) in 4887 ms. (8 steps per ms) remains 22/102 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 22/22 properties
[2024-05-25 18:36:23] [INFO ] Invariant cache hit.
[2024-05-25 18:36:23] [INFO ] State equation strengthened by 248 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (OVERLAPS) 656/707 variables, 35/35 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/707 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 348/1055 variables, 175/210 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 0/210 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 949/2004 variables, 1055/1265 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2004 variables, 248/1513 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2004 variables, 0/1513 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/2004 variables, 0/1513 constraints. Problems are: Problem set: 2 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2004/2004 variables, and 1513 constraints, problems are : Problem set: 2 solved, 20 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 1055/1055 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 659/702 variables, 32/32 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-25 18:36:28] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 26 ms to minimize.
[2024-05-25 18:36:28] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/702 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/702 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 353/1055 variables, 178/212 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 949/2004 variables, 1055/1267 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2004 variables, 248/1515 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2004 variables, 20/1535 constraints. Problems are: Problem set: 2 solved, 20 unsolved
[2024-05-25 18:36:31] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 2 ms to minimize.
[2024-05-25 18:36:32] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2004/2004 variables, and 1537 constraints, problems are : Problem set: 2 solved, 20 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 1055/1055 constraints, ReadFeed: 248/248 constraints, PredecessorRefiner: 20/22 constraints, Known Traps: 4/4 constraints]
After SMT, in 9660ms problems are : Problem set: 2 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 43 out of 1055 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1055 transition count 921
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 1027 transition count 921
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 56 place count 1027 transition count 891
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 116 place count 997 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 995 transition count 889
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 995 transition count 889
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 224 place count 943 transition count 837
Free-agglomeration rule applied 226 times.
Iterating global reduction 2 with 226 rules applied. Total rules applied 450 place count 943 transition count 611
Reduce places removed 226 places and 0 transitions.
Iterating post reduction 2 with 226 rules applied. Total rules applied 676 place count 717 transition count 611
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 684 place count 717 transition count 603
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 692 place count 709 transition count 603
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 693 place count 709 transition count 603
Applied a total of 693 rules in 399 ms. Remains 709 /1055 variables (removed 346) and now considering 603/949 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 399 ms. Remains : 709/1055 places, 603/949 transitions.
RANDOM walk for 40000 steps (118 resets) in 1218 ms. (32 steps per ms) remains 9/20 properties
BEST_FIRST walk for 40003 steps (11 resets) in 265 ms. (150 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 375 ms. (106 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 344 ms. (115 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (10 resets) in 311 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 335 ms. (119 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 243 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 234 ms. (170 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 261 ms. (152 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 246 ms. (161 steps per ms) remains 5/5 properties
// Phase 1: matrix 603 rows 709 cols
[2024-05-25 18:36:34] [INFO ] Computed 210 invariants in 5 ms
[2024-05-25 18:36:34] [INFO ] State equation strengthened by 505 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 130/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 568/709 variables, 201/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 603/1312 variables, 709/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 505/1424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1312 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1424 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 709/709 constraints, ReadFeed: 505/505 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 130/141 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 568/709 variables, 201/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 603/1312 variables, 709/919 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 505/1424 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 5/1429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1312 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1312 variables, 0/1429 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 1429 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1904 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 709/709 constraints, ReadFeed: 505/505 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 3559ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 1031 ms.
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 603/603 transitions.
Graph (complete) has 1471 edges and 709 vertex of which 277 are kept as prefixes of interest. Removing 432 places using SCC suffix rule.3 ms
Discarding 432 places :
Also discarding 348 output transitions
Drop transitions (Output transitions of discarded places.) removed 348 transitions
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 277 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 276 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 33 place count 276 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 273 transition count 221
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 271 transition count 219
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 271 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 55 place count 265 transition count 213
Applied a total of 55 rules in 77 ms. Remains 265 /709 variables (removed 444) and now considering 213/603 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 265/709 places, 213/603 transitions.
RANDOM walk for 1476 steps (0 resets) in 17 ms. (82 steps per ms) remains 0/2 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-25 18:36:39] [INFO ] Flatten gal took : 75 ms
[2024-05-25 18:36:39] [INFO ] Flatten gal took : 66 ms
[2024-05-25 18:36:39] [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 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1055 transition count 919
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 1025 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1024 transition count 918
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 62 place count 1024 transition count 888
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 122 place count 994 transition count 888
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 991 transition count 885
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 991 transition count 885
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 172 place count 969 transition count 863
Applied a total of 172 rules in 263 ms. Remains 969 /1055 variables (removed 86) and now considering 863/949 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 264 ms. Remains : 969/1055 places, 863/949 transitions.
[2024-05-25 18:36:39] [INFO ] Flatten gal took : 43 ms
[2024-05-25 18:36:39] [INFO ] Flatten gal took : 46 ms
[2024-05-25 18:36:40] [INFO ] Input system was already deterministic with 863 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 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 1055 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 1023 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 1023 transition count 885
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 991 transition count 885
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 988 transition count 882
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 988 transition count 882
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 180 place count 965 transition count 859
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 965 transition count 859
Applied a total of 181 rules in 307 ms. Remains 965 /1055 variables (removed 90) and now considering 859/949 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 307 ms. Remains : 965/1055 places, 859/949 transitions.
[2024-05-25 18:36:40] [INFO ] Flatten gal took : 43 ms
[2024-05-25 18:36:40] [INFO ] Flatten gal took : 51 ms
[2024-05-25 18:36:40] [INFO ] Input system was already deterministic with 859 transitions.
RANDOM walk for 40000 steps (154 resets) in 914 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 258200 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :0 out of 1
Probabilistic random walk after 258200 steps, saw 95487 distinct states, run finished after 3007 ms. (steps per millisecond=85 ) properties seen :0
// Phase 1: matrix 859 rows 965 cols
[2024-05-25 18:36:43] [INFO ] Computed 210 invariants in 5 ms
[2024-05-25 18:36:43] [INFO ] State equation strengthened by 313 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) 72/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/965 variables, 208/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/965 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 859/1824 variables, 965/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1824 variables, 313/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1824 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1824 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1824/1824 variables, and 1488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 965/965 constraints, ReadFeed: 313/313 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) 72/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/965 variables, 208/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/965 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 859/1824 variables, 965/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1824 variables, 313/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1824 variables, 1/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1824 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1824 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1824/1824 variables, and 1489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 965/965 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1629ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1432 steps, including 6 resets, run visited all 1 properties in 29 ms. (steps per millisecond=49 )
FORMULA Parking-PT-864-CTLFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 37 ms.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 69 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-05-25 18:36:45] [INFO ] Flatten gal took : 46 ms
[2024-05-25 18:36:45] [INFO ] Flatten gal took : 50 ms
[2024-05-25 18:36:45] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 58 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:45] [INFO ] Flatten gal took : 46 ms
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 43 ms
[2024-05-25 18:36:46] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 64 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 40 ms
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 42 ms
[2024-05-25 18:36:46] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 60 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 38 ms
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 41 ms
[2024-05-25 18:36:46] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 77 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 39 ms
[2024-05-25 18:36:46] [INFO ] Flatten gal took : 40 ms
[2024-05-25 18:36:46] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 60 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 37 ms
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 40 ms
[2024-05-25 18:36:47] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Reduce places removed 1 places and 1 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 1054 transition count 917
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1023 transition count 917
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1023 transition count 886
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 992 transition count 886
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 989 transition count 883
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 989 transition count 883
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 176 place count 966 transition count 860
Applied a total of 176 rules in 130 ms. Remains 966 /1055 variables (removed 89) and now considering 860/949 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 130 ms. Remains : 966/1055 places, 860/949 transitions.
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 31 ms
[2024-05-25 18:36:47] [INFO ] Input system was already deterministic with 860 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 56 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 37 ms
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 40 ms
[2024-05-25 18:36:47] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 56 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 34 ms
[2024-05-25 18:36:47] [INFO ] Flatten gal took : 38 ms
[2024-05-25 18:36:47] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 72 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 39 ms
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 42 ms
[2024-05-25 18:36:48] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1055 transition count 920
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1026 transition count 920
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 58 place count 1026 transition count 891
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 116 place count 997 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 995 transition count 889
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 995 transition count 889
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 164 place count 973 transition count 867
Applied a total of 164 rules in 118 ms. Remains 973 /1055 variables (removed 82) and now considering 867/949 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 120 ms. Remains : 973/1055 places, 867/949 transitions.
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 29 ms
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 31 ms
[2024-05-25 18:36:48] [INFO ] Input system was already deterministic with 867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 56 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 30 ms
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 31 ms
[2024-05-25 18:36:48] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 55 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 28 ms
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 33 ms
[2024-05-25 18:36:48] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 56 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 32 ms
[2024-05-25 18:36:48] [INFO ] Flatten gal took : 36 ms
[2024-05-25 18:36:49] [INFO ] Input system was already deterministic with 946 transitions.
[2024-05-25 18:36:49] [INFO ] Flatten gal took : 35 ms
[2024-05-25 18:36:49] [INFO ] Flatten gal took : 37 ms
[2024-05-25 18:36:49] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-05-25 18:36:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1055 places, 949 transitions and 3192 arcs took 14 ms.
Total runtime 36184 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: 1055
TRANSITIONS: 949
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.003s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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/415/model
1055 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-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-03 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA Parking-PT-864-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716663754936
--------------------
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 CTLFireability -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
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="CTLFireability"
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 CTLFireability"
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-171654405700098"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;