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-171620504800578.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-4b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 15:42 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 591K 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-4b-CTLFireability-2024-00
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-01
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-02
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-03
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-04
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-05
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-06
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-07
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-08
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-09
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-10
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-11
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716466729042

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:18:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 12:18:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:18:50] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-23 12:18:50] [INFO ] Transformed 1182 places.
[2024-05-23 12:18:50] [INFO ] Transformed 1824 transitions.
[2024-05-23 12:18:50] [INFO ] Found NUPN structural information;
[2024-05-23 12:18:50] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 104 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1824
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 286 place count 896 transition count 1542
Iterating global reduction 1 with 282 rules applied. Total rules applied 568 place count 896 transition count 1542
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 673 place count 791 transition count 1437
Iterating global reduction 1 with 105 rules applied. Total rules applied 778 place count 791 transition count 1437
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 788 place count 791 transition count 1427
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 799 place count 780 transition count 1416
Iterating global reduction 2 with 11 rules applied. Total rules applied 810 place count 780 transition count 1416
Applied a total of 810 rules in 275 ms. Remains 780 /1182 variables (removed 402) and now considering 1416/1824 (removed 408) transitions.
// Phase 1: matrix 1416 rows 780 cols
[2024-05-23 12:18:50] [INFO ] Computed 13 invariants in 35 ms
[2024-05-23 12:18:51] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 12:18:51] [INFO ] Invariant cache hit.
[2024-05-23 12:18:51] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
Running 1415 sub problems to find dead transitions.
[2024-05-23 12:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/2196 variables, and 13 constraints, problems are : Problem set: 0 solved, 1415 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/780 constraints, PredecessorRefiner: 1415/1415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 2 (OVERLAPS) 1416/2195 variables, 779/792 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2195 variables, 1415/2207 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2195/2196 variables, and 2207 constraints, problems are : Problem set: 0 solved, 1415 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 779/780 constraints, PredecessorRefiner: 1415/1415 constraints, Known Traps: 0/0 constraints]
After SMT, in 63438ms problems are : Problem set: 0 solved, 1415 unsolved
Search for dead transitions found 0 dead transitions in 63560ms
Starting structural reductions in LTL mode, iteration 1 : 780/1182 places, 1416/1824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64972 ms. Remains : 780/1182 places, 1416/1824 transitions.
Support contains 104 out of 780 places after structural reductions.
[2024-05-23 12:19:55] [INFO ] Flatten gal took : 202 ms
[2024-05-23 12:19:56] [INFO ] Flatten gal took : 133 ms
[2024-05-23 12:19:56] [INFO ] Input system was already deterministic with 1416 transitions.
RANDOM walk for 40000 steps (313 resets) in 2104 ms. (19 steps per ms) remains 36/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
[2024-05-23 12:19:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 140/210 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 806/1016 variables, 210/223 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1016 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (OVERLAPS) 476/1492 variables, 203/426 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1492 variables, 0/426 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 378/1870 variables, 177/603 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1870 variables, 0/603 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 249/2119 variables, 136/739 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2119 variables, 0/739 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 64/2183 variables, 45/784 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2183 variables, 0/784 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 12/2195 variables, 8/792 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2195 variables, 0/792 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 1/2196 variables, 1/793 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2196 variables, 0/793 constraints. Problems are: Problem set: 10 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 793 constraints, problems are : Problem set: 10 solved, 26 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 153/208 variables, 12/13 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 804/1012 variables, 208/221 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1012 variables, 1/222 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1012 variables, 0/222 constraints. Problems are: Problem set: 10 solved, 26 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 7 (OVERLAPS) 473/1485 variables, 202/424 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1485 variables, 24/448 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1485 variables, 0/448 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 375/1860 variables, 176/624 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1860 variables, 0/624 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 249/2109 variables, 135/759 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2109 variables, 0/759 constraints. Problems are: Problem set: 11 solved, 25 unsolved
SMT process timed out in 10251ms, After SMT, problems are : Problem set: 11 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 706 edges and 780 vertex of which 189 / 780 are part of one of the 22 SCC in 5 ms
Free SCC test removed 167 places
Drop transitions (Empty/Sink Transition effects.) removed 468 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 470 transitions.
Graph (complete) has 1950 edges and 613 vertex of which 589 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 208 transitions
Trivial Post-agglo rules discarded 208 transitions
Performed 208 trivial Post agglomeration. Transition count delta: 208
Iterating post reduction 0 with 214 rules applied. Total rules applied 216 place count 589 transition count 732
Reduce places removed 208 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 234 rules applied. Total rules applied 450 place count 381 transition count 706
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 474 place count 358 transition count 705
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 474 place count 358 transition count 652
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 580 place count 305 transition count 652
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 590 place count 295 transition count 642
Iterating global reduction 3 with 10 rules applied. Total rules applied 600 place count 295 transition count 642
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 600 place count 295 transition count 636
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 612 place count 289 transition count 636
Performed 73 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 758 place count 216 transition count 562
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 759 place count 216 transition count 561
Performed 32 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 823 place count 184 transition count 746
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 838 place count 184 transition count 731
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 840 place count 183 transition count 745
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 843 place count 183 transition count 742
Drop transitions (Redundant composition of simpler transitions.) removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 6 with 46 rules applied. Total rules applied 889 place count 183 transition count 696
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 6 with 2 rules applied. Total rules applied 891 place count 182 transition count 695
Free-agglomeration rule applied 21 times.
Iterating global reduction 6 with 21 rules applied. Total rules applied 912 place count 182 transition count 674
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 6 with 37 rules applied. Total rules applied 949 place count 161 transition count 658
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 952 place count 161 transition count 655
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 959 place count 161 transition count 655
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 965 place count 161 transition count 649
Applied a total of 965 rules in 230 ms. Remains 161 /780 variables (removed 619) and now considering 649/1416 (removed 767) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 161/780 places, 649/1416 transitions.
RANDOM walk for 40000 steps (732 resets) in 1137 ms. (35 steps per ms) remains 9/25 properties
BEST_FIRST walk for 40004 steps (67 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 72 ms. (548 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 89 ms. (444 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (67 resets) in 50 ms. (784 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (68 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 43 ms. (909 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (57 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
[2024-05-23 12:20:08] [INFO ] Flow matrix only has 554 transitions (discarded 95 similar events)
// Phase 1: matrix 554 rows 161 cols
[2024-05-23 12:20:08] [INFO ] Computed 6 invariants in 10 ms
[2024-05-23 12:20:08] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/78 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 461/539 variables, 78/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 145/684 variables, 65/159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/684 variables, 64/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/684 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 28/712 variables, 16/239 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 4/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/712 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 3/715 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/715 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/715 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 715/715 variables, and 245 constraints, problems are : Problem set: 0 solved, 9 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 37/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 23/78 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 12:20:09] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 461/539 variables, 78/85 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/539 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 145/684 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/684 variables, 64/226 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/684 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/684 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 28/712 variables, 16/244 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/712 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/712 variables, 5/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/712 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 3/715 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 0/715 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 715/715 variables, and 255 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1923 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 161/161 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 2731ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 4 properties in 1539 ms.
Support contains 12 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 649/649 transitions.
Graph (trivial) has 105 edges and 161 vertex of which 28 / 161 are part of one of the 12 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 43 transitions.
Graph (complete) has 1027 edges and 145 vertex of which 144 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 144 transition count 599
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 138 transition count 599
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 15 place count 138 transition count 596
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 135 transition count 596
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 133 transition count 589
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 133 transition count 589
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 127 transition count 583
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 127 transition count 580
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 123 transition count 603
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 64 place count 123 transition count 587
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 4 with 90 rules applied. Total rules applied 154 place count 123 transition count 497
Free-agglomeration rule applied 13 times with reduction of 2 identical transitions.
Iterating global reduction 4 with 13 rules applied. Total rules applied 167 place count 123 transition count 482
Reduce places removed 13 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 203 place count 110 transition count 459
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 204 place count 109 transition count 454
Iterating global reduction 5 with 1 rules applied. Total rules applied 205 place count 109 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 5 with 24 rules applied. Total rules applied 229 place count 109 transition count 430
Applied a total of 229 rules in 104 ms. Remains 109 /161 variables (removed 52) and now considering 430/649 (removed 219) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 109/161 places, 430/649 transitions.
RANDOM walk for 40000 steps (547 resets) in 415 ms. (96 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (33 resets) in 50 ms. (784 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (66 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (36 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (37 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
[2024-05-23 12:20:13] [INFO ] Flow matrix only has 292 transitions (discarded 138 similar events)
// Phase 1: matrix 292 rows 109 cols
[2024-05-23 12:20:13] [INFO ] Computed 12 invariants in 1 ms
[2024-05-23 12:20:13] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 27/97 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 283/380 variables, 97/109 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 74/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 21/401 variables, 12/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 38/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/401 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 233 constraints, problems are : Problem set: 0 solved, 4 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/57 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/70 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 27/97 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 12:20:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 283/380 variables, 97/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 74/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 21/401 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 38/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/401 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/401 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 238 constraints, problems are : Problem set: 0 solved, 4 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 714ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 339 ms.
Support contains 9 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 430/430 transitions.
Graph (trivial) has 37 edges and 109 vertex of which 2 / 109 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 108 transition count 427
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 427
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 7 place count 105 transition count 425
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 11 place count 103 transition count 443
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 103 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 29 place count 103 transition count 425
Applied a total of 29 rules in 36 ms. Remains 103 /109 variables (removed 6) and now considering 425/430 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 103/109 places, 425/430 transitions.
RANDOM walk for 40000 steps (547 resets) in 218 ms. (182 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 44 ms. (888 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (33 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (34 resets) in 31 ms. (1250 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1043265 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 3
Probabilistic random walk after 1043265 steps, saw 127940 distinct states, run finished after 3005 ms. (steps per millisecond=347 ) properties seen :0
[2024-05-23 12:20:17] [INFO ] Flow matrix only has 279 transitions (discarded 146 similar events)
// Phase 1: matrix 279 rows 103 cols
[2024-05-23 12:20:17] [INFO ] Computed 12 invariants in 2 ms
[2024-05-23 12:20:17] [INFO ] State equation strengthened by 103 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/91 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 270/361 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 65/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 21/382 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 38/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 218 constraints, problems are : Problem set: 0 solved, 3 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 30/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 27/91 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 270/361 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 65/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 21/382 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 38/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 221 constraints, problems are : Problem set: 0 solved, 3 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 103/103 constraints, ReadFeed: 103/103 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 550ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 127 ms.
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 425/425 transitions.
Graph (trivial) has 38 edges and 103 vertex of which 4 / 103 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 101 transition count 389
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 101 transition count 384
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 60 place count 96 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 94 transition count 353
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 94 transition count 353
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 94 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 94 transition count 339
Applied a total of 78 rules in 39 ms. Remains 94 /103 variables (removed 9) and now considering 339/425 (removed 86) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 94/103 places, 339/425 transitions.
RANDOM walk for 40000 steps (720 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (51 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (50 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 984779 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :0 out of 2
Probabilistic random walk after 984779 steps, saw 139122 distinct states, run finished after 3001 ms. (steps per millisecond=328 ) properties seen :0
[2024-05-23 12:20:21] [INFO ] Flow matrix only has 200 transitions (discarded 139 similar events)
// Phase 1: matrix 200 rows 94 cols
[2024-05-23 12:20:21] [INFO ] Computed 14 invariants in 3 ms
[2024-05-23 12:20:21] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/90 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/289 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 88/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/294 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 17/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/294 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 213 constraints, problems are : Problem set: 0 solved, 2 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 105/105 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 40/61 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/90 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 199/289 variables, 90/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 88/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/294 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 17/213 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 87 ms.
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 339/339 transitions.
Applied a total of 0 rules in 12 ms. Remains 94 /94 variables (removed 0) and now considering 339/339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 94/94 places, 339/339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 94/94 places, 339/339 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 339/339 (removed 0) transitions.
[2024-05-23 12:20:21] [INFO ] Flow matrix only has 200 transitions (discarded 139 similar events)
[2024-05-23 12:20:21] [INFO ] Invariant cache hit.
[2024-05-23 12:20:21] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 12:20:21] [INFO ] Flow matrix only has 200 transitions (discarded 139 similar events)
[2024-05-23 12:20:21] [INFO ] Invariant cache hit.
[2024-05-23 12:20:21] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-05-23 12:20:21] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-23 12:20:22] [INFO ] Redundant transitions in 141 ms returned []
Running 338 sub problems to find dead transitions.
[2024-05-23 12:20:22] [INFO ] Flow matrix only has 200 transitions (discarded 139 similar events)
[2024-05-23 12:20:22] [INFO ] Invariant cache hit.
[2024-05-23 12:20:22] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 200/294 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 105/213 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 213 constraints, problems are : Problem set: 0 solved, 338 unsolved in 8846 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 1/94 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (OVERLAPS) 200/294 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 105/213 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 338/551 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 338 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 551 constraints, problems are : Problem set: 0 solved, 338 unsolved in 15060 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 0/0 constraints]
After SMT, in 24364ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 24367ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24745 ms. Remains : 94/94 places, 339/339 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 77 edges and 94 vertex of which 24 / 94 are part of one of the 3 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 140 transitions
Reduce isomorphic transitions removed 173 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 68 transition count 158
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 60 transition count 154
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 58 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 57 transition count 152
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 31 place count 57 transition count 148
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 39 place count 53 transition count 148
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 51 transition count 146
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 51 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 49 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 49 transition count 136
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 75 place count 49 transition count 108
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 87 place count 43 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 89 place count 43 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 93 place count 41 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 117 place count 41 transition count 95
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 123 place count 38 transition count 92
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 125 place count 36 transition count 80
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 36 transition count 80
Applied a total of 127 rules in 16 ms. Remains 36 /94 variables (removed 58) and now considering 80/339 (removed 259) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 80 rows 36 cols
[2024-05-23 12:20:46] [INFO ] Computed 7 invariants in 1 ms
[2024-05-23 12:20:46] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 12:20:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 12:20:46] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-23 12:20:46] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-23 12:20:46] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 12:20:46] [INFO ] After 12ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-23 12:20:46] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-23 12:20:46] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 192 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 12:20:46] [INFO ] Flatten gal took : 88 ms
[2024-05-23 12:20:46] [INFO ] Flatten gal took : 92 ms
[2024-05-23 12:20:46] [INFO ] Input system was already deterministic with 1416 transitions.
Support contains 85 out of 780 places (down from 95) after GAL structural reductions.
Computed a total of 126 stabilizing places and 588 stable transitions
Graph (complete) has 2178 edges and 780 vertex of which 755 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 798 edges and 780 vertex of which 278 / 780 are part of one of the 31 SCC in 1 ms
Free SCC test removed 247 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 1855 edges and 533 vertex of which 508 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.4 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 507 transition count 657
Reduce places removed 217 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 290 transition count 653
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 445 place count 286 transition count 652
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 445 place count 286 transition count 615
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 519 place count 249 transition count 615
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 526 place count 242 transition count 608
Iterating global reduction 3 with 7 rules applied. Total rules applied 533 place count 242 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 534 place count 242 transition count 607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 534 place count 242 transition count 605
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 538 place count 240 transition count 605
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 674 place count 172 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 690 place count 172 transition count 520
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 4 with 8 rules applied. Total rules applied 698 place count 172 transition count 512
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 706 place count 164 transition count 512
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 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 714 place count 160 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 715 place count 159 transition count 507
Applied a total of 715 rules in 94 ms. Remains 159 /780 variables (removed 621) and now considering 507/1416 (removed 909) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 159/780 places, 507/1416 transitions.
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 22 ms
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 22 ms
[2024-05-23 12:20:47] [INFO ] Input system was already deterministic with 507 transitions.
RANDOM walk for 290 steps (11 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-4b-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 792 edges and 780 vertex of which 278 / 780 are part of one of the 31 SCC in 1 ms
Free SCC test removed 247 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 1855 edges and 533 vertex of which 508 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 508 transition count 660
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 436 place count 293 transition count 656
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 439 place count 290 transition count 656
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 439 place count 290 transition count 618
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 515 place count 252 transition count 618
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 522 place count 245 transition count 611
Iterating global reduction 3 with 7 rules applied. Total rules applied 529 place count 245 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 530 place count 245 transition count 610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 530 place count 245 transition count 608
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 534 place count 243 transition count 608
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 670 place count 175 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 686 place count 175 transition count 523
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 4 with 8 rules applied. Total rules applied 694 place count 175 transition count 515
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 702 place count 167 transition count 515
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 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 710 place count 163 transition count 511
Applied a total of 710 rules in 63 ms. Remains 163 /780 variables (removed 617) and now considering 511/1416 (removed 905) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 163/780 places, 511/1416 transitions.
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 19 ms
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 18 ms
[2024-05-23 12:20:47] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 760 transition count 1396
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 760 transition count 1396
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 754 transition count 1390
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 754 transition count 1390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 754 transition count 1388
Applied a total of 54 rules in 51 ms. Remains 754 /780 variables (removed 26) and now considering 1388/1416 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 754/780 places, 1388/1416 transitions.
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 77 ms
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 80 ms
[2024-05-23 12:20:47] [INFO ] Input system was already deterministic with 1388 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 803 edges and 780 vertex of which 287 / 780 are part of one of the 32 SCC in 2 ms
Free SCC test removed 255 places
Ensure Unique test removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Graph (complete) has 1839 edges and 525 vertex of which 501 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 258 output transitions
Drop transitions (Output transitions of discarded places.) removed 258 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 500 transition count 648
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 282 transition count 648
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 438 place count 282 transition count 612
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 510 place count 246 transition count 612
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 517 place count 239 transition count 605
Iterating global reduction 2 with 7 rules applied. Total rules applied 524 place count 239 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 525 place count 239 transition count 604
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 525 place count 239 transition count 602
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 529 place count 237 transition count 602
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 663 place count 170 transition count 534
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 679 place count 170 transition count 518
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 687 place count 170 transition count 510
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 695 place count 162 transition count 510
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 703 place count 158 transition count 506
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 706 place count 158 transition count 506
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 707 place count 157 transition count 505
Applied a total of 707 rules in 83 ms. Remains 157 /780 variables (removed 623) and now considering 505/1416 (removed 911) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 157/780 places, 505/1416 transitions.
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 20 ms
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 20 ms
[2024-05-23 12:20:47] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 785 edges and 780 vertex of which 262 / 780 are part of one of the 29 SCC in 2 ms
Free SCC test removed 233 places
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 266 transitions.
Graph (complete) has 1878 edges and 547 vertex of which 522 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 522 transition count 672
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 226 rules applied. Total rules applied 447 place count 303 transition count 665
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 454 place count 297 transition count 664
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 454 place count 297 transition count 624
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 534 place count 257 transition count 624
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 541 place count 250 transition count 617
Iterating global reduction 3 with 7 rules applied. Total rules applied 548 place count 250 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 549 place count 250 transition count 616
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 549 place count 250 transition count 614
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 553 place count 248 transition count 614
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 691 place count 179 transition count 544
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 707 place count 179 transition count 528
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 4 with 8 rules applied. Total rules applied 715 place count 179 transition count 520
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 723 place count 171 transition count 520
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 731 place count 167 transition count 516
Applied a total of 731 rules in 59 ms. Remains 167 /780 variables (removed 613) and now considering 516/1416 (removed 900) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 167/780 places, 516/1416 transitions.
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:20:47] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:20:47] [INFO ] Input system was already deterministic with 516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 750 transition count 1140
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 750 transition count 1140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 744 transition count 1134
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 744 transition count 1134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 744 transition count 1132
Applied a total of 73 rules in 85 ms. Remains 744 /780 variables (removed 36) and now considering 1132/1416 (removed 284) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 744/780 places, 1132/1416 transitions.
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 36 ms
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 36 ms
[2024-05-23 12:20:48] [INFO ] Input system was already deterministic with 1132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 793 edges and 780 vertex of which 273 / 780 are part of one of the 30 SCC in 1 ms
Free SCC test removed 243 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Graph (complete) has 1859 edges and 537 vertex of which 512 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 512 transition count 659
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 292 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 447 place count 290 transition count 656
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 447 place count 290 transition count 618
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 523 place count 252 transition count 618
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 530 place count 245 transition count 611
Iterating global reduction 3 with 7 rules applied. Total rules applied 537 place count 245 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 538 place count 245 transition count 610
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 538 place count 245 transition count 607
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 544 place count 242 transition count 607
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 680 place count 174 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 696 place count 174 transition count 522
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 4 with 8 rules applied. Total rules applied 704 place count 174 transition count 514
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 712 place count 166 transition count 514
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 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 720 place count 162 transition count 510
Applied a total of 720 rules in 57 ms. Remains 162 /780 variables (removed 618) and now considering 510/1416 (removed 906) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 162/780 places, 510/1416 transitions.
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 18 ms
[2024-05-23 12:20:48] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 761 transition count 1397
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 761 transition count 1397
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 755 transition count 1391
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 755 transition count 1391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 755 transition count 1389
Applied a total of 52 rules in 82 ms. Remains 755 /780 variables (removed 25) and now considering 1389/1416 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 755/780 places, 1389/1416 transitions.
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 68 ms
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 69 ms
[2024-05-23 12:20:48] [INFO ] Input system was already deterministic with 1389 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 743 transition count 1131
Applied a total of 75 rules in 45 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 32 ms
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 36 ms
[2024-05-23 12:20:48] [INFO ] Input system was already deterministic with 1131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 754 transition count 1144
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 754 transition count 1144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 748 transition count 1138
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 748 transition count 1138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 748 transition count 1136
Applied a total of 65 rules in 50 ms. Remains 748 /780 variables (removed 32) and now considering 1136/1416 (removed 280) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 748/780 places, 1136/1416 transitions.
[2024-05-23 12:20:48] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 38 ms
[2024-05-23 12:20:49] [INFO ] Input system was already deterministic with 1136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 800 edges and 780 vertex of which 285 / 780 are part of one of the 32 SCC in 1 ms
Free SCC test removed 253 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 1842 edges and 527 vertex of which 502 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 501 transition count 652
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 434 place count 285 transition count 652
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 434 place count 285 transition count 616
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 506 place count 249 transition count 616
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 513 place count 242 transition count 609
Iterating global reduction 2 with 7 rules applied. Total rules applied 520 place count 242 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 521 place count 242 transition count 608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 521 place count 242 transition count 606
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 525 place count 240 transition count 606
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 659 place count 173 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 674 place count 173 transition count 523
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 681 place count 173 transition count 516
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 688 place count 166 transition count 516
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 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 696 place count 162 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 697 place count 161 transition count 511
Applied a total of 697 rules in 65 ms. Remains 161 /780 variables (removed 619) and now considering 511/1416 (removed 905) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 161/780 places, 511/1416 transitions.
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 18 ms
[2024-05-23 12:20:49] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 743 transition count 1131
Applied a total of 75 rules in 43 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 32 ms
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 35 ms
[2024-05-23 12:20:49] [INFO ] Input system was already deterministic with 1131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 789 edges and 780 vertex of which 262 / 780 are part of one of the 30 SCC in 0 ms
Free SCC test removed 232 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Graph (complete) has 1874 edges and 548 vertex of which 523 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 523 transition count 671
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 224 rules applied. Total rules applied 447 place count 302 transition count 668
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 449 place count 300 transition count 668
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 449 place count 300 transition count 625
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 535 place count 257 transition count 625
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 541 place count 251 transition count 619
Iterating global reduction 3 with 6 rules applied. Total rules applied 547 place count 251 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 548 place count 251 transition count 618
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 548 place count 251 transition count 616
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 552 place count 249 transition count 616
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 686 place count 182 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 703 place count 182 transition count 531
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 4 with 8 rules applied. Total rules applied 711 place count 182 transition count 523
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 719 place count 174 transition count 523
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 729 place count 169 transition count 518
Applied a total of 729 rules in 80 ms. Remains 169 /780 variables (removed 611) and now considering 518/1416 (removed 898) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 169/780 places, 518/1416 transitions.
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:20:49] [INFO ] Input system was already deterministic with 518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 801 edges and 780 vertex of which 282 / 780 are part of one of the 32 SCC in 1 ms
Free SCC test removed 250 places
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Graph (complete) has 1847 edges and 530 vertex of which 505 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 504 transition count 653
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 286 transition count 653
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 438 place count 286 transition count 616
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 512 place count 249 transition count 616
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 519 place count 242 transition count 609
Iterating global reduction 2 with 7 rules applied. Total rules applied 526 place count 242 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 527 place count 242 transition count 608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 527 place count 242 transition count 606
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 531 place count 240 transition count 606
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 667 place count 172 transition count 537
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 683 place count 172 transition count 521
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 691 place count 172 transition count 513
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 699 place count 164 transition count 513
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 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 707 place count 160 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 708 place count 159 transition count 508
Applied a total of 708 rules in 60 ms. Remains 159 /780 variables (removed 621) and now considering 508/1416 (removed 908) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 159/780 places, 508/1416 transitions.
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 17 ms
[2024-05-23 12:20:49] [INFO ] Flatten gal took : 18 ms
[2024-05-23 12:20:49] [INFO ] Input system was already deterministic with 508 transitions.
RANDOM walk for 40000 steps (1658 resets) in 970 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (125 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 63347 steps, run visited all 1 properties in 162 ms. (steps per millisecond=391 )
Probabilistic random walk after 63347 steps, saw 12314 distinct states, run finished after 165 ms. (steps per millisecond=383 ) properties seen :1
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 743 transition count 1131
Applied a total of 75 rules in 39 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-05-23 12:20:50] [INFO ] Flatten gal took : 31 ms
[2024-05-23 12:20:50] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:20:50] [INFO ] Input system was already deterministic with 1131 transitions.
[2024-05-23 12:20:50] [INFO ] Flatten gal took : 67 ms
[2024-05-23 12:20:50] [INFO ] Flatten gal took : 69 ms
[2024-05-23 12:20:50] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-23 12:20:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 780 places, 1416 transitions and 7896 arcs took 11 ms.
Total runtime 120361 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-4b

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: 780
TRANSITIONS: 1416
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.004s]


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: 630
MODEL NAME: /home/mcc/execution/413/model
780 places, 1416 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 CTLFireability -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-4b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CloudDeployment-PT-4b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504800578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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