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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.7M 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716290316789

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:18:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 11:18:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:18:38] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-05-21 11:18:38] [INFO ] Transformed 188 places.
[2024-05-21 11:18:38] [INFO ] Transformed 2108 transitions.
[2024-05-21 11:18:38] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 414 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 12
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 11:18:38] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 11:18:39] [INFO ] Computed 7 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[80, 20, 0, 0, 0, 80, 0, 0, 0, 0, 0] Max Struct:[80, 20, 80, 20, 80, 80, 2, 1, 1, 1, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-00 80 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (14 resets) in 212 ms. (46 steps per ms)
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (11 resets) in 62 ms. (317 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10, 1] Max Struct:[20, 2]
[2024-05-21 11:18:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:18:39] [INFO ] Invariant cache hit.
[2024-05-21 11:18:39] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2024-05-21 11:18:39] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-21 11:18:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:18:39] [INFO ] [Real]Added 22 Read/Feed constraints in 44 ms returned sat
[2024-05-21 11:18:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:18:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 11:18:40] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-21 11:18:40] [INFO ] [Nat]Added 22 Read/Feed constraints in 50 ms returned sat
[2024-05-21 11:18:40] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 197 transitions) in 110 ms.
[2024-05-21 11:18:40] [INFO ] Added : 10 causal constraints over 2 iterations in 352 ms. Result :sat
Minimization took 282 ms.
[2024-05-21 11:18:40] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[10, 1] Max Struct:[20, 1]
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 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 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 185 transition count 2107
Applied a total of 3 rules in 496 ms. Remains 185 /188 variables (removed 3) and now considering 2107/2108 (removed 1) transitions.
Running 2104 sub problems to find dead transitions.
[2024-05-21 11:18:41] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 185 cols
[2024-05-21 11:18:41] [INFO ] Computed 5 invariants in 10 ms
[2024-05-21 11:18:42] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 11:19:05] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20075 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 185/554 variables, and 6 constraints, problems are : Problem set: 0 solved, 2104 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/185 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2104 constraints, Known Traps: 1/1 constraints]
After SMT, in 55293ms problems are : Problem set: 0 solved, 2104 unsolved
Search for dead transitions found 0 dead transitions in 55385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55935 ms. Remains : 185/188 places, 2107/2108 transitions.
[2024-05-21 11:19:37] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000000 steps (1643 resets) in 6347 ms. (157 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2350 ms. (425 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 11:19:46] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:46] [INFO ] Invariant cache hit.
[2024-05-21 11:19:46] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 11:19:46] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-21 11:19:46] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:19:46] [INFO ] [Real]Added 22 Read/Feed constraints in 25 ms returned sat
[2024-05-21 11:19:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:19:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:19:46] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-05-21 11:19:46] [INFO ] [Nat]Added 22 Read/Feed constraints in 46 ms returned sat
[2024-05-21 11:19:46] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 62 ms.
[2024-05-21 11:19:46] [INFO ] Added : 11 causal constraints over 3 iterations in 320 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 157 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 185/185 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 229 ms. Remains 185 /185 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 11:19:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:47] [INFO ] Invariant cache hit.
[2024-05-21 11:19:47] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-21 11:19:47] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:47] [INFO ] Invariant cache hit.
[2024-05-21 11:19:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:19:49] [INFO ] Implicit Places using invariants and state equation in 1259 ms returned [82, 168]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1642 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/185 places, 2107/2107 transitions.
Applied a total of 0 rules in 179 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2052 ms. Remains : 183/185 places, 2107/2107 transitions.
[2024-05-21 11:19:49] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
// Phase 1: matrix 369 rows 183 cols
[2024-05-21 11:19:49] [INFO ] Computed 5 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000001 steps (1643 resets) in 5979 ms. (167 steps per ms)
BEST_FIRST walk for 1000001 steps (694 resets) in 2382 ms. (419 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 11:19:57] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:57] [INFO ] Invariant cache hit.
[2024-05-21 11:19:57] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:19:57] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-05-21 11:19:57] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:19:57] [INFO ] [Real]Added 22 Read/Feed constraints in 20 ms returned sat
[2024-05-21 11:19:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:19:57] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:19:58] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-21 11:19:58] [INFO ] [Nat]Added 22 Read/Feed constraints in 30 ms returned sat
[2024-05-21 11:19:58] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 2 ms to minimize.
[2024-05-21 11:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2024-05-21 11:19:58] [INFO ] Computed and/alt/rep : 170/338/170 causal constraints (skipped 196 transitions) in 85 ms.
[2024-05-21 11:19:58] [INFO ] Added : 10 causal constraints over 2 iterations in 237 ms. Result :sat
Minimization took 316 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 220 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 183/183 places, 2107/2107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2107/2107 transitions.
Applied a total of 0 rules in 184 ms. Remains 183 /183 variables (removed 0) and now considering 2107/2107 (removed 0) transitions.
[2024-05-21 11:19:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:59] [INFO ] Invariant cache hit.
[2024-05-21 11:19:59] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-21 11:19:59] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:19:59] [INFO ] Invariant cache hit.
[2024-05-21 11:20:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:20:00] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2024-05-21 11:20:00] [INFO ] Redundant transitions in 110 ms returned []
Running 2104 sub problems to find dead transitions.
[2024-05-21 11:20:00] [INFO ] Flow matrix only has 369 transitions (discarded 1738 similar events)
[2024-05-21 11:20:00] [INFO ] Invariant cache hit.
[2024-05-21 11:20:00] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2104 unsolved
[2024-05-21 11:20:24] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 2 ms to minimize.
[2024-05-21 11:20:39] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 1 ms to minimize.
Problem TDEAD1067 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1188 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1342 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1364 is UNSAT
Problem TDEAD1375 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1452 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1485 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1661 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 183/552 variables, and 7 constraints, problems are : Problem set: 55 solved, 2049 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/183 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2104/2104 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 55 solved, 2049 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 5/5 constraints. Problems are: Problem set: 55 solved, 2049 unsolved
Problem TDEAD1672 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1749 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1793 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1936 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2024 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/7 constraints. Problems are: Problem set: 80 solved, 2024 unsolved
Problem TDEAD80 is UNSAT
Problem TDEAD164 is UNSAT
At refinement iteration 3 (OVERLAPS) 369/552 variables, 183/190 constraints. Problems are: Problem set: 82 solved, 2022 unsolved
SMT process timed out in 75456ms, After SMT, problems are : Problem set: 82 solved, 2022 unsolved
Search for dead transitions found 82 dead transitions in 75479ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 183/183 places, 2025/2107 transitions.
Applied a total of 0 rules in 136 ms. Remains 183 /183 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
[2024-05-21 11:21:16] [INFO ] Redundant transitions in 72 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77157 ms. Remains : 183/183 places, 2025/2107 transitions.
[2024-05-21 11:21:16] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
// Phase 1: matrix 366 rows 183 cols
[2024-05-21 11:21:16] [INFO ] Computed 5 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[10] Max Struct:[20]
RANDOM walk for 1000001 steps (1643 resets) in 5708 ms. (175 steps per ms)
BEST_FIRST walk for 1000001 steps (695 resets) in 2195 ms. (455 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[10] Max Struct:[20]
[2024-05-21 11:21:24] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-05-21 11:21:24] [INFO ] Invariant cache hit.
[2024-05-21 11:21:24] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:21:24] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2024-05-21 11:21:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:21:24] [INFO ] [Real]Added 21 Read/Feed constraints in 38 ms returned sat
[2024-05-21 11:21:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:21:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 11:21:24] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-21 11:21:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 48 ms returned sat
[2024-05-21 11:21:25] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 2 ms to minimize.
[2024-05-21 11:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 372 ms
[2024-05-21 11:21:25] [INFO ] Computed and/alt/rep : 168/336/168 causal constraints (skipped 195 transitions) in 63 ms.
[2024-05-21 11:21:25] [INFO ] Added : 11 causal constraints over 3 iterations in 400 ms. Result :sat
Minimization took 466 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[10] Max Struct:[20]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[10] Max Struct:[20]
Support contains 1 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2025/2025 transitions.
Applied a total of 0 rules in 131 ms. Remains 183 /183 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 183/183 places, 2025/2025 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 2025/2025 transitions.
Applied a total of 0 rules in 157 ms. Remains 183 /183 variables (removed 0) and now considering 2025/2025 (removed 0) transitions.
[2024-05-21 11:21:26] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-05-21 11:21:26] [INFO ] Invariant cache hit.
[2024-05-21 11:21:27] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-21 11:21:27] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-05-21 11:21:27] [INFO ] Invariant cache hit.
[2024-05-21 11:21:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:21:28] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-05-21 11:21:28] [INFO ] Redundant transitions in 59 ms returned []
Running 2022 sub problems to find dead transitions.
[2024-05-21 11:21:28] [INFO ] Flow matrix only has 366 transitions (discarded 1659 similar events)
[2024-05-21 11:21:28] [INFO ] Invariant cache hit.
[2024-05-21 11:21:28] [INFO ] State equation strengthened by 21 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P20N10

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: 188
TRANSITIONS: 2108
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.088s, Sys 0.013s]


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


----------------------------------------------------------------------
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: 660
MODEL NAME: /home/mcc/execution/model
188 places, 2108 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-V80P20N10-UpperBounds-00 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-02 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-03 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-04 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-05 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-06 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-10 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-11 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-14 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-15 80 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P20N10-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716290541986

--------------------
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 UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;