About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V20P10N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14560.983 | 1722049.00 | 4201786.00 | 275.50 | T?TTTF?FF???FTFT | normal |
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-171620397700185.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-V20P10N20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 16K Apr 13 02:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 02:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 119K Apr 13 02:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 469K Apr 13 02:10 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 8.3K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 157K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 02:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Apr 13 02:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.1M Apr 13 02:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K 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 782K 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-V20P10N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716284704441
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-V20P10N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:45:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 09:45:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:45:06] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2024-05-21 09:45:06] [INFO ] Transformed 78 places.
[2024-05-21 09:45:06] [INFO ] Transformed 968 transitions.
[2024-05-21 09:45:06] [INFO ] Parsed PT model containing 78 places and 968 transitions and 7350 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Support contains 66 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 968/968 transitions.
Applied a total of 0 rules in 19 ms. Remains 78 /78 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Running 965 sub problems to find dead transitions.
[2024-05-21 09:45:06] [INFO ] Flow matrix only has 170 transitions (discarded 798 similar events)
// Phase 1: matrix 170 rows 78 cols
[2024-05-21 09:45:06] [INFO ] Computed 7 invariants in 13 ms
[2024-05-21 09:45:06] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 965 unsolved
[2024-05-21 09:45:13] [INFO ] Deduced a trap composed of 5 places in 468 ms of which 26 ms to minimize.
[2024-05-21 09:45:17] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 2 ms to minimize.
Problem TDEAD528 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD801 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD927 is UNSAT
[2024-05-21 09:45:19] [INFO ] Deduced a trap composed of 24 places in 134 ms of which 1 ms to minimize.
Problem TDEAD108 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 78/248 variables, and 10 constraints, problems are : Problem set: 40 solved, 925 unsolved in 20144 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/78 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 965/965 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 40 solved, 925 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 5/5 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 3 (OVERLAPS) 2/78 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 925 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 170/248 variables, 78/88 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 42/130 constraints. Problems are: Problem set: 42 solved, 923 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/248 variables, 923/1053 constraints. Problems are: Problem set: 42 solved, 923 unsolved
[2024-05-21 09:45:49] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 248/248 variables, and 1054 constraints, problems are : Problem set: 42 solved, 923 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 78/78 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 923/965 constraints, Known Traps: 4/4 constraints]
After SMT, in 43704ms problems are : Problem set: 42 solved, 923 unsolved
Search for dead transitions found 42 dead transitions in 43742ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-05-21 09:45:49] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 78 cols
[2024-05-21 09:45:49] [INFO ] Computed 9 invariants in 4 ms
[2024-05-21 09:45:50] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 09:45:50] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:45:50] [INFO ] Invariant cache hit.
[2024-05-21 09:45:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 09:45:50] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 78/78 places, 926/968 transitions.
Applied a total of 0 rules in 8 ms. Remains 78 /78 variables (removed 0) and now considering 926/926 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44158 ms. Remains : 78/78 places, 926/968 transitions.
Support contains 66 out of 78 places after structural reductions.
[2024-05-21 09:45:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 09:45:50] [INFO ] Flatten gal took : 157 ms
[2024-05-21 09:45:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:45:51] [INFO ] Flatten gal took : 87 ms
[2024-05-21 09:45:51] [INFO ] Input system was already deterministic with 926 transitions.
RANDOM walk for 40000 steps (228 resets) in 3792 ms. (10 steps per ms) remains 51/88 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 51/51 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 51/51 properties
[2024-05-21 09:45:53] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
[2024-05-21 09:45:53] [INFO ] Invariant cache hit.
[2024-05-21 09:45:53] [INFO ] State equation strengthened by 40 read => feed constraints.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 2 (OVERLAPS) 15/61 variables, 4/5 constraints. Problems are: Problem set: 26 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/5 constraints. Problems are: Problem set: 26 solved, 25 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 4 (OVERLAPS) 17/78 variables, 4/9 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 166/244 variables, 78/87 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 40/127 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/127 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/244 variables, 0/127 constraints. Problems are: Problem set: 50 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 127 constraints, problems are : Problem set: 50 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 78/78 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 50 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/33 variables, 2/2 constraints. Problems are: Problem set: 50 solved, 1 unsolved
[2024-05-21 09:45:53] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 50 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 50 solved, 1 unsolved
Problem AtomicPropp63 is UNSAT
After SMT solving in domain Int declared 71/244 variables, and 7 constraints, problems are : Problem set: 51 solved, 0 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/78 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 0/51 constraints, Known Traps: 1/1 constraints]
After SMT, in 776ms problems are : Problem set: 51 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 51 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:45:53] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 09:45:53] [INFO ] Flatten gal took : 50 ms
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:45:54] [INFO ] Flatten gal took : 84 ms
[2024-05-21 09:45:54] [INFO ] Input system was already deterministic with 926 transitions.
Support contains 26 out of 78 places (down from 38) after GAL structural reductions.
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1639 edges and 78 vertex of which 76 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 47 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:45:54] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-05-21 09:45:54] [INFO ] Computed 7 invariants in 6 ms
[2024-05-21 09:45:54] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:46:00] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:46:15] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 43037ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43059ms
Finished structural reductions in LTL mode , in 1 iterations and 43121 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:46:37] [INFO ] Flatten gal took : 29 ms
[2024-05-21 09:46:37] [INFO ] Flatten gal took : 28 ms
[2024-05-21 09:46:37] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 17 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:46:37] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-05-21 09:46:37] [INFO ] Invariant cache hit.
[2024-05-21 09:46:37] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:46:42] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 123 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1045 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1045 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 1/1 constraints]
After SMT, in 43194ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 43203ms
Finished structural reductions in LTL mode , in 1 iterations and 43222 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:47:20] [INFO ] Flatten gal took : 36 ms
[2024-05-21 09:47:20] [INFO ] Flatten gal took : 33 ms
[2024-05-21 09:47:20] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 19 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:47:20] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
[2024-05-21 09:47:20] [INFO ] Invariant cache hit.
[2024-05-21 09:47:20] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:47:26] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 123 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1045 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1045 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 1/1 constraints]
After SMT, in 42839ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42866ms
Finished structural reductions in LTL mode , in 1 iterations and 42897 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:48:03] [INFO ] Flatten gal took : 52 ms
[2024-05-21 09:48:03] [INFO ] Flatten gal took : 44 ms
[2024-05-21 09:48:03] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Graph (complete) has 1639 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 925
Applied a total of 3 rules in 142 ms. Remains 76 /78 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:48:04] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 76 cols
[2024-05-21 09:48:04] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 09:48:04] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:48:13] [INFO ] Deduced a trap composed of 5 places in 145 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:48:26] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/241 variables, and 10 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (OVERLAPS) 165/241 variables, 76/86 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 40/126 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 922/1048 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 1048 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42653ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42664ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42810 ms. Remains : 76/78 places, 925/926 transitions.
[2024-05-21 09:48:46] [INFO ] Flatten gal took : 41 ms
[2024-05-21 09:48:46] [INFO ] Flatten gal took : 44 ms
[2024-05-21 09:48:47] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 14 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:48:47] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-05-21 09:48:47] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 09:48:47] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:48:51] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:49:03] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42252ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42264ms
Finished structural reductions in LTL mode , in 1 iterations and 42281 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:49:29] [INFO ] Flatten gal took : 28 ms
[2024-05-21 09:49:29] [INFO ] Flatten gal took : 32 ms
[2024-05-21 09:49:29] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Graph (complete) has 1639 edges and 78 vertex of which 77 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 76 transition count 925
Applied a total of 3 rules in 94 ms. Remains 76 /78 variables (removed 2) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:49:29] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 76 cols
[2024-05-21 09:49:29] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 09:49:29] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:49:34] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:49:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 2 ms to minimize.
[2024-05-21 09:49:43] [INFO ] Deduced a trap composed of 6 places in 94 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 76/241 variables, and 11 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/76 constraints, ReadFeed: 0/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 1/76 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 8 (OVERLAPS) 165/241 variables, 76/87 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 40/127 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 922/1049 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 1049 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 3/3 constraints]
After SMT, in 42739ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42759ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42856 ms. Remains : 76/78 places, 925/926 transitions.
[2024-05-21 09:50:12] [INFO ] Flatten gal took : 50 ms
[2024-05-21 09:50:12] [INFO ] Flatten gal took : 38 ms
[2024-05-21 09:50:12] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 13 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:50:12] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-05-21 09:50:12] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 09:50:12] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:50:17] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:50:28] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42891ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42901ms
Finished structural reductions in LTL mode , in 1 iterations and 42917 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:50:55] [INFO ] Flatten gal took : 30 ms
[2024-05-21 09:50:55] [INFO ] Flatten gal took : 42 ms
[2024-05-21 09:50:55] [INFO ] Input system was already deterministic with 925 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 926
Applied a total of 1 rules in 9 ms. Remains 77 /78 variables (removed 1) and now considering 926/926 (removed 0) transitions.
Running 923 sub problems to find dead transitions.
[2024-05-21 09:50:55] [INFO ] Flow matrix only has 166 transitions (discarded 760 similar events)
// Phase 1: matrix 166 rows 77 cols
[2024-05-21 09:50:55] [INFO ] Computed 8 invariants in 3 ms
[2024-05-21 09:50:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 09:51:00] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 4 (OVERLAPS) 1/77 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 923 unsolved
[2024-05-21 09:51:10] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 923 unsolved
SMT process timed out in 22594ms, After SMT, problems are : Problem set: 0 solved, 923 unsolved
Search for dead transitions found 0 dead transitions in 22605ms
Finished structural reductions in LTL mode , in 1 iterations and 22617 ms. Remains : 77/78 places, 926/926 transitions.
[2024-05-21 09:51:18] [INFO ] Flatten gal took : 22 ms
[2024-05-21 09:51:18] [INFO ] Flatten gal took : 24 ms
[2024-05-21 09:51:18] [INFO ] Input system was already deterministic with 926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 926/926 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 926
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 75 transition count 925
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 75 transition count 925
Applied a total of 4 rules in 8 ms. Remains 75 /78 variables (removed 3) and now considering 925/926 (removed 1) transitions.
Running 922 sub problems to find dead transitions.
[2024-05-21 09:51:18] [INFO ] Flow matrix only has 165 transitions (discarded 760 similar events)
// Phase 1: matrix 165 rows 75 cols
[2024-05-21 09:51:18] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 09:51:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:51:22] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 922 unsolved
[2024-05-21 09:51:34] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/240 variables, and 124 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 922 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 4 (OVERLAPS) 165/240 variables, 75/84 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 40/124 constraints. Problems are: Problem set: 0 solved, 922 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 922/1046 constraints. Problems are: Problem set: 0 solved, 922 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 240/240 variables, and 1046 constraints, problems are : Problem set: 0 solved, 922 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 922/922 constraints, Known Traps: 2/2 constraints]
After SMT, in 42697ms problems are : Problem set: 0 solved, 922 unsolved
Search for dead transitions found 0 dead transitions in 42705ms
Finished structural reductions in LTL mode , in 1 iterations and 42715 ms. Remains : 75/78 places, 925/926 transitions.
[2024-05-21 09:52:01] [INFO ] Flatten gal took : 21 ms
[2024-05-21 09:52:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 09:52:01] [INFO ] Input system was already deterministic with 925 transitions.
[2024-05-21 09:52:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 09:52:01] [INFO ] Flatten gal took : 22 ms
[2024-05-21 09:52:01] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-21 09:52:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 926 transitions and 7022 arcs took 13 ms.
Total runtime 415450 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-PT-V20P10N20
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 78
TRANSITIONS: 926
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.038s, Sys 0.002s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 724
MODEL NAME: /home/mcc/execution/415/model
78 places, 926 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-V20P10N20-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N20-CTLCardinality-2024-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716286426490
--------------------
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
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-V20P10N20"
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-V20P10N20, 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-171620397700185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N20.tgz
mv BridgeAndVehicles-PT-V20P10N20 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;