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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716287145003

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:25:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 10:25:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:25:47] [INFO ] Load time of PNML (sax parser for PT used): 315 ms
[2024-05-21 10:25:47] [INFO ] Transformed 138 places.
[2024-05-21 10:25:47] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:25:47] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 520 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Applied a total of 0 rules in 69 ms. Remains 138 /138 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:25:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:25:47] [INFO ] Computed 7 invariants in 33 ms
[2024-05-21 10:25:47] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:26:15] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 22 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20195 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 58738ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 58870ms
[2024-05-21 10:26:46] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:26:46] [INFO ] Invariant cache hit.
[2024-05-21 10:26:47] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-05-21 10:26:47] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:26:47] [INFO ] Invariant cache hit.
[2024-05-21 10:26:47] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:26:48] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:26:48] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:26:48] [INFO ] Invariant cache hit.
[2024-05-21 10:26:48] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:27:15] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/428 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:27:58] [INFO ] Deduced a trap composed of 25 places in 218 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Problem TDEAD1458 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1542 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1794 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1920 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/428 variables, and 7 constraints, problems are : Problem set: 33 solved, 2312 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/138 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 79325ms problems are : Problem set: 33 solved, 2312 unsolved
Search for dead transitions found 33 dead transitions in 79379ms
Found 33 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 33 transitions
Dead transitions reduction (with SMT) removed 33 transitions
Starting structural reductions in LTL mode, iteration 1 : 138/138 places, 2315/2348 transitions.
Applied a total of 0 rules in 38 ms. Remains 138 /138 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140064 ms. Remains : 138/138 places, 2315/2348 transitions.
Support contains 14 out of 138 places after structural reductions.
[2024-05-21 10:28:08] [INFO ] Flatten gal took : 212 ms
[2024-05-21 10:28:08] [INFO ] Flatten gal took : 140 ms
[2024-05-21 10:28:08] [INFO ] Input system was already deterministic with 2315 transitions.
RANDOM walk for 40000 steps (92 resets) in 3703 ms. (10 steps per ms) remains 3/18 properties
BEST_FIRST walk for 40003 steps (32 resets) in 271 ms. (147 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (44 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (32 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
[2024-05-21 10:28:10] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:28:10] [INFO ] Computed 7 invariants in 3 ms
[2024-05-21 10:28:10] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 290/305 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 42/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 123/428 variables, 123/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 3/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/428 variables, 0/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 187 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 290/305 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 42/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 123/428 variables, 123/184 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/428 variables, 3/187 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/428 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/428 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/428 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 188 constraints, problems are : Problem set: 1 solved, 1 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 694ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2315/2315 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 463 ms. Remains 136 /138 variables (removed 2) and now considering 2315/2315 (removed 0) transitions.
Running 2312 sub problems to find dead transitions.
[2024-05-21 10:28:11] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:28:11] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 10:28:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
[2024-05-21 10:28:43] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2312 unsolved in 20091 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2312/2312 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2312 unsolved in 20076 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2312 constraints, Known Traps: 1/1 constraints]
After SMT, in 61851ms problems are : Problem set: 0 solved, 2312 unsolved
Search for dead transitions found 0 dead transitions in 61901ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62375 ms. Remains : 136/138 places, 2315/2315 transitions.
RANDOM walk for 40001 steps (92 resets) in 702 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (32 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 250017 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 1
Probabilistic random walk after 250017 steps, saw 66668 distinct states, run finished after 3017 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-21 10:29:16] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:16] [INFO ] Invariant cache hit.
[2024-05-21 10:29:16] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/197 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/424 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/426 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 1 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/197 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 227/424 variables, 125/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 3/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/426 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/426 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 184 constraints, problems are : Problem set: 0 solved, 1 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1325ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 919 ms.
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2315/2315 transitions.
Applied a total of 0 rules in 348 ms. Remains 136 /136 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 136/136 places, 2315/2315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2315/2315 transitions.
Applied a total of 0 rules in 419 ms. Remains 136 /136 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-21 10:29:19] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:19] [INFO ] Invariant cache hit.
[2024-05-21 10:29:20] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-21 10:29:20] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:20] [INFO ] Invariant cache hit.
[2024-05-21 10:29:20] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:29:21] [INFO ] Implicit Places using invariants and state equation in 1700 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2121 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2315/2315 transitions.
Applied a total of 0 rules in 268 ms. Remains 134 /134 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2810 ms. Remains : 134/136 places, 2315/2315 transitions.
RANDOM walk for 40000 steps (92 resets) in 516 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (32 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 254552 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :0 out of 1
Probabilistic random walk after 254552 steps, saw 68226 distinct states, run finished after 3002 ms. (steps per millisecond=84 ) properties seen :0
[2024-05-21 10:29:25] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 10:29:25] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:29:25] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/197 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/422 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/424 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 181 constraints, problems are : Problem set: 0 solved, 1 unsolved in 226 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/197 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 225/422 variables, 123/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/422 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/422 variables, 42/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/424 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 182 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 134/134 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1296ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 3 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2315/2315 transitions.
Applied a total of 0 rules in 248 ms. Remains 134 /134 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 134/134 places, 2315/2315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2315/2315 transitions.
Applied a total of 0 rules in 201 ms. Remains 134 /134 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-21 10:29:27] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:27] [INFO ] Invariant cache hit.
[2024-05-21 10:29:27] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-21 10:29:27] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:27] [INFO ] Invariant cache hit.
[2024-05-21 10:29:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:29:28] [INFO ] Implicit Places using invariants and state equation in 1249 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2024-05-21 10:29:29] [INFO ] Redundant transitions in 137 ms returned []
Running 2312 sub problems to find dead transitions.
[2024-05-21 10:29:29] [INFO ] Flow matrix only has 290 transitions (discarded 2025 similar events)
[2024-05-21 10:29:29] [INFO ] Invariant cache hit.
[2024-05-21 10:29:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
[2024-05-21 10:29:57] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 134/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2312 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2312/2312 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2312 unsolved
[2024-05-21 10:30:44] [INFO ] Deduced a trap composed of 25 places in 323 ms of which 0 ms to minimize.
Problem TDEAD1908 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2181 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 134/424 variables, and 7 constraints, problems are : Problem set: 14 solved, 2298 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/134 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2312 constraints, Known Traps: 2/2 constraints]
After SMT, in 79789ms problems are : Problem set: 14 solved, 2298 unsolved
Search for dead transitions found 14 dead transitions in 79817ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/134 places, 2301/2315 transitions.
Applied a total of 0 rules in 195 ms. Remains 134 /134 variables (removed 0) and now considering 2301/2301 (removed 0) transitions.
[2024-05-21 10:30:49] [INFO ] Redundant transitions in 43 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 82061 ms. Remains : 134/134 places, 2301/2315 transitions.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 111 stabilizing places and 204 stable transitions
Graph (complete) has 3817 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2315/2315 transitions.
Graph (complete) has 3817 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.27 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 135 transition count 2314
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 135 transition count 2314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 133 transition count 2313
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 131 transition count 2311
Applied a total of 10 rules in 715 ms. Remains 131 /138 variables (removed 7) and now considering 2311/2315 (removed 4) transitions.
[2024-05-21 10:30:50] [INFO ] Flow matrix only has 286 transitions (discarded 2025 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-05-21 10:30:50] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 10:30:50] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 10:30:50] [INFO ] Flow matrix only has 286 transitions (discarded 2025 similar events)
[2024-05-21 10:30:50] [INFO ] Invariant cache hit.
[2024-05-21 10:30:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:30:51] [INFO ] Implicit Places using invariants and state equation in 730 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1111 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/138 places, 2311/2315 transitions.
Applied a total of 0 rules in 255 ms. Remains 129 /129 variables (removed 0) and now considering 2311/2311 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2083 ms. Remains : 129/138 places, 2311/2315 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00
Stuttering criterion allowed to conclude after 309 steps with 0 reset in 21 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-00 finished in 2496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2315/2315 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 135 transition count 2314
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 135 transition count 2314
Applied a total of 4 rules in 45 ms. Remains 135 /138 variables (removed 3) and now considering 2314/2315 (removed 1) transitions.
Running 2311 sub problems to find dead transitions.
[2024-05-21 10:30:52] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:30:52] [INFO ] Computed 5 invariants in 16 ms
[2024-05-21 10:30:52] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
[2024-05-21 10:31:22] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20041 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2311/2311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/424 variables, and 6 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/135 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2311 constraints, Known Traps: 1/1 constraints]
After SMT, in 60568ms problems are : Problem set: 0 solved, 2311 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
[2024-05-21 10:31:52] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
[2024-05-21 10:31:52] [INFO ] Invariant cache hit.
[2024-05-21 10:31:53] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-21 10:31:53] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
[2024-05-21 10:31:53] [INFO ] Invariant cache hit.
[2024-05-21 10:31:53] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:31:53] [INFO ] Implicit Places using invariants and state equation in 885 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1227 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/138 places, 2314/2315 transitions.
Applied a total of 0 rules in 13 ms. Remains 133 /133 variables (removed 0) and now considering 2314/2314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61905 ms. Remains : 133/138 places, 2314/2315 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01
Stuttering criterion allowed to conclude after 415 steps with 0 reset in 23 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-01 finished in 62078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2315/2315 transitions.
Graph (complete) has 3817 edges and 138 vertex of which 137 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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 136 transition count 2314
Applied a total of 3 rules in 283 ms. Remains 136 /138 variables (removed 2) and now considering 2314/2315 (removed 1) transitions.
Running 2311 sub problems to find dead transitions.
[2024-05-21 10:31:54] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 10:31:54] [INFO ] Computed 6 invariants in 12 ms
[2024-05-21 10:31:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
[2024-05-21 10:32:22] [INFO ] Deduced a trap composed of 5 places in 311 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2311/2311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 135/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2311 constraints, Known Traps: 1/1 constraints]
After SMT, in 59454ms problems are : Problem set: 0 solved, 2311 unsolved
Search for dead transitions found 0 dead transitions in 59491ms
[2024-05-21 10:32:53] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
[2024-05-21 10:32:53] [INFO ] Invariant cache hit.
[2024-05-21 10:32:54] [INFO ] Implicit Places using invariants in 412 ms returned []
[2024-05-21 10:32:54] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
[2024-05-21 10:32:54] [INFO ] Invariant cache hit.
[2024-05-21 10:32:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:32:55] [INFO ] Implicit Places using invariants and state equation in 787 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1203 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/138 places, 2314/2315 transitions.
Applied a total of 0 rules in 217 ms. Remains 134 /134 variables (removed 0) and now considering 2314/2314 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61212 ms. Remains : 134/138 places, 2314/2315 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03
Stuttering criterion allowed to conclude after 362 steps with 0 reset in 3 ms.
FORMULA BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BridgeAndVehicles-PT-V50P20N20-LTLCardinality-03 finished in 61353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 2315/2315 transitions.
Graph (complete) has 3817 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 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 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 135 transition count 2314
Applied a total of 3 rules in 232 ms. Remains 135 /138 variables (removed 3) and now considering 2314/2315 (removed 1) transitions.
Running 2311 sub problems to find dead transitions.
[2024-05-21 10:32:55] [INFO ] Flow matrix only has 289 transitions (discarded 2025 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 10:32:55] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 10:32:55] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N20

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: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.080s, Sys 0.012s]


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

BK_STOP 1716289290318

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

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