About the Execution of ITS-Tools for MedleyA-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 304907.00 | 0.00 | 0.00 | TFTTTFFFTTTFFFFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524100195.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 MedleyA-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524100195
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 39K 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 MedleyA-PT-13-LTLCardinality-00
FORMULA_NAME MedleyA-PT-13-LTLCardinality-01
FORMULA_NAME MedleyA-PT-13-LTLCardinality-02
FORMULA_NAME MedleyA-PT-13-LTLCardinality-03
FORMULA_NAME MedleyA-PT-13-LTLCardinality-04
FORMULA_NAME MedleyA-PT-13-LTLCardinality-05
FORMULA_NAME MedleyA-PT-13-LTLCardinality-06
FORMULA_NAME MedleyA-PT-13-LTLCardinality-07
FORMULA_NAME MedleyA-PT-13-LTLCardinality-08
FORMULA_NAME MedleyA-PT-13-LTLCardinality-09
FORMULA_NAME MedleyA-PT-13-LTLCardinality-10
FORMULA_NAME MedleyA-PT-13-LTLCardinality-11
FORMULA_NAME MedleyA-PT-13-LTLCardinality-12
FORMULA_NAME MedleyA-PT-13-LTLCardinality-13
FORMULA_NAME MedleyA-PT-13-LTLCardinality-14
FORMULA_NAME MedleyA-PT-13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748866851413
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 12:20:53] [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-02 12:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 12:20:54] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-02 12:20:54] [INFO ] Transformed 173 places.
[2025-06-02 12:20:54] [INFO ] Transformed 159 transitions.
[2025-06-02 12:20:54] [INFO ] Found NUPN structural information;
[2025-06-02 12:20:54] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 350 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA MedleyA-PT-13-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 25 place count 148 transition count 139
Iterating global reduction 1 with 20 rules applied. Total rules applied 45 place count 148 transition count 139
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 146 transition count 137
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 146 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 145 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 145 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 144 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 144 transition count 135
Applied a total of 53 rules in 133 ms. Remains 144 /173 variables (removed 29) and now considering 135/159 (removed 24) transitions.
// Phase 1: matrix 135 rows 144 cols
[2025-06-02 12:20:54] [INFO ] Computed 16 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:55] [INFO ] Implicit Places using invariants in 466 ms returned [31, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 535 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/173 places, 135/159 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 702 ms. Remains : 142/173 places, 135/159 transitions.
Support contains 14 out of 142 places after structural reductions.
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 50 ms
[2025-06-02 12:20:55] [INFO ] Flatten gal took : 24 ms
[2025-06-02 12:20:55] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 33868 steps (964 resets) in 1306 ms. (25 steps per ms) remains 0/9 properties
Computed a total of 9 stabilizing places and 9 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' '!(X(F(p0)))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 133
Applied a total of 4 rules in 10 ms. Remains 140 /142 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:20:56] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:56] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 12:20:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:20:56] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:20:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:00] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:01] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 13 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 157 constraints, problems are : Problem set: 0 solved, 132 unsolved in 12030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/289 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:12] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:12] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:12] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:13] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:13] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:13] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 10 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:16] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 10 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:17] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 10 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:22] [INFO ] Deduced a trap along path composed of 9 places in 92 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:22] [INFO ] Deduced a trap along path composed of 11 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:31] [INFO ] Deduced a trap along path composed of 10 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:33] [INFO ] Deduced a trap along path composed of 11 places in 54 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 2/301 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 301 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 42158ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 42203ms
Starting structural reductions in LTL mode, iteration 1 : 140/142 places, 133/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42723 ms. Remains : 140/142 places, 133/135 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-07
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 4 ms.
FORMULA MedleyA-PT-13-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-07 finished in 43157 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(F((G(F(p0))||(!p1&&F(p0)))))))'
Support contains 3 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 133
Applied a total of 4 rules in 11 ms. Remains 140 /142 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:21:39] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:39] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-02 12:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:21:40] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:21:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:42] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:43] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:43] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:43] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:43] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 159 constraints, problems are : Problem set: 0 solved, 132 unsolved in 12493 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/291 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:56] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:57] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:21:59] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 25 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:03] [INFO ] Deduced a trap along path composed of 9 places in 79 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:03] [INFO ] Deduced a trap along path composed of 12 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:17] [INFO ] Deduced a trap along path composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 42542ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 42544ms
Starting structural reductions in LTL mode, iteration 1 : 140/142 places, 133/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43006 ms. Remains : 140/142 places, 133/135 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-08
Product exploration explored 100000 steps with 3419 reset in 567 ms.
Product exploration explored 100000 steps with 3421 reset in 233 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1130 resets) in 344 ms. (115 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (283 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2025-06-02 12:22:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/140 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:24] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/273 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/36 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/90 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 50/140 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 133/273 variables, 140/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/273 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 273/273 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 219 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 535ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Applied a total of 0 rules in 3 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
[2025-06-02 12:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-06-02 12:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:22:25] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:22:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:28] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:28] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:29] [INFO ] Deduced a trap composed of 74 places in 132 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:29] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:29] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 159 constraints, problems are : Problem set: 0 solved, 132 unsolved in 11121 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/291 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:39] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:39] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:39] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:39] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:40] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 5/296 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:41] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:44] [INFO ] Deduced a trap along path composed of 9 places in 55 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:44] [INFO ] Deduced a trap along path composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:22:58] [INFO ] Deduced a trap along path composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 300 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 41165ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 41169ms
Finished structural reductions in LTL mode , in 1 iterations and 41574 ms. Remains : 140/140 places, 133/133 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 33713 steps (975 resets) in 67 ms. (495 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3489 reset in 148 ms.
Product exploration explored 100000 steps with 3446 reset in 170 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 133/133 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 140 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 30 place count 140 transition count 137
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 54 place count 140 transition count 137
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 139 transition count 137
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 68 place count 126 transition count 124
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 81 place count 126 transition count 124
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 107 place count 126 transition count 125
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 115 place count 118 transition count 117
Deduced a syphon composed of 58 places in 1 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 118 transition count 117
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 118 transition count 171
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 114 transition count 162
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 114 transition count 162
Deduced a syphon composed of 62 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 114 transition count 160
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 141 rules in 68 ms. Remains 114 /140 variables (removed 26) and now considering 160/133 (removed -27) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 12:23:08] [INFO ] Redundant transitions in 6 ms returned []
Running 156 sub problems to find dead transitions.
// Phase 1: matrix 160 rows 114 cols
[2025-06-02 12:23:08] [INFO ] Computed 13 invariants in 3 ms
[2025-06-02 12:23:08] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 6 ms to minimize.
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 6 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 11/24 constraints. Problems are: Problem set: 99 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/24 constraints. Problems are: Problem set: 99 solved, 57 unsolved
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 6 (OVERLAPS) 160/274 variables, 114/138 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 6/144 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/144 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/144 constraints. Problems are: Problem set: 101 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 144 constraints, problems are : Problem set: 101 solved, 55 unsolved in 5970 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/114 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 101 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 43/94 variables, 9/9 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 11/20 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/20 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 19/113 variables, 4/24 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 160/273 variables, 113/137 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 6/143 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 55/198 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/198 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/274 variables, 1/199 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/199 constraints. Problems are: Problem set: 101 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/274 variables, 0/199 constraints. Problems are: Problem set: 101 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 199 constraints, problems are : Problem set: 101 solved, 55 unsolved in 12758 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 114/114 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 55/156 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18778ms problems are : Problem set: 101 solved, 55 unsolved
Search for dead transitions found 101 dead transitions in 18779ms
Found 101 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 101 transitions
Dead transitions reduction (with SMT) removed 101 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/140 places, 59/133 transitions.
Graph (complete) has 153 edges and 114 vertex of which 52 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.2 ms
Discarding 62 places :
Also discarding 0 output transitions
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 51 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 51 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 51 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 5 rules in 15 ms. Remains 51 /114 variables (removed 63) and now considering 72/59 (removed -13) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/140 places, 72/133 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 18879 ms. Remains : 51/140 places, 72/133 transitions.
Built C files in :
/tmp/ltsmin6120631632629596954
[2025-06-02 12:23:27] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6120631632629596954
Running compilation step : cd /tmp/ltsmin6120631632629596954;'/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 551 ms.
Running link step : cd /tmp/ltsmin6120631632629596954;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin6120631632629596954;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12627777069654036735.hoa' '--buchi-type=spotba'
LTSmin run took 10411 ms.
FORMULA MedleyA-PT-13-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLCardinality-08 finished in 119095 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(X(((F(X((X(X(p0)) U p0))) U p1)||F(G(p2))))))'
Support contains 5 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 139 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 139 transition count 132
Applied a total of 6 rules in 6 ms. Remains 139 /142 variables (removed 3) and now considering 132/135 (removed 3) transitions.
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:23:38] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:23:38] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-02 12:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:23:39] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:23:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:42] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:42] [INFO ] Deduced a trap composed of 15 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-02 12:23:42] [INFO ] Deduced a trap composed of 22 places in 145 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:43] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:47] [INFO ] Deduced a trap along path composed of 8 places in 65 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:48] [INFO ] Deduced a trap along path composed of 9 places in 37 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14717 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:55] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:55] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:57] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:23:57] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:04] [INFO ] Deduced a trap along path composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:15] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/271 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 44747ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 44749ms
Starting structural reductions in LTL mode, iteration 1 : 139/142 places, 132/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45117 ms. Remains : 139/142 places, 132/135 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-09
Product exploration explored 100000 steps with 2854 reset in 224 ms.
Product exploration explored 100000 steps with 2859 reset in 117 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (X p1)), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1133 resets) in 127 ms. (312 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (338 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2025-06-02 12:24:24] [INFO ] Invariant cache hit.
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, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 55/59 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 31/90 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 49/139 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/271 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 59/271 variables, and 6 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 6/9 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/139 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p1), (X (X p1)), (X (X p2)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p1 (NOT p2)))), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 109 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 138 transition count 104
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 111 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 110 transition count 102
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 57 place count 110 transition count 77
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 108 place count 84 transition count 77
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 109 place count 84 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 110 place count 83 transition count 76
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 150 place count 63 transition count 56
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 164 place count 56 transition count 68
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 56 transition count 67
Applied a total of 165 rules in 24 ms. Remains 56 /139 variables (removed 83) and now considering 67/132 (removed 65) transitions.
// Phase 1: matrix 67 rows 56 cols
[2025-06-02 12:24:25] [INFO ] Computed 13 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:25] [INFO ] Implicit Places using invariants in 93 ms returned [0, 15, 30, 35]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 94 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/139 places, 67/132 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 52 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 50 transition count 65
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 50 transition count 61
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 46 transition count 61
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 2 with 2 rules applied. Total rules applied 14 place count 45 transition count 60
Applied a total of 14 rules in 8 ms. Remains 45 /52 variables (removed 7) and now considering 60/67 (removed 7) transitions.
// Phase 1: matrix 60 rows 45 cols
[2025-06-02 12:24:25] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-02 12:24:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 12:24:25] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/139 places, 60/132 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 298 ms. Remains : 45/139 places, 60/132 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 5 factoid took 238 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 446 steps (54 resets) in 11 ms. (37 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT p2))]
Knowledge based reduction with 5 factoid took 387 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[false, (AND p1 (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 12536 reset in 143 ms.
Product exploration explored 100000 steps with 12615 reset in 237 ms.
Built C files in :
/tmp/ltsmin10002693308693147057
[2025-06-02 12:24:27] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2025-06-02 12:24:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:24:27] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2025-06-02 12:24:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:24:27] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2025-06-02 12:24:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 12:24:27] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10002693308693147057
Running compilation step : cd /tmp/ltsmin10002693308693147057;'/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 226 ms.
Running link step : cd /tmp/ltsmin10002693308693147057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10002693308693147057;'/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/stateBased12041811179435489708.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA MedleyA-PT-13-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLCardinality-09 finished in 49041 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))'
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 140 transition count 133
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 140 transition count 133
Applied a total of 4 rules in 3 ms. Remains 140 /142 variables (removed 2) and now considering 133/135 (removed 2) transitions.
// Phase 1: matrix 133 rows 140 cols
[2025-06-02 12:24:27] [INFO ] Computed 14 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:27] [INFO ] Implicit Places using invariants in 127 ms returned []
[2025-06-02 12:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:24:27] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-02 12:24:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:30] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:30] [INFO ] Deduced a trap composed of 15 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-02 12:24:30] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:34] [INFO ] Deduced a trap along path composed of 8 places in 69 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:34] [INFO ] Deduced a trap along path composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 9 (OVERLAPS) 0/273 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 159 constraints, problems are : Problem set: 0 solved, 132 unsolved in 13577 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/140 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 133/273 variables, 140/157 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/273 variables, 132/289 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:44] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:44] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:44] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 17 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 3/292 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:47] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/273 variables, 2/295 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:53] [INFO ] Deduced a trap along path composed of 14 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:24:55] [INFO ] Deduced a trap along path composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/273 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/273 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 297 constraints, problems are : Problem set: 0 solved, 132 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 140/140 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43602ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 43603ms
Starting structural reductions in LTL mode, iteration 1 : 140/142 places, 133/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43911 ms. Remains : 140/142 places, 133/135 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLCardinality-10 finished in 44497 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(X(X(X(X(G(p0)))))))))'
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 139 transition count 132
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 139 transition count 132
Applied a total of 6 rules in 4 ms. Remains 139 /142 variables (removed 3) and now considering 132/135 (removed 3) transitions.
// Phase 1: matrix 132 rows 139 cols
[2025-06-02 12:25:12] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:12] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 12:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:12] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2025-06-02 12:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:15] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:15] [INFO ] Deduced a trap composed of 15 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-02 12:25:15] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:16] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:20] [INFO ] Deduced a trap along path composed of 8 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:20] [INFO ] Deduced a trap along path composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/271 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 159 constraints, problems are : Problem set: 0 solved, 131 unsolved in 13214 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/157 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/288 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:28] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:28] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 2/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:30] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:31] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:40] [INFO ] Deduced a trap along path composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 12:25:52] [INFO ] Deduced a trap along path composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43236ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 43237ms
Starting structural reductions in LTL mode, iteration 1 : 139/142 places, 132/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43555 ms. Remains : 139/142 places, 132/135 transitions.
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-13 finished in 43850 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(G(p0)))'
Support contains 1 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 141 transition count 104
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 111 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 110 transition count 102
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 63 place count 110 transition count 73
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 122 place count 80 transition count 73
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 124 place count 79 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 78 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 77 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 77 transition count 71
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 175 place count 53 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 191 place count 45 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 192 place count 45 transition count 62
Applied a total of 192 rules in 26 ms. Remains 45 /142 variables (removed 97) and now considering 62/135 (removed 73) transitions.
// Phase 1: matrix 62 rows 45 cols
[2025-06-02 12:25:56] [INFO ] Computed 12 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:56] [INFO ] Implicit Places using invariants in 63 ms returned [0, 10, 17, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 65 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/142 places, 62/135 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 41 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 58
Applied a total of 8 rules in 4 ms. Remains 37 /41 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 37 cols
[2025-06-02 12:25:56] [INFO ] Computed 8 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:56] [INFO ] Implicit Places using invariants in 53 ms returned []
[2025-06-02 12:25:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 12:25:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-02 12:25:56] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/142 places, 58/135 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 37/142 places, 58/135 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-15 finished in 278 ms.
All properties solved by simple procedures.
Total runtime 302347 ms.
BK_STOP 1748867156320
--------------------
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="MedleyA-PT-13"
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 MedleyA-PT-13, 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 r128-smll-174876524100195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-13.tgz
mv MedleyA-PT-13 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 ;