About the Execution of ITS-Tools for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 46860.00 | 0.00 | 0.00 | TFFFFFFTTFFTFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r184-tall-174889264800763.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is SafeBus-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-tall-174889264800763
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 13K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 95K May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SafeBus-PT-03-LTLCardinality-00
FORMULA_NAME SafeBus-PT-03-LTLCardinality-01
FORMULA_NAME SafeBus-PT-03-LTLCardinality-02
FORMULA_NAME SafeBus-PT-03-LTLCardinality-03
FORMULA_NAME SafeBus-PT-03-LTLCardinality-04
FORMULA_NAME SafeBus-PT-03-LTLCardinality-05
FORMULA_NAME SafeBus-PT-03-LTLCardinality-06
FORMULA_NAME SafeBus-PT-03-LTLCardinality-07
FORMULA_NAME SafeBus-PT-03-LTLCardinality-08
FORMULA_NAME SafeBus-PT-03-LTLCardinality-09
FORMULA_NAME SafeBus-PT-03-LTLCardinality-10
FORMULA_NAME SafeBus-PT-03-LTLCardinality-11
FORMULA_NAME SafeBus-PT-03-LTLCardinality-12
FORMULA_NAME SafeBus-PT-03-LTLCardinality-13
FORMULA_NAME SafeBus-PT-03-LTLCardinality-14
FORMULA_NAME SafeBus-PT-03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749180427047
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 03:27:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 03:27:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 03:27:08] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2025-06-06 03:27:08] [INFO ] Transformed 57 places.
[2025-06-06 03:27:08] [INFO ] Transformed 91 transitions.
[2025-06-06 03:27:08] [INFO ] Found NUPN structural information;
[2025-06-06 03:27:08] [INFO ] Parsed PT model containing 57 places and 91 transitions and 541 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-PT-03-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-06 03:27:08] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-06 03:27:08] [INFO ] Computed 17 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:08] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-06 03:27:08] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-06 03:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:08] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:08] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-06 03:27:08] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-06 03:27:08] [INFO ] Invariant cache hit.
[2025-06-06 03:27:08] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:09] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:09] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:09] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:09] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:09] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 12/83 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:10] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 152 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3733 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 14/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/231 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/231 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:16] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/122 variables, 1/232 constraints. Problems are: Problem set: 9 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:16] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 1/233 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/233 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/233 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 233 constraints, problems are : Problem set: 9 solved, 79 unsolved in 7736 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11588ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 11608ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 11982 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 30 out of 54 places after structural reductions.
[2025-06-06 03:27:20] [INFO ] Flatten gal took : 28 ms
[2025-06-06 03:27:20] [INFO ] Flatten gal took : 12 ms
[2025-06-06 03:27:20] [INFO ] Input system was already deterministic with 82 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (8 resets) in 1135 ms. (35 steps per ms) remains 3/24 properties
BEST_FIRST walk for 40002 steps (8 resets) in 253 ms. (157 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 3/3 properties
[2025-06-06 03:27:21] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-06 03:27:21] [INFO ] Computed 17 invariants in 3 ms
[2025-06-06 03:27:21] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 2 (OVERLAPS) 21/30 variables, 4/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 21/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 1/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/51 variables, 10/46 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 20/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:21] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/52 variables, 1/68 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 67/119 variables, 52/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/119 variables, 12/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/119 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/122 variables, 2/135 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/122 variables, 2/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/122 variables, 1/138 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/122 variables, 1/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/122 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/122 variables, 0/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 139 constraints, problems are : Problem set: 2 solved, 1 unsolved in 169 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 15/18 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 15/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/29 variables, 1/22 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/34 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/35 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 21/51 variables, 10/45 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 21/66 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/52 variables, 1/68 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/52 variables, 1/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/52 variables, 0/69 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 67/119 variables, 52/121 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/119 variables, 12/133 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/119 variables, 1/134 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/119 variables, 1/135 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/119 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/122 variables, 2/137 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/122 variables, 2/139 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/122 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/122 variables, 1/141 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:21] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 4 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/122 variables, 1/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/122 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/122 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 142 constraints, problems are : Problem set: 2 solved, 1 unsolved in 207 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 387ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 54/54 places, 82/82 transitions.
RANDOM walk for 40000 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4650 states, properties seen :0
Probabilistic random walk after 17538 steps, saw 4650 distinct states, run finished after 44 ms. (steps per millisecond=398 ) properties seen :0
Explored full state space saw : 4650 states, properties seen :0
Exhaustive walk after 17538 steps, saw 4650 distinct states, run finished after 20 ms. (steps per millisecond=876 ) properties seen :0
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA SafeBus-PT-03-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-PT-03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)&&X((p1&&F(G(p1))))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:22] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-06 03:27:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:22] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:22] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2025-06-06 03:27:22] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:22] [INFO ] Invariant cache hit.
[2025-06-06 03:27:22] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:22] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 9/80 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:23] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 68/122 variables, 54/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 13/151 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:24] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 152 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3263 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/139 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/231 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:26] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 232 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3948 ms.
Refiners :[Domain max(s): 54/54 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7239ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7240ms
Finished structural reductions in LTL mode , in 1 iterations and 7440 ms. Remains : 54/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA SafeBus-PT-03-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-03 finished in 7770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(G(p0)) U p1) U X(G(p2)))))'
Support contains 6 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:29] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:30] [INFO ] Implicit Places using invariants in 79 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 82 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-04
Product exploration explored 100000 steps with 4 reset in 226 ms.
Stack based approach found an accepted trace after 182 steps with 16 reset with depth 103 and stack size 103 in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-04 finished in 564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:30] [INFO ] Implicit Places using invariants in 81 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 82 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 85
Applied a total of 6 rules in 9 ms. Remains 48 /51 variables (removed 3) and now considering 85/82 (removed -3) transitions.
[2025-06-06 03:27:30] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
// Phase 1: matrix 71 rows 48 cols
[2025-06-06 03:27:30] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-06 03:27:30] [INFO ] Flow matrix only has 71 transitions (discarded 14 similar events)
[2025-06-06 03:27:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:30] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/54 places, 85/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 48/54 places, 85/82 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 6406 reset in 161 ms.
Stack based approach found an accepted trace after 55 steps with 3 reset with depth 23 and stack size 23 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-06 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 8 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:31] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-06 03:27:31] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:31] [INFO ] Implicit Places using invariants in 80 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 79
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 79
Applied a total of 6 rules in 18 ms. Remains 48 /51 variables (removed 3) and now considering 79/82 (removed 3) transitions.
[2025-06-06 03:27:31] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
// Phase 1: matrix 65 rows 48 cols
[2025-06-06 03:27:31] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:31] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-06 03:27:31] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2025-06-06 03:27:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:31] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/54 places, 79/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 48/54 places, 79/82 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-07
Product exploration explored 100000 steps with 7890 reset in 120 ms.
Product exploration explored 100000 steps with 7854 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 79/79 transitions.
Applied a total of 0 rules in 8 ms. Remains 48 /48 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2025-06-06 03:27:32] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2025-06-06 03:27:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-06 03:27:32] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2025-06-06 03:27:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:32] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:27:32] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2025-06-06 03:27:32] [INFO ] Flow matrix only has 65 transitions (discarded 14 similar events)
[2025-06-06 03:27:32] [INFO ] Invariant cache hit.
[2025-06-06 03:27:32] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:32] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:33] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:33] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:33] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/113 variables, 48/125 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:34] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:34] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 4 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/113 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 140 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3267 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 9/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/113 variables, 48/127 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 13/140 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 76/216 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:36] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 217 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3942 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7226ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7227ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7397 ms. Remains : 48/48 places, 79/79 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 20 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7901 reset in 116 ms.
Product exploration explored 100000 steps with 7839 reset in 142 ms.
Built C files in :
/tmp/ltsmin6590232900852326516
[2025-06-06 03:27:40] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2025-06-06 03:27:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 03:27:40] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2025-06-06 03:27:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 03:27:40] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2025-06-06 03:27:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 03:27:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6590232900852326516
Running compilation step : cd /tmp/ltsmin6590232900852326516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 278 ms.
Running link step : cd /tmp/ltsmin6590232900852326516;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6590232900852326516;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6162426734786629190.hoa' '--buchi-type=spotba'
LTSmin run took 421 ms.
FORMULA SafeBus-PT-03-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SafeBus-PT-03-LTLCardinality-07 finished in 10022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((F(p1)&&F(G(p2))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:41] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-06 03:27:41] [INFO ] Computed 17 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:41] [INFO ] Implicit Places using invariants in 82 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 83 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 51 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 49 transition count 80
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 0 with 2 rules applied. Total rules applied 6 place count 48 transition count 81
Applied a total of 6 rules in 6 ms. Remains 48 /51 variables (removed 3) and now considering 81/82 (removed 1) transitions.
[2025-06-06 03:27:41] [INFO ] Flow matrix only has 67 transitions (discarded 14 similar events)
// Phase 1: matrix 67 rows 48 cols
[2025-06-06 03:27:41] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:41] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-06 03:27:41] [INFO ] Flow matrix only has 67 transitions (discarded 14 similar events)
[2025-06-06 03:27:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:41] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/54 places, 81/82 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 258 ms. Remains : 48/54 places, 81/82 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-09
Product exploration explored 100000 steps with 3 reset in 160 ms.
Stack based approach found an accepted trace after 85 steps with 1 reset with depth 57 and stack size 57 in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-09 finished in 630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((p0&&F(!p1))))) U (F(p1)||p2))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:41] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-06 03:27:41] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:41] [INFO ] Implicit Places using invariants in 78 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 22 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SafeBus-PT-03-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SafeBus-PT-03-LTLCardinality-11 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&G(p1))))))'
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:42] [INFO ] Implicit Places using invariants in 78 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 94 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA SafeBus-PT-03-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-12 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(F(X(F(!X(X(p0))))))) U p1))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:42] [INFO ] Implicit Places using invariants in 83 ms returned [42, 43, 44]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 51/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA SafeBus-PT-03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-13 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X((G(p1)||(p1&&F(!p2)))))))'
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:42] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:42] [INFO ] Implicit Places using invariants in 76 ms returned [42, 43]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/54 places, 82/82 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 52/54 places, 82/82 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2)]
Running random walk in product with property : SafeBus-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 9013 reset in 127 ms.
Product exploration explored 100000 steps with 8989 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 407 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 7 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40001 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
[2025-06-06 03:27:44] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 52 cols
[2025-06-06 03:27:44] [INFO ] Computed 15 invariants in 1 ms
[2025-06-06 03:27:44] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/43 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 32/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/50 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/50 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/50 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 67/117 variables, 50/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 12/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/117 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/120 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/120 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/120 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/120 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 132 constraints, problems are : Problem set: 0 solved, 2 unsolved in 167 ms.
Refiners :[Domain max(s): 52/52 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/11 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 43/120 variables, and 20 constraints, problems are : Problem set: 2 solved, 0 unsolved in 35 ms.
Refiners :[Domain max(s): 11/52 constraints, Positive P Invariants (semi-flows): 2/6 constraints, Generalized P Invariants (flows): 7/9 constraints, State Equation: 0/52 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 211ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p1 p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p2) p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1)))), (F p1)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 617 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2025-06-06 03:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 03:27:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-06 03:27:45] [INFO ] [Real]Absence check using 6 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-06 03:27:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-06-06 03:27:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 03:27:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2025-06-06 03:27:45] [INFO ] [Nat]Absence check using 6 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-06 03:27:45] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-06 03:27:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:45] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2025-06-06 03:27:45] [INFO ] Computed and/alt/rep : 52/273/52 causal constraints (skipped 13 transitions) in 7 ms.
[2025-06-06 03:27:45] [INFO ] Added : 35 causal constraints over 7 iterations in 74 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 82/82 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 52 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 48 transition count 82
Applied a total of 8 rules in 8 ms. Remains 48 /52 variables (removed 4) and now considering 82/82 (removed 0) transitions.
[2025-06-06 03:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 48 cols
[2025-06-06 03:27:45] [INFO ] Computed 15 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:45] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-06 03:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 03:27:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 03:27:45] [INFO ] Redundant transitions in 2 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-06 03:27:45] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:45] [INFO ] Invariant cache hit.
[2025-06-06 03:27:45] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:45] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 12/75 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:46] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/116 variables, 48/124 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 13/137 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:47] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 138 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3068 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 03:27:48] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 68/116 variables, 48/126 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 79/218 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/116 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 218 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3683 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 48/48 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6786ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6787ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/52 places, 82/82 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6967 ms. Remains : 48/52 places, 82/82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND p2 p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND p2 p1))), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2025-06-06 03:27:53] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-06 03:27:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 03:27:53] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2025-06-06 03:27:53] [INFO ] [Real]Absence check using 5 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-06 03:27:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-06 03:27:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 03:27:53] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2025-06-06 03:27:53] [INFO ] [Nat]Absence check using 5 positive and 10 generalized place invariants in 7 ms returned sat
[2025-06-06 03:27:53] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2025-06-06 03:27:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-06 03:27:53] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-06 03:27:53] [INFO ] Computed and/alt/rep : 42/253/42 causal constraints (skipped 23 transitions) in 6 ms.
[2025-06-06 03:27:53] [INFO ] Added : 11 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 6711 reset in 145 ms.
Stack based approach found an accepted trace after 5869 steps with 400 reset with depth 19 and stack size 19 in 11 ms.
FORMULA SafeBus-PT-03-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SafeBus-PT-03-LTLCardinality-15 finished in 11158 ms.
All properties solved by simple procedures.
Total runtime 45610 ms.
BK_STOP 1749180473907
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="SafeBus-PT-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SafeBus-PT-03, 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 r184-tall-174889264800763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "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 ;