fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r069-tall-171620504800593
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for CloudDeployment-PT-5b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9209.115 3600000.00 14057689.00 417.60 ??TF????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.r069-tall-171620504800593.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 CloudDeployment-PT-5b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800593
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-00
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-01
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-02
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-03
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-04
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-05
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-06
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-07
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-08
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-09
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-10
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2024-11
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-12
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-13
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-14
FORMULA_NAME CloudDeployment-PT-5b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716468138180

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:42:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 12:42:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:42:19] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-05-23 12:42:19] [INFO ] Transformed 1525 places.
[2024-05-23 12:42:19] [INFO ] Transformed 3132 transitions.
[2024-05-23 12:42:19] [INFO ] Found NUPN structural information;
[2024-05-23 12:42:19] [INFO ] Parsed PT model containing 1525 places and 3132 transitions and 24760 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA CloudDeployment-PT-5b-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5b-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 1525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1525/1525 places, 3132/3132 transitions.
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1519 transition count 3132
Discarding 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 397 place count 1128 transition count 1728
Iterating global reduction 1 with 391 rules applied. Total rules applied 788 place count 1128 transition count 1728
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 928 place count 988 transition count 1588
Iterating global reduction 1 with 140 rules applied. Total rules applied 1068 place count 988 transition count 1588
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1086 place count 988 transition count 1570
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 1099 place count 975 transition count 1557
Iterating global reduction 2 with 13 rules applied. Total rules applied 1112 place count 975 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1113 place count 974 transition count 1556
Iterating global reduction 2 with 1 rules applied. Total rules applied 1114 place count 974 transition count 1556
Applied a total of 1114 rules in 559 ms. Remains 974 /1525 variables (removed 551) and now considering 1556/3132 (removed 1576) transitions.
// Phase 1: matrix 1556 rows 974 cols
[2024-05-23 12:42:20] [INFO ] Computed 15 invariants in 32 ms
[2024-05-23 12:42:20] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 12:42:20] [INFO ] Invariant cache hit.
[2024-05-23 12:42:21] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1582 ms to find 0 implicit places.
Running 1555 sub problems to find dead transitions.
[2024-05-23 12:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/973 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/2530 variables, and 15 constraints, problems are : Problem set: 0 solved, 1555 unsolved in 30048 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/974 constraints, PredecessorRefiner: 1555/1555 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1555 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/973 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1555 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/973 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1555 unsolved
At refinement iteration 2 (OVERLAPS) 1556/2529 variables, 973/988 constraints. Problems are: Problem set: 0 solved, 1555 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2529 variables, 1555/2543 constraints. Problems are: Problem set: 0 solved, 1555 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2529/2530 variables, and 2543 constraints, problems are : Problem set: 0 solved, 1555 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 973/974 constraints, PredecessorRefiner: 1555/1555 constraints, Known Traps: 0/0 constraints]
After SMT, in 62692ms problems are : Problem set: 0 solved, 1555 unsolved
Search for dead transitions found 0 dead transitions in 62724ms
Starting structural reductions in LTL mode, iteration 1 : 974/1525 places, 1556/3132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64899 ms. Remains : 974/1525 places, 1556/3132 transitions.
Support contains 75 out of 974 places after structural reductions.
[2024-05-23 12:43:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 12:43:25] [INFO ] Flatten gal took : 162 ms
FORMULA CloudDeployment-PT-5b-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 12:43:25] [INFO ] Flatten gal took : 97 ms
[2024-05-23 12:43:25] [INFO ] Input system was already deterministic with 1556 transitions.
Support contains 61 out of 974 places (down from 75) after GAL structural reductions.
RANDOM walk for 40000 steps (245 resets) in 2342 ms. (17 steps per ms) remains 12/28 properties
BEST_FIRST walk for 40004 steps (32 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 145 ms. (274 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (28 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 77 ms. (512 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 209 ms. (190 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 97 ms. (408 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (30 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (31 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (29 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 37 ms. (1052 steps per ms) remains 11/11 properties
[2024-05-23 12:43:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 110/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 100/233 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 736/969 variables, 233/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 514/1483 variables, 221/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1483 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 446/1929 variables, 201/670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1929 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 385/2314 variables, 181/851 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2314 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 157/2471 variables, 102/953 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2471 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 43/2514 variables, 25/978 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2514 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 16/2530 variables, 11/989 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2530 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/2530 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 989 constraints, problems are : Problem set: 0 solved, 11 unsolved in 2793 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 974/974 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 110/133 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 100/233 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 736/969 variables, 233/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/969 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 514/1483 variables, 221/469 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1483 variables, 11/480 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1483 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 446/1929 variables, 201/681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1929 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 385/2314 variables, 181/862 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2314 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 157/2471 variables, 102/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2471 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 43/2514 variables, 25/989 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2514 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 16/2530 variables, 11/1000 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2530 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 20 (OVERLAPS) 0/2530 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 1000 constraints, problems are : Problem set: 0 solved, 11 unsolved in 4990 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 974/974 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 7806ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 8 properties in 6450 ms.
Support contains 5 out of 974 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 1008 edges and 974 vertex of which 357 / 974 are part of one of the 40 SCC in 5 ms
Free SCC test removed 317 places
Drop transitions (Empty/Sink Transition effects.) removed 404 transitions
Reduce isomorphic transitions removed 404 transitions.
Graph (complete) has 2402 edges and 657 vertex of which 639 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 639 transition count 857
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 572 place count 364 transition count 857
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 572 place count 364 transition count 807
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 672 place count 314 transition count 807
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 692 place count 294 transition count 787
Iterating global reduction 2 with 20 rules applied. Total rules applied 712 place count 294 transition count 787
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 712 place count 294 transition count 780
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 726 place count 287 transition count 780
Performed 83 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 892 place count 204 transition count 696
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 893 place count 204 transition count 695
Performed 34 Post agglomeration using F-continuation condition with reduction of 40 identical transitions.
Deduced a syphon composed of 34 places in 2 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 961 place count 170 transition count 898
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 3 with 35 rules applied. Total rules applied 996 place count 170 transition count 863
Drop transitions (Redundant composition of simpler transitions.) removed 156 transitions
Redundant transition composition rules discarded 156 transitions
Iterating global reduction 4 with 156 rules applied. Total rules applied 1152 place count 170 transition count 707
Free-agglomeration rule applied 51 times with reduction of 20 identical transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 1203 place count 170 transition count 636
Reduce places removed 51 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 140 transitions.
Iterating post reduction 4 with 191 rules applied. Total rules applied 1394 place count 119 transition count 496
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1398 place count 115 transition count 472
Iterating global reduction 5 with 4 rules applied. Total rules applied 1402 place count 115 transition count 472
Drop transitions (Redundant composition of simpler transitions.) removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 5 with 70 rules applied. Total rules applied 1472 place count 115 transition count 402
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1473 place count 115 transition count 402
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1474 place count 114 transition count 401
Applied a total of 1474 rules in 262 ms. Remains 114 /974 variables (removed 860) and now considering 401/1556 (removed 1155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 114/974 places, 401/1556 transitions.
RANDOM walk for 40000 steps (8 resets) in 414 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 290 ms. (137 steps per ms) remains 2/2 properties
[2024-05-23 12:43:41] [INFO ] Flow matrix only has 206 transitions (discarded 195 similar events)
// Phase 1: matrix 206 rows 114 cols
[2024-05-23 12:43:41] [INFO ] Computed 20 invariants in 1 ms
[2024-05-23 12:43:41] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/114 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 93/207 variables, 33/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 9/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 10/217 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/269 variables, 21/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/269 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/269 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 27/296 variables, 3/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/296 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 24/320 variables, 27/136 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/320 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/320 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 320/320 variables, and 141 constraints, problems are : Problem set: 0 solved, 2 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 114/114 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 30/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 82/114 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 93/207 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 9/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 12:43:41] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/217 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 52/269 variables, 21/107 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/269 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 12:43:41] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-05-23 12:43:42] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/269 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/269 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 27/296 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/296 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 24/320 variables, 27/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/320 variables, 5/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/320 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/320 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 320/320 variables, and 146 constraints, problems are : Problem set: 0 solved, 2 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 114/114 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 559ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 30 ms.
Support contains 1 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 401/401 transitions.
Graph (trivial) has 42 edges and 114 vertex of which 2 / 114 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 rules applied. Total rules applied 2 place count 113 transition count 398
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 112 transition count 398
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 111 transition count 397
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 110 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 110 transition count 391
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 109 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 109 transition count 389
Applied a total of 19 rules in 24 ms. Remains 109 /114 variables (removed 5) and now considering 389/401 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 109/114 places, 389/401 transitions.
RANDOM walk for 40000 steps (591 resets) in 485 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1321698 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1321698 steps, saw 194404 distinct states, run finished after 3005 ms. (steps per millisecond=439 ) properties seen :0
[2024-05-23 12:43:45] [INFO ] Flow matrix only has 194 transitions (discarded 195 similar events)
// Phase 1: matrix 194 rows 109 cols
[2024-05-23 12:43:45] [INFO ] Computed 20 invariants in 3 ms
[2024-05-23 12:43:45] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 106/159 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 10/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 9/168 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 67/235 variables, 25/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 36/271 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 12:43:45] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-23 12:43:45] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 32/303 variables, 36/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/53 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 106/159 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/168 variables, 5/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 67/235 variables, 25/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/235 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/235 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/235 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/271 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/271 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/303 variables, 36/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/303 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/303 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 389/389 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 109/109 places, 389/389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 389/389 transitions.
Applied a total of 0 rules in 6 ms. Remains 109 /109 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-05-23 12:43:45] [INFO ] Flow matrix only has 194 transitions (discarded 195 similar events)
[2024-05-23 12:43:45] [INFO ] Invariant cache hit.
[2024-05-23 12:43:45] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-23 12:43:45] [INFO ] Flow matrix only has 194 transitions (discarded 195 similar events)
[2024-05-23 12:43:45] [INFO ] Invariant cache hit.
[2024-05-23 12:43:45] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 12:43:45] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-23 12:43:46] [INFO ] Redundant transitions in 24 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-23 12:43:46] [INFO ] Flow matrix only has 194 transitions (discarded 195 similar events)
[2024-05-23 12:43:46] [INFO ] Invariant cache hit.
[2024-05-23 12:43:46] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (OVERLAPS) 5/109 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (OVERLAPS) 194/303 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 7/136 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-23 12:43:51] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 137 constraints, problems are : Problem set: 0 solved, 364 unsolved in 12949 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 5/109 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 194/303 variables, 109/130 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 364/501 constraints. Problems are: Problem set: 0 solved, 364 unsolved
[2024-05-23 12:44:04] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-23 12:44:04] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-05-23 12:44:04] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 3/504 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 504 constraints, problems are : Problem set: 0 solved, 364 unsolved in 20349 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 109/109 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 4/4 constraints]
After SMT, in 33682ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 33686ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33977 ms. Remains : 109/109 places, 389/389 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 109 edges and 109 vertex of which 40 / 109 are part of one of the 5 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 250 transitions.
Ensure Unique test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 65 transition count 128
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 32 place count 54 transition count 128
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 32 place count 54 transition count 120
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 48 place count 46 transition count 120
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 42 transition count 116
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 42 transition count 116
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 38 transition count 96
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 38 transition count 96
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 88 place count 38 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 32 transition count 66
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 110 place count 32 transition count 56
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 120 place count 27 transition count 76
Drop transitions (Redundant composition of simpler transitions.) removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 4 with 35 rules applied. Total rules applied 155 place count 27 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 167 place count 19 transition count 37
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 185 place count 19 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 186 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 187 place count 18 transition count 18
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 192 place count 18 transition count 18
Applied a total of 192 rules in 10 ms. Remains 18 /109 variables (removed 91) and now considering 18/389 (removed 371) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 18 cols
[2024-05-23 12:44:19] [INFO ] Computed 7 invariants in 0 ms
[2024-05-23 12:44:19] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:44:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 12:44:19] [INFO ] [Nat]Absence check using 1 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 12:44:19] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:44:19] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:44:19] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
[2024-05-23 12:44:19] [INFO ] Flatten gal took : 64 ms
[2024-05-23 12:44:19] [INFO ] Flatten gal took : 66 ms
[2024-05-23 12:44:20] [INFO ] Input system was already deterministic with 1556 transitions.
Computed a total of 152 stabilizing places and 492 stable transitions
Graph (complete) has 2944 edges and 974 vertex of which 956 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.25 ms
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 945 transition count 1527
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 945 transition count 1527
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 936 transition count 1518
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 936 transition count 1518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 936 transition count 1517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 935 transition count 1516
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 935 transition count 1516
Applied a total of 79 rules in 81 ms. Remains 935 /974 variables (removed 39) and now considering 1516/1556 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 935/974 places, 1516/1556 transitions.
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 49 ms
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 49 ms
[2024-05-23 12:44:20] [INFO ] Input system was already deterministic with 1516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 946 transition count 1528
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 946 transition count 1528
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 66 place count 936 transition count 1518
Iterating global reduction 0 with 10 rules applied. Total rules applied 76 place count 936 transition count 1518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 936 transition count 1517
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 935 transition count 1516
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 935 transition count 1516
Applied a total of 79 rules in 75 ms. Remains 935 /974 variables (removed 39) and now considering 1516/1556 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 935/974 places, 1516/1556 transitions.
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 46 ms
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 52 ms
[2024-05-23 12:44:20] [INFO ] Input system was already deterministic with 1516 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 1011 edges and 974 vertex of which 359 / 974 are part of one of the 40 SCC in 2 ms
Free SCC test removed 319 places
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Graph (complete) has 2523 edges and 655 vertex of which 637 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 636 transition count 917
Reduce places removed 271 places and 0 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 544 place count 365 transition count 917
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 544 place count 365 transition count 870
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 638 place count 318 transition count 870
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 652 place count 304 transition count 856
Iterating global reduction 2 with 14 rules applied. Total rules applied 666 place count 304 transition count 856
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 666 place count 304 transition count 854
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 670 place count 302 transition count 854
Performed 84 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 838 place count 218 transition count 769
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 839 place count 218 transition count 768
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 859 place count 218 transition count 748
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 869 place count 218 transition count 738
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 879 place count 208 transition count 738
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 889 place count 203 transition count 733
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 890 place count 202 transition count 732
Applied a total of 890 rules in 123 ms. Remains 202 /974 variables (removed 772) and now considering 732/1556 (removed 824) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 202/974 places, 732/1556 transitions.
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 28 ms
[2024-05-23 12:44:20] [INFO ] Flatten gal took : 28 ms
[2024-05-23 12:44:20] [INFO ] Input system was already deterministic with 732 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 1003 edges and 974 vertex of which 344 / 974 are part of one of the 38 SCC in 1 ms
Free SCC test removed 306 places
Ensure Unique test removed 350 transitions
Reduce isomorphic transitions removed 350 transitions.
Graph (complete) has 2544 edges and 668 vertex of which 650 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 277 place count 649 transition count 927
Reduce places removed 275 places and 0 transitions.
Iterating post reduction 1 with 275 rules applied. Total rules applied 552 place count 374 transition count 927
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 552 place count 374 transition count 880
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 646 place count 327 transition count 880
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 661 place count 312 transition count 865
Iterating global reduction 2 with 15 rules applied. Total rules applied 676 place count 312 transition count 865
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 676 place count 312 transition count 864
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 678 place count 311 transition count 864
Performed 87 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 852 place count 224 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 854 place count 224 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 873 place count 224 transition count 755
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 8 rules applied. Total rules applied 881 place count 224 transition count 747
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 890 place count 216 transition count 746
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 891 place count 215 transition count 746
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 901 place count 210 transition count 741
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 902 place count 210 transition count 741
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 903 place count 209 transition count 740
Applied a total of 903 rules in 117 ms. Remains 209 /974 variables (removed 765) and now considering 740/1556 (removed 816) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 118 ms. Remains : 209/974 places, 740/1556 transitions.
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 27 ms
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 28 ms
[2024-05-23 12:44:21] [INFO ] Input system was already deterministic with 740 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 945 transition count 1527
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 945 transition count 1527
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 66 place count 937 transition count 1519
Iterating global reduction 0 with 8 rules applied. Total rules applied 74 place count 937 transition count 1519
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 75 place count 937 transition count 1518
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 936 transition count 1517
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 936 transition count 1517
Applied a total of 77 rules in 83 ms. Remains 936 /974 variables (removed 38) and now considering 1517/1556 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 936/974 places, 1517/1556 transitions.
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 45 ms
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 48 ms
[2024-05-23 12:44:21] [INFO ] Input system was already deterministic with 1517 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 941 transition count 1523
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 941 transition count 1523
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 930 transition count 1512
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 930 transition count 1512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 929 transition count 1509
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 929 transition count 1509
Applied a total of 92 rules in 76 ms. Remains 929 /974 variables (removed 45) and now considering 1509/1556 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 929/974 places, 1509/1556 transitions.
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 44 ms
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 47 ms
[2024-05-23 12:44:21] [INFO ] Input system was already deterministic with 1509 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 942 transition count 1524
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 942 transition count 1524
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 75 place count 931 transition count 1513
Iterating global reduction 0 with 11 rules applied. Total rules applied 86 place count 931 transition count 1513
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 88 place count 931 transition count 1511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 930 transition count 1510
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 930 transition count 1510
Applied a total of 90 rules in 89 ms. Remains 930 /974 variables (removed 44) and now considering 1510/1556 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 930/974 places, 1510/1556 transitions.
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 44 ms
[2024-05-23 12:44:21] [INFO ] Flatten gal took : 46 ms
[2024-05-23 12:44:22] [INFO ] Input system was already deterministic with 1510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 1011 edges and 974 vertex of which 343 / 974 are part of one of the 39 SCC in 1 ms
Free SCC test removed 304 places
Ensure Unique test removed 346 transitions
Reduce isomorphic transitions removed 346 transitions.
Graph (complete) has 2541 edges and 670 vertex of which 652 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 279 place count 651 transition count 929
Reduce places removed 277 places and 0 transitions.
Iterating post reduction 1 with 277 rules applied. Total rules applied 556 place count 374 transition count 929
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 556 place count 374 transition count 881
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 652 place count 326 transition count 881
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 668 place count 310 transition count 865
Iterating global reduction 2 with 16 rules applied. Total rules applied 684 place count 310 transition count 865
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 684 place count 310 transition count 862
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 690 place count 307 transition count 862
Performed 86 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 862 place count 221 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 863 place count 221 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 884 place count 221 transition count 753
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 894 place count 221 transition count 743
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 904 place count 211 transition count 743
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 916 place count 205 transition count 737
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 917 place count 204 transition count 736
Applied a total of 917 rules in 95 ms. Remains 204 /974 variables (removed 770) and now considering 736/1556 (removed 820) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 204/974 places, 736/1556 transitions.
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 28 ms
[2024-05-23 12:44:22] [INFO ] Input system was already deterministic with 736 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 943 transition count 1525
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 943 transition count 1525
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 932 transition count 1514
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 932 transition count 1514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 86 place count 932 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 931 transition count 1511
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 931 transition count 1511
Applied a total of 88 rules in 75 ms. Remains 931 /974 variables (removed 43) and now considering 1511/1556 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 931/974 places, 1511/1556 transitions.
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 40 ms
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 43 ms
[2024-05-23 12:44:22] [INFO ] Input system was already deterministic with 1511 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 991 edges and 974 vertex of which 347 / 974 are part of one of the 40 SCC in 1 ms
Free SCC test removed 307 places
Ensure Unique test removed 349 transitions
Reduce isomorphic transitions removed 349 transitions.
Graph (complete) has 2542 edges and 667 vertex of which 649 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 648 transition count 941
Reduce places removed 262 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 267 rules applied. Total rules applied 531 place count 386 transition count 936
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 536 place count 381 transition count 936
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 536 place count 381 transition count 887
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 634 place count 332 transition count 887
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 647 place count 319 transition count 874
Iterating global reduction 3 with 13 rules applied. Total rules applied 660 place count 319 transition count 874
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 660 place count 319 transition count 872
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 664 place count 317 transition count 872
Performed 86 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 836 place count 231 transition count 785
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 837 place count 231 transition count 784
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 857 place count 231 transition count 764
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 10 rules applied. Total rules applied 867 place count 231 transition count 754
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 877 place count 221 transition count 754
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 887 place count 216 transition count 749
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 888 place count 216 transition count 749
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 889 place count 215 transition count 748
Applied a total of 889 rules in 115 ms. Remains 215 /974 variables (removed 759) and now considering 748/1556 (removed 808) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 116 ms. Remains : 215/974 places, 748/1556 transitions.
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 25 ms
[2024-05-23 12:44:22] [INFO ] Input system was already deterministic with 748 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 1013 edges and 974 vertex of which 359 / 974 are part of one of the 40 SCC in 1 ms
Free SCC test removed 319 places
Ensure Unique test removed 364 transitions
Reduce isomorphic transitions removed 364 transitions.
Graph (complete) has 2523 edges and 655 vertex of which 637 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 272 transitions
Trivial Post-agglo rules discarded 272 transitions
Performed 272 trivial Post agglomeration. Transition count delta: 272
Iterating post reduction 0 with 272 rules applied. Total rules applied 274 place count 636 transition count 916
Reduce places removed 272 places and 0 transitions.
Iterating post reduction 1 with 272 rules applied. Total rules applied 546 place count 364 transition count 916
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 546 place count 364 transition count 870
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 638 place count 318 transition count 870
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 653 place count 303 transition count 855
Iterating global reduction 2 with 15 rules applied. Total rules applied 668 place count 303 transition count 855
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 668 place count 303 transition count 853
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 672 place count 301 transition count 853
Performed 86 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 844 place count 215 transition count 766
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 845 place count 215 transition count 765
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 865 place count 215 transition count 745
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 10 rules applied. Total rules applied 875 place count 215 transition count 735
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 885 place count 205 transition count 735
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 895 place count 200 transition count 730
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 896 place count 199 transition count 729
Applied a total of 896 rules in 90 ms. Remains 199 /974 variables (removed 775) and now considering 729/1556 (removed 827) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 199/974 places, 729/1556 transitions.
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 22 ms
[2024-05-23 12:44:22] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:44:22] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in LTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 941 transition count 1523
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 941 transition count 1523
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 77 place count 930 transition count 1512
Iterating global reduction 0 with 11 rules applied. Total rules applied 88 place count 930 transition count 1512
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 90 place count 930 transition count 1510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 929 transition count 1509
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 929 transition count 1509
Applied a total of 92 rules in 74 ms. Remains 929 /974 variables (removed 45) and now considering 1509/1556 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 929/974 places, 1509/1556 transitions.
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 40 ms
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 43 ms
[2024-05-23 12:44:23] [INFO ] Input system was already deterministic with 1509 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 974/974 places, 1556/1556 transitions.
Graph (trivial) has 998 edges and 974 vertex of which 342 / 974 are part of one of the 39 SCC in 1 ms
Free SCC test removed 303 places
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Graph (complete) has 2551 edges and 671 vertex of which 653 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 652 transition count 938
Reduce places removed 269 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 277 rules applied. Total rules applied 548 place count 383 transition count 930
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 557 place count 375 transition count 929
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 557 place count 375 transition count 881
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 653 place count 327 transition count 881
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 669 place count 311 transition count 865
Iterating global reduction 3 with 16 rules applied. Total rules applied 685 place count 311 transition count 865
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 685 place count 311 transition count 863
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 689 place count 309 transition count 863
Performed 87 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 863 place count 222 transition count 775
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 864 place count 222 transition count 774
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 884 place count 222 transition count 754
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 9 rules applied. Total rules applied 893 place count 222 transition count 745
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 902 place count 213 transition count 745
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 914 place count 207 transition count 739
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 206 transition count 738
Applied a total of 915 rules in 102 ms. Remains 206 /974 variables (removed 768) and now considering 738/1556 (removed 818) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 102 ms. Remains : 206/974 places, 738/1556 transitions.
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 27 ms
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 29 ms
[2024-05-23 12:44:23] [INFO ] Input system was already deterministic with 738 transitions.
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 47 ms
[2024-05-23 12:44:23] [INFO ] Flatten gal took : 50 ms
[2024-05-23 12:44:23] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 12:44:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 974 places, 1556 transitions and 6226 arcs took 8 ms.
Total runtime 124294 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-5b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 974
TRANSITIONS: 1556
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.007s]


SAVING FILE /home/mcc/execution/413/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: 634
MODEL NAME: /home/mcc/execution/413/model
974 places, 1556 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.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-5b"
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 CloudDeployment-PT-5b, 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 r069-tall-171620504800593"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-5b.tgz
mv CloudDeployment-PT-5b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;