About the Execution of LTSMin+red for GPPP-PT-C0010N0000000100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 448.884 | 35555.00 | 44962.00 | 199.80 | F?FFF?T?TFF?F??T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r496-tall-171640603300385.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 ltsminxred
Input is GPPP-PT-C0010N0000000100, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603300385
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 08:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 08:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 12 08:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000100-CTLCardinality-2024-00
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-01
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-02
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-03
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-04
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-05
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-06
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-07
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-08
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-09
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-10
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2024-11
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-12
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-13
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-14
FORMULA_NAME GPPP-PT-C0010N0000000100-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717196144147
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0010N0000000100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:55:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:55:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:55:45] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-31 22:55:45] [INFO ] Transformed 33 places.
[2024-05-31 22:55:45] [INFO ] Transformed 22 transitions.
[2024-05-31 22:55:45] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 33 cols
[2024-05-31 22:55:45] [INFO ] Computed 12 invariants in 11 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem TDEAD19 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 45 constraints, problems are : Problem set: 1 solved, 20 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 22/55 variables, 33/45 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 20/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/55 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 65 constraints, problems are : Problem set: 1 solved, 20 unsolved in 2523 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 3000ms problems are : Problem set: 1 solved, 20 unsolved
Search for dead transitions found 1 dead transitions in 3011ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 22:55:48] [INFO ] Computed 13 invariants in 4 ms
[2024-05-31 22:55:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-31 22:55:48] [INFO ] Invariant cache hit.
[2024-05-31 22:55:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 21/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3153 ms. Remains : 33/33 places, 21/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2024-05-31 22:55:48] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:55:48] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:55:48] [INFO ] Input system was already deterministic with 21 transitions.
RANDOM walk for 40106 steps (96 resets) in 1182 ms. (33 steps per ms) remains 58/76 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 57/58 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 56/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 56/56 properties
[2024-05-31 22:55:49] [INFO ] Invariant cache hit.
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 25 solved, 31 unsolved
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/10 constraints. Problems are: Problem set: 28 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 28 solved, 28 unsolved
Problem AtomicPropp67 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/33 variables, 1/11 constraints. Problems are: Problem set: 29 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 2/13 constraints. Problems are: Problem set: 51 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 51 solved, 5 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 53 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 53 solved, 3 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 5/5 constraints. Problems are: Problem set: 53 solved, 3 unsolved
[2024-05-31 22:55:49] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/6 constraints. Problems are: Problem set: 53 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 53 solved, 3 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp35 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 28/54 variables, and 11 constraints, problems are : Problem set: 55 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 5/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/33 constraints, PredecessorRefiner: 0/56 constraints, Known Traps: 1/1 constraints]
After SMT, in 1279ms problems are : Problem set: 55 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 78 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output 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 3 place count 31 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 23 transition count 13
Applied a total of 15 rules in 30 ms. Remains 23 /33 variables (removed 10) and now considering 13/21 (removed 8) transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-05-31 22:55:50] [INFO ] Computed 10 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/36 variables, and 45 constraints, problems are : Problem set: 0 solved, 12 unsolved in 6765 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 6916ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 6916ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6947 ms. Remains : 23/33 places, 13/21 transitions.
RANDOM walk for 40018 steps (220 resets) in 373 ms. (107 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (59 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3756151 steps, run timeout after 3001 ms. (steps per millisecond=1251 ) properties seen :0 out of 1
Probabilistic random walk after 3756151 steps, saw 587392 distinct states, run finished after 3004 ms. (steps per millisecond=1250 ) properties seen :0
[2024-05-31 22:56:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/36 variables, and 33 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/20 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:56:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 36/36 variables, and 34 constraints, problems are : Problem set: 1 solved, 0 unsolved in 103 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 147ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 56 atomic propositions for a total of 16 simplifications.
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:56:01] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:56:01] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000100-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:56:01] [INFO ] Input system was already deterministic with 21 transitions.
Support contains 16 out of 33 places (down from 24) after GAL structural reductions.
Computed a total of 31 stabilizing places and 19 stable transitions
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 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 (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 3 place count 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 30 transition count 18
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 29 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 26 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 24 transition count 15
Applied a total of 14 rules in 7 ms. Remains 24 /33 variables (removed 9) and now considering 15/21 (removed 6) transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 24 cols
[2024-05-31 22:56:01] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:56:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/39 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/39 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 35 constraints, problems are : Problem set: 0 solved, 14 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 1/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 14/38 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/39 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 49 constraints, problems are : Problem set: 0 solved, 14 unsolved in 381 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 24/24 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 526ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 526ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 533 ms. Remains : 24/33 places, 15/21 transitions.
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:01] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:01] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 22:56:01] [INFO ] Computed 13 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1080 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1275ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1275ms
Finished structural reductions in LTL mode , in 1 iterations and 1276 ms. Remains : 33/33 places, 21/21 transitions.
[2024-05-31 22:56:03] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:56:03] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:56:03] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 4 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-31 22:56:03] [INFO ] Computed 10 invariants in 0 ms
[2024-05-31 22:56:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 174 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6617ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 6618ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 6622 ms. Remains : 23/33 places, 14/21 transitions.
[2024-05-31 22:56:09] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:56:09] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:56:09] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (complete) has 81 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 31 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 30 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 29 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 25 transition count 16
Applied a total of 11 rules in 6 ms. Remains 25 /33 variables (removed 8) and now considering 16/21 (removed 5) transitions.
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 25 cols
[2024-05-31 22:56:09] [INFO ] Computed 10 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 15 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 16/41 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 50 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1624 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1782ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 1783ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 1789 ms. Remains : 25/33 places, 16/21 transitions.
[2024-05-31 22:56:11] [INFO ] Flatten gal took : 4 ms
[2024-05-31 22:56:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:11] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 33 cols
[2024-05-31 22:56:11] [INFO ] Computed 13 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 2/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/54 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1104 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1286ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1287ms
Finished structural reductions in LTL mode , in 1 iterations and 1288 ms. Remains : 33/33 places, 21/21 transitions.
[2024-05-31 22:56:12] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:56:12] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:12] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 21/21 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 79 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 3 place count 30 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 29 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 28 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 23 transition count 14
Applied a total of 14 rules in 6 ms. Remains 23 /33 variables (removed 10) and now considering 14/21 (removed 7) transitions.
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 23 cols
[2024-05-31 22:56:12] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:56:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/37 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/37 variables, and 34 constraints, problems are : Problem set: 0 solved, 13 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 13/36 variables, 23/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/37 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/37 variables, and 47 constraints, problems are : Problem set: 0 solved, 13 unsolved in 6445 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 6601ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 6602ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 6608 ms. Remains : 23/33 places, 14/21 transitions.
[2024-05-31 22:56:19] [INFO ] Flatten gal took : 3 ms
[2024-05-31 22:56:19] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:19] [INFO ] Input system was already deterministic with 14 transitions.
[2024-05-31 22:56:19] [INFO ] Flatten gal took : 2 ms
[2024-05-31 22:56:19] [INFO ] Flatten gal took : 5 ms
[2024-05-31 22:56:19] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:56:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 21 transitions and 80 arcs took 1 ms.
Total runtime 34213 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2024-01
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2024-05
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2024-07
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2024-11
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2023-13
Could not compute solution for formula : GPPP-PT-C0010N0000000100-CTLCardinality-2023-14
BK_STOP 1717196179702
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/589/ctl_0_
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/589/ctl_1_
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/589/ctl_2_
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/589/ctl_3_
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/589/ctl_4_
ctl formula name GPPP-PT-C0010N0000000100-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/589/ctl_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="GPPP-PT-C0010N0000000100"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPPP-PT-C0010N0000000100, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603300385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000100.tgz
mv GPPP-PT-C0010N0000000100 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;