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-171620397800249.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-V50P50N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 18K Apr 13 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 13 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 529K Apr 13 02:26 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 7.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 227K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Apr 13 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 264K Apr 13 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Apr 13 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K Apr 13 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K Apr 22 14:30 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 1.1M 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-V50P50N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716288104497

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-V50P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:41:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:41:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:41:46] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-05-21 10:41:46] [INFO ] Transformed 128 places.
[2024-05-21 10:41:46] [INFO ] Transformed 1328 transitions.
[2024-05-21 10:41:46] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 52 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Applied a total of 0 rules in 45 ms. Remains 128 /128 variables (removed 0) and now considering 1328/1328 (removed 0) transitions.
Running 1325 sub problems to find dead transitions.
[2024-05-21 10:41:46] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-21 10:41:46] [INFO ] Computed 7 invariants in 33 ms
[2024-05-21 10:41:46] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1325 unsolved
[2024-05-21 10:41:57] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 10 ms to minimize.
[2024-05-21 10:42:02] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
[2024-05-21 10:42:06] [INFO ] Deduced a trap composed of 14 places in 122 ms of which 2 ms to minimize.
Problem TDEAD178 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD596 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD684 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD717 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/378 variables, and 8 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20129 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 1325/1325 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 3/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 2/128 variables, 2/10 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
[2024-05-21 10:42:24] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 1/11 constraints. Problems are: Problem set: 100 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/378 variables, and 11 constraints, problems are : Problem set: 100 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/128 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/1325 constraints, Known Traps: 4/4 constraints]
After SMT, in 46243ms problems are : Problem set: 100 solved, 1225 unsolved
Search for dead transitions found 100 dead transitions in 46286ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 100 transitions.
[2024-05-21 10:42:32] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 128 cols
[2024-05-21 10:42:32] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 10:42:32] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 10:42:32] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:42:32] [INFO ] Invariant cache hit.
[2024-05-21 10:42:32] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:42:33] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/128 places, 1228/1328 transitions.
Applied a total of 0 rules in 15 ms. Remains 128 /128 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46908 ms. Remains : 128/128 places, 1228/1328 transitions.
Support contains 52 out of 128 places after structural reductions.
[2024-05-21 10:42:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 10:42:33] [INFO ] Flatten gal took : 120 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:42:33] [INFO ] Flatten gal took : 71 ms
[2024-05-21 10:42:33] [INFO ] Input system was already deterministic with 1228 transitions.
Support contains 48 out of 128 places (down from 52) after GAL structural reductions.
RANDOM walk for 40001 steps (88 resets) in 3028 ms. (13 steps per ms) remains 34/58 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
[2024-05-21 10:42:35] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
[2024-05-21 10:42:35] [INFO ] Invariant cache hit.
[2024-05-21 10:42:35] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp54 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 22 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 2 (OVERLAPS) 97/128 variables, 4/7 constraints. Problems are: Problem set: 29 solved, 4 unsolved
[2024-05-21 10:42:35] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 2 ms to minimize.
[2024-05-21 10:42:35] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 1 ms to minimize.
[2024-05-21 10:42:35] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 3/10 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/10 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 248/376 variables, 128/138 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 20/158 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/158 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/158 constraints. Problems are: Problem set: 29 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 158 constraints, problems are : Problem set: 29 solved, 4 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 29 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 10/15 variables, 3/4 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/5 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 248/263 variables, 15/20 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 20/40 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/40 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 113/376 variables, 113/153 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/376 variables, 3/156 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/376 variables, 4/160 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/376 variables, 2/162 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/376 variables, 0/162 constraints. Problems are: Problem set: 29 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/376 variables, 0/162 constraints. Problems are: Problem set: 29 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 162 constraints, problems are : Problem set: 29 solved, 4 unsolved in 1393 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 128/128 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/33 constraints, Known Traps: 3/3 constraints]
After SMT, in 2345ms problems are : Problem set: 29 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1953 ms.
Support contains 5 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 1220 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 123 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:42:39] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 10:42:39] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:42:39] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:42:49] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21897 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47831ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47848ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 79 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48059 ms. Remains : 126/128 places, 1226/1228 transitions.
RANDOM walk for 40000 steps (88 resets) in 498 ms. (80 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (32 resets) in 227 ms. (175 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40007 steps (32 resets) in 175 ms. (227 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 238791 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 4
Probabilistic random walk after 238791 steps, saw 65622 distinct states, run finished after 3026 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-21 10:43:30] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 126 cols
[2024-05-21 10:43:31] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:43:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 146/155 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 215/370 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/372 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/372 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 372/372 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 146/155 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 215/370 variables, 115/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/370 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 4/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/372 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/372 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/372 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 372/372 variables, and 157 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1007 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1426ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1386 ms.
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 65 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 126/126 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 67 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-21 10:43:33] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:43:33] [INFO ] Invariant cache hit.
[2024-05-21 10:43:34] [INFO ] Implicit Places using invariants in 322 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 328 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/126 places, 1226/1226 transitions.
Applied a total of 0 rules in 86 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 481 ms. Remains : 124/126 places, 1226/1226 transitions.
RANDOM walk for 40000 steps (88 resets) in 560 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 221 ms. (180 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40012 steps (32 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40010 steps (32 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (32 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 299676 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 4
Probabilistic random walk after 299676 steps, saw 82231 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-21 10:43:37] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
// Phase 1: matrix 246 rows 124 cols
[2024-05-21 10:43:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:43:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 146/155 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 213/368 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/370 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 0 solved, 4 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 146/155 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 213/368 variables, 113/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 4/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/368 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/370 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/370 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1382 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1674ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2369 ms.
Support contains 5 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 60 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 124/124 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 1226/1226 transitions.
Applied a total of 0 rules in 60 ms. Remains 124 /124 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2024-05-21 10:43:42] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:43:42] [INFO ] Invariant cache hit.
[2024-05-21 10:43:42] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-21 10:43:42] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:43:42] [INFO ] Invariant cache hit.
[2024-05-21 10:43:42] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:43:43] [INFO ] Implicit Places using invariants and state equation in 747 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-05-21 10:43:43] [INFO ] Redundant transitions in 82 ms returned []
Running 1223 sub problems to find dead transitions.
[2024-05-21 10:43:43] [INFO ] Flow matrix only has 246 transitions (discarded 980 similar events)
[2024-05-21 10:43:43] [INFO ] Invariant cache hit.
[2024-05-21 10:43:43] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 10:43:54] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/130 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
[2024-05-21 10:44:18] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 3 (OVERLAPS) 246/370 variables, 124/131 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/370 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/370 variables, 1223/1374 constraints. Problems are: Problem set: 0 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 370/370 variables, and 1374 constraints, problems are : Problem set: 0 solved, 1223 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 124/124 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1223 constraints, Known Traps: 2/2 constraints]
After SMT, in 65775ms problems are : Problem set: 0 solved, 1223 unsolved
Search for dead transitions found 0 dead transitions in 65787ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67050 ms. Remains : 124/124 places, 1226/1226 transitions.
Successfully simplified 29 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:44:49] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 10:44:49] [INFO ] Flatten gal took : 86 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:44:49] [INFO ] Flatten gal took : 152 ms
[2024-05-21 10:44:49] [INFO ] Input system was already deterministic with 1228 transitions.
Support contains 17 out of 128 places (down from 25) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.22 ms
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 127 transition count 1228
Applied a total of 1 rules in 24 ms. Remains 127 /128 variables (removed 1) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:44:49] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 127 cols
[2024-05-21 10:44:49] [INFO ] Computed 6 invariants in 13 ms
[2024-05-21 10:44:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:44:58] [INFO ] Deduced a trap composed of 5 places in 178 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/375 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/127 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 3 (OVERLAPS) 1/127 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 5 (OVERLAPS) 248/375 variables, 127/134 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 20/154 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 1377 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21662 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 127/127 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 47052ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 47065ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 18 ms. Remains 127 /127 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47124 ms. Remains : 127/128 places, 1226/1228 transitions.
[2024-05-21 10:45:36] [INFO ] Flatten gal took : 37 ms
[2024-05-21 10:45:36] [INFO ] Flatten gal took : 45 ms
[2024-05-21 10:45:37] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Applied a total of 2 rules in 21 ms. Remains 126 /128 variables (removed 2) and now considering 1228/1228 (removed 0) transitions.
Running 1225 sub problems to find dead transitions.
[2024-05-21 10:45:37] [INFO ] Flow matrix only has 248 transitions (discarded 980 similar events)
// Phase 1: matrix 248 rows 126 cols
[2024-05-21 10:45:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:45:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
[2024-05-21 10:45:45] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 126/374 variables, and 6 constraints, problems are : Problem set: 0 solved, 1225 unsolved in 20055 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/126 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1225/1225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/126 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1225 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 248/374 variables, 126/132 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/374 variables, 20/152 constraints. Problems are: Problem set: 2 solved, 1223 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 374/374 variables, and 1375 constraints, problems are : Problem set: 2 solved, 1223 unsolved in 21988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 126/126 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1223/1225 constraints, Known Traps: 1/1 constraints]
After SMT, in 46211ms problems are : Problem set: 2 solved, 1223 unsolved
Search for dead transitions found 2 dead transitions in 46244ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/128 places, 1226/1228 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46273 ms. Remains : 126/128 places, 1226/1228 transitions.
[2024-05-21 10:46:23] [INFO ] Flatten gal took : 36 ms
[2024-05-21 10:46:23] [INFO ] Flatten gal took : 70 ms
[2024-05-21 10:46:23] [INFO ] Input system was already deterministic with 1226 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 23 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:46:23] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
// Phase 1: matrix 247 rows 125 cols
[2024-05-21 10:46:23] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:46:23] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:46:33] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 20922 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46290ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46308ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46359 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-05-21 10:47:09] [INFO ] Flatten gal took : 34 ms
[2024-05-21 10:47:10] [INFO ] Flatten gal took : 38 ms
[2024-05-21 10:47:10] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 125 transition count 1227
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 125 transition count 1227
Applied a total of 4 rules in 20 ms. Remains 125 /128 variables (removed 3) and now considering 1227/1228 (removed 1) transitions.
Running 1224 sub problems to find dead transitions.
[2024-05-21 10:47:10] [INFO ] Flow matrix only has 247 transitions (discarded 980 similar events)
[2024-05-21 10:47:10] [INFO ] Invariant cache hit.
[2024-05-21 10:47:10] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-05-21 10:47:20] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 125/372 variables, and 6 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/125 constraints, ReadFeed: 0/20 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD154 is UNSAT
At refinement iteration 3 (OVERLAPS) 247/372 variables, 125/131 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/151 constraints. Problems are: Problem set: 2 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/372 variables, and 1373 constraints, problems are : Problem set: 2 solved, 1222 unsolved in 21094 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 125/125 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1222/1224 constraints, Known Traps: 1/1 constraints]
After SMT, in 46721ms problems are : Problem set: 2 solved, 1222 unsolved
Search for dead transitions found 2 dead transitions in 46745ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/128 places, 1225/1228 transitions.
Applied a total of 0 rules in 8 ms. Remains 125 /125 variables (removed 0) and now considering 1225/1225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46805 ms. Remains : 125/128 places, 1225/1228 transitions.
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 60 ms
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 54 ms
[2024-05-21 10:47:57] [INFO ] Input system was already deterministic with 1225 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 187 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 187 ms. Remains : 121/128 places, 1224/1228 transitions.
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 38 ms
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 45 ms
[2024-05-21 10:47:57] [INFO ] Input system was already deterministic with 1224 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 128/128 places, 1228/1228 transitions.
Graph (complete) has 2645 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 125 transition count 1227
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 125 transition count 1227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 123 transition count 1226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 121 transition count 1224
Applied a total of 10 rules in 136 ms. Remains 121 /128 variables (removed 7) and now considering 1224/1228 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 136 ms. Remains : 121/128 places, 1224/1228 transitions.
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 29 ms
[2024-05-21 10:47:57] [INFO ] Flatten gal took : 33 ms
[2024-05-21 10:47:57] [INFO ] Input system was already deterministic with 1224 transitions.
[2024-05-21 10:47:58] [INFO ] Flatten gal took : 33 ms
[2024-05-21 10:47:58] [INFO ] Flatten gal took : 36 ms
[2024-05-21 10:47:58] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-21 10:47:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 128 places, 1228 transitions and 9210 arcs took 12 ms.
Total runtime 372172 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/420/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 128
TRANSITIONS: 1228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.037s, Sys 0.003s]


SAVING FILE /home/mcc/execution/420/model (.net / .def) ...
EXPORT TIME: [User 0.005s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 717
MODEL NAME: /home/mcc/execution/420/model
128 places, 1228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P50N10-CTLCardinality-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716289127572

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

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

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N10"
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-V50P50N10, 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-171620397800249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N10.tgz
mv BridgeAndVehicles-PT-V50P50N10 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 ;