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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 9.6K Apr 13 02:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 13 02:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 435K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 13 02:28 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 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 256K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 787K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 29K Apr 13 04:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 213K Apr 13 04:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.3M Apr 13 03:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M 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-V20P20N50-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716286306688

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-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:11:48] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-21 10:11:48] [INFO ] Transformed 108 places.
[2024-05-21 10:11:48] [INFO ] Transformed 2228 transitions.
[2024-05-21 10:11:48] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 63 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Applied a total of 0 rules in 39 ms. Remains 108 /108 variables (removed 0) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 10:11:48] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 10:11:48] [INFO ] Computed 7 invariants in 22 ms
[2024-05-21 10:11:48] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:12:11] [INFO ] Deduced a trap composed of 5 places in 377 ms of which 17 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/398 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20152 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 10:12:40] [INFO ] Deduced a trap composed of 55 places in 203 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/398 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/108 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 56007ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 56070ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 10:12:44] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 108 cols
[2024-05-21 10:12:44] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 10:12:45] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-21 10:12:45] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:12:45] [INFO ] Invariant cache hit.
[2024-05-21 10:12:45] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:12:45] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 15 ms. Remains 108 /108 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56926 ms. Remains : 108/108 places, 2208/2228 transitions.
Support contains 63 out of 108 places after structural reductions.
[2024-05-21 10:12:46] [INFO ] Flatten gal took : 238 ms
[2024-05-21 10:12:46] [INFO ] Flatten gal took : 176 ms
[2024-05-21 10:12:46] [INFO ] Input system was already deterministic with 2208 transitions.
RANDOM walk for 40000 steps (228 resets) in 3020 ms. (13 steps per ms) remains 41/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 38/38 properties
[2024-05-21 10:12:48] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 10:12:48] [INFO ] Invariant cache hit.
[2024-05-21 10:12:48] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp58 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 3/3 constraints. Problems are: Problem set: 11 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 11 solved, 27 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 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 AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 60/108 variables, 4/7 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 289/397 variables, 108/115 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 101/216 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 0/216 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/397 variables, 0/216 constraints. Problems are: Problem set: 35 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 216 constraints, problems are : Problem set: 35 solved, 3 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 3/3 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/377 variables, 93/96 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 100/196 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/196 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/395 variables, 13/209 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/395 variables, 2/211 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 1/212 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 3/215 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/215 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/397 variables, 2/217 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 2/219 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/219 constraints. Problems are: Problem set: 35 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/397 variables, 0/219 constraints. Problems are: Problem set: 35 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 397/397 variables, and 219 constraints, problems are : Problem set: 35 solved, 3 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1110ms problems are : Problem set: 35 solved, 3 unsolved
Parikh walk visited 0 properties in 10171 ms.
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Graph (complete) has 881 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.14 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 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 105 transition count 2207
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 103 transition count 2206
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 101 transition count 2204
Applied a total of 10 rules in 606 ms. Remains 101 /108 variables (removed 7) and now considering 2204/2208 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 101/108 places, 2204/2208 transitions.
RANDOM walk for 40000 steps (320 resets) in 1039 ms. (38 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (108 resets) in 300 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (129 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (100 resets) in 379 ms. (105 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 132173 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 3
Probabilistic random walk after 132173 steps, saw 39295 distinct states, run finished after 3005 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 10:13:03] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 101 cols
[2024-05-21 10:13:03] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 10:13:03] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/377 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 100/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/386 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/377 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 100/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/386 variables, 8/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/386 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1083ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1770 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 203 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 101/101 places, 2204/2204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 306 ms. Remains 101 /101 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-05-21 10:13:06] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 10:13:06] [INFO ] Invariant cache hit.
[2024-05-21 10:13:07] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 10:13:07] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 10:13:07] [INFO ] Invariant cache hit.
[2024-05-21 10:13:07] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:13:07] [INFO ] Implicit Places using invariants and state equation in 723 ms returned [22, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1013 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/101 places, 2204/2204 transitions.
Applied a total of 0 rules in 206 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1526 ms. Remains : 99/101 places, 2204/2204 transitions.
RANDOM walk for 40000 steps (320 resets) in 704 ms. (56 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (108 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (130 resets) in 187 ms. (212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (98 resets) in 216 ms. (184 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 280605 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 3
Probabilistic random walk after 280605 steps, saw 79940 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
[2024-05-21 10:13:11] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
// Phase 1: matrix 285 rows 99 cols
[2024-05-21 10:13:11] [INFO ] Computed 4 invariants in 8 ms
[2024-05-21 10:13:11] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/377 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 100/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/384 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 204 constraints, problems are : Problem set: 0 solved, 3 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 86/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 284/377 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/377 variables, 100/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/384 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 207 constraints, problems are : Problem set: 0 solved, 3 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2881 ms.
Support contains 7 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2204/2204 transitions.
Applied a total of 0 rules in 159 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 99/99 places, 2204/2204 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 2204/2204 transitions.
Applied a total of 0 rules in 159 ms. Remains 99 /99 variables (removed 0) and now considering 2204/2204 (removed 0) transitions.
[2024-05-21 10:13:15] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 10:13:15] [INFO ] Invariant cache hit.
[2024-05-21 10:13:15] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 10:13:15] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 10:13:15] [INFO ] Invariant cache hit.
[2024-05-21 10:13:15] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 10:13:16] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2024-05-21 10:13:16] [INFO ] Redundant transitions in 107 ms returned []
Running 2201 sub problems to find dead transitions.
[2024-05-21 10:13:16] [INFO ] Flow matrix only has 285 transitions (discarded 1919 similar events)
[2024-05-21 10:13:16] [INFO ] Invariant cache hit.
[2024-05-21 10:13:16] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 99/384 variables, and 4 constraints, problems are : Problem set: 0 solved, 2201 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/99 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2201/2201 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2201 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 2 (OVERLAPS) 285/384 variables, 99/103 constraints. Problems are: Problem set: 2 solved, 2199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 101/204 constraints. Problems are: Problem set: 2 solved, 2199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/384 variables, and 2403 constraints, problems are : Problem set: 2 solved, 2199 unsolved in 35177 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 2199/2201 constraints, Known Traps: 0/0 constraints]
After SMT, in 81685ms problems are : Problem set: 2 solved, 2199 unsolved
Search for dead transitions found 2 dead transitions in 81759ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/99 places, 2202/2204 transitions.
Applied a total of 0 rules in 164 ms. Remains 99 /99 variables (removed 0) and now considering 2202/2202 (removed 0) transitions.
[2024-05-21 10:14:38] [INFO ] Redundant transitions in 155 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 83286 ms. Remains : 99/99 places, 2202/2204 transitions.
Successfully simplified 35 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:14:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 10:14:38] [INFO ] Flatten gal took : 87 ms
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 10:14:38] [INFO ] Flatten gal took : 71 ms
[2024-05-21 10:14:38] [INFO ] Input system was already deterministic with 2208 transitions.
Support contains 22 out of 108 places (down from 26) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 84 stable transitions
Graph (complete) has 3168 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.39 ms
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2207
Applied a total of 4 rules in 33 ms. Remains 105 /108 variables (removed 3) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:14:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 10:14:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:14:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 10:15:01] [INFO ] Deduced a trap composed of 5 places in 261 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56893ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56914ms
Finished structural reductions in LTL mode , in 1 iterations and 56958 ms. Remains : 105/108 places, 2207/2208 transitions.
[2024-05-21 10:15:36] [INFO ] Flatten gal took : 52 ms
[2024-05-21 10:15:36] [INFO ] Flatten gal took : 60 ms
[2024-05-21 10:15:36] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 105 transition count 2207
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 2207
Applied a total of 4 rules in 18 ms. Remains 105 /108 variables (removed 3) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:15:36] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 10:15:36] [INFO ] Invariant cache hit.
[2024-05-21 10:15:36] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 10:15:58] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56236ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56256ms
Finished structural reductions in LTL mode , in 1 iterations and 56280 ms. Remains : 105/108 places, 2207/2208 transitions.
[2024-05-21 10:16:32] [INFO ] Flatten gal took : 108 ms
[2024-05-21 10:16:32] [INFO ] Flatten gal took : 97 ms
[2024-05-21 10:16:32] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2208/2208 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 2208
Applied a total of 1 rules in 13 ms. Remains 107 /108 variables (removed 1) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 10:16:33] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 107 cols
[2024-05-21 10:16:33] [INFO ] Computed 6 invariants in 6 ms
[2024-05-21 10:16:33] [INFO ] State equation strengthened by 101 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P20N50

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.019s, 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: 700
MODEL NAME: /home/mcc/execution/model
108 places, 2228 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-V20P20N50-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P20N50-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716287819396

--------------------
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

MEDDLY ERROR: Insufficient memory

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-V20P20N50"
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-V20P20N50, 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-171620397700217"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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