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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 14K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 84K Apr 13 01:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 347K Apr 13 01:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.6K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 13 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 207K Apr 13 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 842K Apr 13 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 434K 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-V20P10N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716284694436

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:44:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:44:57] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2024-05-21 09:44:57] [INFO ] Transformed 68 places.
[2024-05-21 09:44:57] [INFO ] Transformed 548 transitions.
[2024-05-21 09:44:57] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 104 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (224 resets) in 3396 ms. (11 steps per ms) remains 8/14 properties
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (106 resets) in 2843 ms. (14 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (96 resets) in 2919 ms. (13 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (84 resets) in 479 ms. (83 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (84 resets) in 522 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 677 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (90 resets) in 594 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (87 resets) in 385 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (81 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
[2024-05-21 09:45:01] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 09:45:01] [INFO ] Computed 7 invariants in 11 ms
[2024-05-21 09:45:01] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 97 constraints, problems are : Problem set: 4 solved, 4 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 18/68 variables, 6/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 4/101 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 101 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3454ms problems are : Problem set: 4 solved, 4 unsolved
Parikh walk visited 0 properties in 891 ms.
Support contains 50 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 65 transition count 547
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 65 transition count 547
Applied a total of 3 rules in 85 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
Running 544 sub problems to find dead transitions.
[2024-05-21 09:45:06] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2024-05-21 09:45:06] [INFO ] Computed 5 invariants in 5 ms
[2024-05-21 09:45:06] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 544 unsolved
[2024-05-21 09:45:08] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 15 ms to minimize.
[2024-05-21 09:45:09] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
[2024-05-21 09:45:10] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
Problem TDEAD87 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 504 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (OVERLAPS) 0/194 variables, 0/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 95 constraints, problems are : Problem set: 42 solved, 502 unsolved in 12409 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 129/194 variables, 65/73 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 22/95 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 502/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/597 constraints. Problems are: Problem set: 42 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 597 constraints, problems are : Problem set: 42 solved, 502 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 65/65 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 502/544 constraints, Known Traps: 3/3 constraints]
After SMT, in 33695ms problems are : Problem set: 42 solved, 502 unsolved
Search for dead transitions found 42 dead transitions in 33709ms
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.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/68 places, 505/548 transitions.
Applied a total of 0 rules in 39 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33859 ms. Remains : 65/68 places, 505/548 transitions.
RANDOM walk for 40000 steps (224 resets) in 417 ms. (95 steps per ms) remains 3/4 properties
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (84 resets) in 163 ms. (243 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (88 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 152 ms. (261 steps per ms) remains 3/3 properties
[2024-05-21 09:45:40] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-05-21 09:45:40] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 09:45:40] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 15/65 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/190 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 92 constraints, problems are : Problem set: 0 solved, 3 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 15/65 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/190 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 981 ms.
Support contains 50 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 26 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 65/65 places, 505/505 transitions.
RANDOM walk for 40000 steps (224 resets) in 337 ms. (118 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (83 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (90 resets) in 257 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (87 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 508033 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 3
Probabilistic random walk after 508033 steps, saw 126626 distinct states, run finished after 3007 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-21 09:45:45] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 09:45:45] [INFO ] Invariant cache hit.
[2024-05-21 09:45:45] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 15/65 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/190 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 92 constraints, problems are : Problem set: 0 solved, 3 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 15/65 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/190 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/190 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 95 constraints, problems are : Problem set: 0 solved, 3 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 667ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 427 ms.
Support contains 50 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 65/65 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 505/505 transitions.
Applied a total of 0 rules in 22 ms. Remains 65 /65 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-05-21 09:45:46] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 09:45:46] [INFO ] Invariant cache hit.
[2024-05-21 09:45:46] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 09:45:46] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 09:45:46] [INFO ] Invariant cache hit.
[2024-05-21 09:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 09:45:46] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 09:45:46] [INFO ] Redundant transitions in 26 ms returned []
Running 502 sub problems to find dead transitions.
[2024-05-21 09:45:46] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
[2024-05-21 09:45:46] [INFO ] Invariant cache hit.
[2024-05-21 09:45:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 09:45:49] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-21 09:45:52] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 94 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10732 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 41688ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 41694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42072 ms. Remains : 65/65 places, 505/505 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 65 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 64 transition count 124
Applied a total of 382 rules in 22 ms. Remains 64 /65 variables (removed 1) and now considering 124/505 (removed 381) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 124 rows 64 cols
[2024-05-21 09:46:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 09:46:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 09:46:28] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 26 ms returned sat
[2024-05-21 09:46:28] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 09:46:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-21 09:46:28] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 09:46:28] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-21 09:46:29] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-21 09:46:29] [INFO ] After 430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 741 ms.
[2024-05-21 09:46:29] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-21 09:46:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 505 transitions and 3738 arcs took 9 ms.
[2024-05-21 09:46:29] [INFO ] Flatten gal took : 137 ms
Total runtime 92542 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P10N10

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 645
MODEL NAME: /home/mcc/execution/418/model
65 places, 505 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-V20P10N10-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716284834759

--------------------
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 ReachabilityFireability -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-V20P10N10"
export BK_EXAMINATION="ReachabilityFireability"
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-V20P10N10, examination is ReachabilityFireability"
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-171620397700183"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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