Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397600169.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V10P10N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397600169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 12K Apr 13 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 238K Apr 13 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 13 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 97K Apr 13 01:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 417K Apr 13 01:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 223K 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 BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716284245181

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V10P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:37:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:37:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:37:27] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2024-05-21 09:37:27] [INFO ] Transformed 48 places.
[2024-05-21 09:37:27] [INFO ] Transformed 288 transitions.
[2024-05-21 09:37:27] [INFO ] Parsed PT model containing 48 places and 288 transitions and 2090 arcs in 321 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 27 ms.
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 288/288 transitions.
Applied a total of 0 rules in 14 ms. Remains 48 /48 variables (removed 0) and now considering 288/288 (removed 0) transitions.
Running 285 sub problems to find dead transitions.
[2024-05-21 09:37:27] [INFO ] Flow matrix only has 90 transitions (discarded 198 similar events)
// Phase 1: matrix 90 rows 48 cols
[2024-05-21 09:37:27] [INFO ] Computed 7 invariants in 8 ms
[2024-05-21 09:37:27] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-21 09:37:29] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 15 ms to minimize.
[2024-05-21 09:37:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD267 is UNSAT
[2024-05-21 09:37:30] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 265 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 80 constraints, problems are : Problem set: 22 solved, 263 unsolved in 5887 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 22 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 3/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 2/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 5 (OVERLAPS) 90/138 variables, 48/58 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 22/80 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 263/343 constraints. Problems are: Problem set: 22 solved, 263 unsolved
[2024-05-21 09:37:38] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 1/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/344 constraints. Problems are: Problem set: 22 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 344 constraints, problems are : Problem set: 22 solved, 263 unsolved in 11072 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 263/285 constraints, Known Traps: 4/4 constraints]
After SMT, in 17617ms problems are : Problem set: 22 solved, 263 unsolved
Search for dead transitions found 22 dead transitions in 17649ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 22 transitions.
[2024-05-21 09:37:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 48 cols
[2024-05-21 09:37:45] [INFO ] Computed 9 invariants in 6 ms
[2024-05-21 09:37:45] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 09:37:45] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 09:37:45] [INFO ] Invariant cache hit.
[2024-05-21 09:37:45] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:37:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 266/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17958 ms. Remains : 48/48 places, 266/288 transitions.
Support contains 41 out of 48 places after structural reductions.
[2024-05-21 09:37:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 09:37:45] [INFO ] Flatten gal took : 61 ms
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:37:45] [INFO ] Flatten gal took : 29 ms
[2024-05-21 09:37:45] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (441 resets) in 3291 ms. (12 steps per ms) remains 36/58 properties
BEST_FIRST walk for 4004 steps (15 resets) in 27 ms. (143 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (20 resets) in 63 ms. (62 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 122 ms. (32 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (16 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (17 resets) in 60 ms. (65 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (16 resets) in 47 ms. (83 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (16 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (16 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (16 resets) in 61 ms. (64 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (12 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (14 resets) in 36 ms. (108 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (14 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4005 steps (15 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (15 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (16 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (16 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (12 resets) in 48 ms. (81 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 34 ms. (114 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (13 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (13 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
[2024-05-21 09:37:47] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
[2024-05-21 09:37:47] [INFO ] Invariant cache hit.
[2024-05-21 09:37:47] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp26 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 11 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/2 constraints. Problems are: Problem set: 11 solved, 25 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/35 variables, 3/5 constraints. Problems are: Problem set: 22 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 22 solved, 14 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/48 variables, 4/9 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/134 variables, 48/57 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 20/77 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/77 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/77 constraints. Problems are: Problem set: 35 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 77 constraints, problems are : Problem set: 35 solved, 1 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/17 variables, 2/2 constraints. Problems are: Problem set: 35 solved, 1 unsolved
[2024-05-21 09:37:48] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
Problem AtomicPropp51 is UNSAT
After SMT solving in domain Int declared 17/134 variables, and 3 constraints, problems are : Problem set: 36 solved, 0 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, Generalized P Invariants (flows): 0/4 constraints, State Equation: 0/48 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 1/1 constraints]
After SMT, in 469ms problems are : Problem set: 36 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 36 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:37:48] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 09:37:48] [INFO ] Flatten gal took : 30 ms
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:37:48] [INFO ] Flatten gal took : 30 ms
[2024-05-21 09:37:48] [INFO ] Input system was already deterministic with 266 transitions.
Support contains 22 out of 48 places (down from 29) after GAL structural reductions.
Computed a total of 31 stabilizing places and 42 stable transitions
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 265
Applied a total of 3 rules in 65 ms. Remains 46 /48 variables (removed 2) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:37:48] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 46 cols
[2024-05-21 09:37:48] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 09:37:48] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:37:49] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:37:50] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:37:52] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 77 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 85/131 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 262/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 339 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7201 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 3/3 constraints]
After SMT, in 14844ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 14847ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 14913 ms. Remains : 46/48 places, 265/266 transitions.
[2024-05-21 09:38:03] [INFO ] Flatten gal took : 33 ms
[2024-05-21 09:38:03] [INFO ] Flatten gal took : 28 ms
[2024-05-21 09:38:03] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 8 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:38:03] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-05-21 09:38:03] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 09:38:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:38:04] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:38:05] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4847 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6264 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11404ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11407ms
Finished structural reductions in LTL mode , in 1 iterations and 11417 ms. Remains : 45/48 places, 265/266 transitions.
[2024-05-21 09:38:14] [INFO ] Flatten gal took : 23 ms
[2024-05-21 09:38:14] [INFO ] Flatten gal took : 38 ms
[2024-05-21 09:38:14] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Applied a total of 2 rules in 3 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 09:38:14] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 09:38:14] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 09:38:14] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4205 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:22] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 8435 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 12935ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 12937ms
Finished structural reductions in LTL mode , in 1 iterations and 12941 ms. Remains : 46/48 places, 266/266 transitions.
[2024-05-21 09:38:27] [INFO ] Flatten gal took : 9 ms
[2024-05-21 09:38:27] [INFO ] Flatten gal took : 10 ms
[2024-05-21 09:38:27] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 266
Applied a total of 1 rules in 3 ms. Remains 47 /48 variables (removed 1) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 09:38:27] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 47 cols
[2024-05-21 09:38:27] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 09:38:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:28] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:29] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 77 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4747 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 1/47 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 86/133 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 263/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 12 (OVERLAPS) 0/133 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 340 constraints, problems are : Problem set: 0 solved, 263 unsolved in 6866 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 47/47 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
After SMT, in 11887ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 11891ms
Finished structural reductions in LTL mode , in 1 iterations and 11894 ms. Remains : 47/48 places, 266/266 transitions.
[2024-05-21 09:38:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:38:39] [INFO ] Flatten gal took : 14 ms
[2024-05-21 09:38:39] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Graph (complete) has 639 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 46 /48 variables (removed 2) and now considering 266/266 (removed 0) transitions.
Running 263 sub problems to find dead transitions.
[2024-05-21 09:38:39] [INFO ] Flow matrix only has 86 transitions (discarded 180 similar events)
// Phase 1: matrix 86 rows 46 cols
[2024-05-21 09:38:39] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 09:38:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:40] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:42] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (OVERLAPS) 0/132 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 75 constraints, problems are : Problem set: 0 solved, 263 unsolved in 4587 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 4 (OVERLAPS) 86/132 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 263/338 constraints. Problems are: Problem set: 0 solved, 263 unsolved
[2024-05-21 09:38:47] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 263 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 339 constraints, problems are : Problem set: 0 solved, 263 unsolved in 8799 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 46/46 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 3/3 constraints]
After SMT, in 13665ms problems are : Problem set: 0 solved, 263 unsolved
Search for dead transitions found 0 dead transitions in 13669ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 13688 ms. Remains : 46/48 places, 266/266 transitions.
[2024-05-21 09:38:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:38:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 09:38:53] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 3 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:38:53] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
// Phase 1: matrix 85 rows 45 cols
[2024-05-21 09:38:53] [INFO ] Computed 7 invariants in 0 ms
[2024-05-21 09:38:53] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:38:54] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:38:55] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4646 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6204 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11134ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11151ms
Finished structural reductions in LTL mode , in 1 iterations and 11156 ms. Remains : 45/48 places, 265/266 transitions.
[2024-05-21 09:39:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:39:04] [INFO ] Flatten gal took : 8 ms
[2024-05-21 09:39:04] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 5 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:39:04] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 09:39:04] [INFO ] Invariant cache hit.
[2024-05-21 09:39:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:05] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:06] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4570 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6431 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11255ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11257ms
Finished structural reductions in LTL mode , in 1 iterations and 11263 ms. Remains : 45/48 places, 265/266 transitions.
[2024-05-21 09:39:15] [INFO ] Flatten gal took : 19 ms
[2024-05-21 09:39:15] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:39:16] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 7 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:39:16] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 09:39:16] [INFO ] Invariant cache hit.
[2024-05-21 09:39:16] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:16] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:18] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4559 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6573 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11391ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11394ms
Finished structural reductions in LTL mode , in 1 iterations and 11402 ms. Remains : 45/48 places, 265/266 transitions.
[2024-05-21 09:39:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:39:27] [INFO ] Flatten gal took : 7 ms
[2024-05-21 09:39:27] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 266/266 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 45 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 265
Applied a total of 4 rules in 17 ms. Remains 45 /48 variables (removed 3) and now considering 265/266 (removed 1) transitions.
Running 262 sub problems to find dead transitions.
[2024-05-21 09:39:27] [INFO ] Flow matrix only has 85 transitions (discarded 180 similar events)
[2024-05-21 09:39:27] [INFO ] Invariant cache hit.
[2024-05-21 09:39:27] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:28] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 262 unsolved
[2024-05-21 09:39:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 74 constraints, problems are : Problem set: 0 solved, 262 unsolved in 4068 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 85/130 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 262/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 336 constraints, problems are : Problem set: 0 solved, 262 unsolved in 6682 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 2/2 constraints]
After SMT, in 11029ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 11032ms
Finished structural reductions in LTL mode , in 1 iterations and 11051 ms. Remains : 45/48 places, 265/266 transitions.
[2024-05-21 09:39:38] [INFO ] Flatten gal took : 17 ms
[2024-05-21 09:39:38] [INFO ] Flatten gal took : 16 ms
[2024-05-21 09:39:38] [INFO ] Input system was already deterministic with 265 transitions.
[2024-05-21 09:39:38] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:39:38] [INFO ] Flatten gal took : 12 ms
[2024-05-21 09:39:38] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 09:39:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 266 transitions and 1922 arcs took 5 ms.
Total runtime 131661 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V10P10N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/419/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 48
TRANSITIONS: 266
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.000s]


SAVING FILE /home/mcc/execution/419/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 728
MODEL NAME: /home/mcc/execution/419/model
48 places, 266 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V10P10N10-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716284526945

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V10P10N10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BridgeAndVehicles-PT-V10P10N10, 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 r047-tajo-171620397600169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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