About the Execution of ITS-Tools for DiscoveryGPU-PT-08a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 92374.00 | 0.00 | 0.00 | FTFFFFFFFTTFFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r058-smll-174854064500643.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 DiscoveryGPU-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854064500643
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K 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.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K 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.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K 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 DiscoveryGPU-PT-08a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-08a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748917750069
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-03 02:29:12] [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-03 02:29:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 02:29:13] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2025-06-03 02:29:13] [INFO ] Transformed 83 places.
[2025-06-03 02:29:13] [INFO ] Transformed 113 transitions.
[2025-06-03 02:29:13] [INFO ] Found NUPN structural information;
[2025-06-03 02:29:13] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 517 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 77 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 77 transition count 107
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 20 place count 77 transition count 99
Applied a total of 20 rules in 40 ms. Remains 77 /83 variables (removed 6) and now considering 99/113 (removed 14) transitions.
// Phase 1: matrix 99 rows 77 cols
[2025-06-03 02:29:13] [INFO ] Computed 2 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:13] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-03 02:29:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:13] [INFO ] State equation strengthened by 63 read => feed constraints.
[2025-06-03 02:29:14] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 98 sub problems to find dead transitions.
[2025-06-03 02:29:14] [INFO ] Invariant cache hit.
[2025-06-03 02:29:14] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/176 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 63/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 142 constraints, problems are : Problem set: 0 solved, 98 unsolved in 6281 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (OVERLAPS) 99/176 variables, 77/79 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 63/142 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 98/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/176 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 176/176 variables, and 240 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10622ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 10639ms
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 99/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11424 ms. Remains : 77/83 places, 99/113 transitions.
Support contains 28 out of 77 places after structural reductions.
[2025-06-03 02:29:25] [INFO ] Flatten gal took : 39 ms
[2025-06-03 02:29:25] [INFO ] Flatten gal took : 19 ms
[2025-06-03 02:29:25] [INFO ] Input system was already deterministic with 99 transitions.
RANDOM walk for 40000 steps (463 resets) in 1052 ms. (37 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40002 steps (8 resets) in 431 ms. (92 steps per ms) remains 1/1 properties
[2025-06-03 02:29:25] [INFO ] Invariant cache hit.
[2025-06-03 02:29:25] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/32 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 27/59 variables, 14/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 31/90 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 12/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 29/119 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/119 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/119 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 21/140 variables, 11/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/140 variables, 10/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/140 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/154 variables, 6/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/154 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/154 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/160 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/160 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/160 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/164 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/164 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/164 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/168 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/168 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 4/172 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/172 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/172 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 4/176 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/176 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 176/176 variables, and 142 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 63/63 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
At refinement iteration 1 (OVERLAPS) 10/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/32 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Int declared 59/176 variables, and 39 constraints, problems are : Problem set: 1 solved, 0 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 26/77 constraints, ReadFeed: 13/63 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 319ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 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 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 71 vertex of which 57 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Graph (trivial) has 62 edges and 57 vertex of which 30 / 57 are part of one of the 15 SCC in 2 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 42 transition count 73
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 36 place count 34 transition count 58
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 42 place count 28 transition count 46
Iterating global reduction 2 with 6 rules applied. Total rules applied 48 place count 28 transition count 46
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 22 transition count 34
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 22 transition count 34
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 16 transition count 22
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 16 transition count 22
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 10 transition count 16
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 88 place count 8 transition count 14
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 6 transition count 11
Applied a total of 91 rules in 31 ms. Remains 6 /77 variables (removed 71) and now considering 11/99 (removed 88) transitions.
[2025-06-03 02:29:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
// Phase 1: matrix 9 rows 6 cols
[2025-06-03 02:29:26] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 02:29:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 02:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:29:26] [INFO ] Redundant transitions in 1 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 02:29:26] [INFO ] Flow matrix only has 9 transitions (discarded 2 similar events)
[2025-06-03 02:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/14 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 88 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/14 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/15 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 105 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 197ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/77 places, 11/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 6/77 places, 11/99 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-00
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-00 finished in 587 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(p0))&&F(!p0)))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 64 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 64 transition count 86
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 62 transition count 84
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 62 transition count 84
Applied a total of 30 rules in 10 ms. Remains 62 /77 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:29:26] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:26] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-03 02:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:29:27] [INFO ] Implicit Places using invariants and state equation in 155 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 213 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/77 places, 84/99 transitions.
Applied a total of 0 rules in 12 ms. Remains 61 /61 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 61/77 places, 84/99 transitions.
Stuttering acceptance computed with spot in 251 ms :[true, true, true, (NOT p0), p0, (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-02 finished in 508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 71 vertex of which 56 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 62 edges and 56 vertex of which 32 / 56 are part of one of the 16 SCC in 1 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 40 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 42 place count 26 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 49 place count 26 transition count 43
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 20 transition count 31
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 20 transition count 31
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 14 transition count 19
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 14 transition count 19
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 8 transition count 13
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 8 transition count 13
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 87 place count 7 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 5 transition count 8
Applied a total of 91 rules in 18 ms. Remains 5 /77 variables (removed 72) and now considering 8/99 (removed 91) transitions.
[2025-06-03 02:29:27] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
// Phase 1: matrix 6 rows 5 cols
[2025-06-03 02:29:27] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-03 02:29:27] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 02:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:27] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:29:27] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 02:29:27] [INFO ] Flow matrix only has 6 transitions (discarded 2 similar events)
[2025-06-03 02:29: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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 57 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 60 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/77 places, 8/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 5/77 places, 8/99 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-03 finished in 256 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((p0 U X(X(p1)))) U !(F(p3)||p2)))'
Support contains 5 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 72 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 72 transition count 94
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 68 transition count 90
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 68 transition count 90
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 67 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 67 transition count 89
Applied a total of 20 rules in 8 ms. Remains 67 /77 variables (removed 10) and now considering 89/99 (removed 10) transitions.
// Phase 1: matrix 89 rows 67 cols
[2025-06-03 02:29:27] [INFO ] Computed 2 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-03 02:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:29:27] [INFO ] Implicit Places using invariants and state equation in 190 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 258 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/77 places, 89/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 89/89 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 270 ms. Remains : 66/77 places, 89/99 transitions.
Stuttering acceptance computed with spot in 510 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (AND p1 (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-04
Stuttering criterion allowed to conclude after 139 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-04 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 74 transition count 91
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 69 transition count 91
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 64 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 64 transition count 86
Applied a total of 21 rules in 26 ms. Remains 64 /77 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:29:28] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-03 02:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:28] [INFO ] State equation strengthened by 59 read => feed constraints.
[2025-06-03 02:29:28] [INFO ] Implicit Places using invariants and state equation in 195 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 280 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/77 places, 86/99 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 47 transition count 70
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 42 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 42 transition count 60
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 37 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 37 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 32 transition count 45
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 32 transition count 45
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 27 transition count 35
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 27 transition count 35
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 23 transition count 31
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 23 transition count 31
Applied a total of 80 rules in 15 ms. Remains 23 /63 variables (removed 40) and now considering 31/86 (removed 55) transitions.
[2025-06-03 02:29:28] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
// Phase 1: matrix 26 rows 23 cols
[2025-06-03 02:29:28] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:28] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-03 02:29:28] [INFO ] Flow matrix only has 26 transitions (discarded 5 similar events)
[2025-06-03 02:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:28] [INFO ] State equation strengthened by 20 read => feed constraints.
[2025-06-03 02:29:28] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/77 places, 31/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 418 ms. Remains : 23/77 places, 31/99 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-05
Stuttering criterion allowed to conclude after 134 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-05 finished in 572 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' '!((p0 U X(G(!p0))))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 71 vertex of which 56 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 59 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 34 transition count 58
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 41 place count 27 transition count 44
Iterating global reduction 2 with 7 rules applied. Total rules applied 48 place count 27 transition count 44
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 54 place count 21 transition count 32
Iterating global reduction 2 with 6 rules applied. Total rules applied 60 place count 21 transition count 32
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 15 transition count 20
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 15 transition count 20
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 9 transition count 14
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 9 transition count 14
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 86 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 8 transition count 11
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 8 transition count 11
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 7 transition count 10
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 7 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 6 transition count 9
Applied a total of 92 rules in 10 ms. Remains 6 /77 variables (removed 71) and now considering 9/99 (removed 90) transitions.
[2025-06-03 02:29:29] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
// Phase 1: matrix 8 rows 6 cols
[2025-06-03 02:29:29] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:29] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-03 02:29:29] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-03 02:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:29] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:29:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 02:29:29] [INFO ] Flow matrix only has 8 transitions (discarded 1 similar events)
[2025-06-03 02:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 87 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 100 ms.
Refiners :[State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/77 places, 9/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 6/77 places, 9/99 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, true, p0]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-06 finished in 359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G(!p1))||G(p0))))'
Support contains 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 66 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 64 transition count 86
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 64 transition count 86
Applied a total of 26 rules in 5 ms. Remains 64 /77 variables (removed 13) and now considering 86/99 (removed 13) transitions.
// Phase 1: matrix 86 rows 64 cols
[2025-06-03 02:29:29] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-03 02:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:29] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:29:29] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/77 places, 86/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 63/77 places, 86/99 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-08
Product exploration explored 100000 steps with 1551 reset in 510 ms.
Stack based approach found an accepted trace after 128 steps with 1 reset with depth 51 and stack size 49 in 2 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-08 finished in 968 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((p0&&F((p0&&G(p1)))))||G((p2 U p3))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 71 vertex of which 59 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 60 edges and 59 vertex of which 30 / 59 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 44 transition count 76
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 37 transition count 61
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 32 transition count 51
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 32 transition count 51
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 27 transition count 41
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 27 transition count 41
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 24 transition count 35
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 24 transition count 35
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 21 transition count 32
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 21 transition count 32
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 19 transition count 30
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 72 place count 18 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 18 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 18 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 17 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 13 transition count 23
Applied a total of 82 rules in 13 ms. Remains 13 /77 variables (removed 64) and now considering 23/99 (removed 76) transitions.
[2025-06-03 02:29:30] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
// Phase 1: matrix 17 rows 13 cols
[2025-06-03 02:29:30] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:30] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-03 02:29:30] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2025-06-03 02:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:30] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:29:30] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2025-06-03 02:29:30] [INFO ] Flow matrix only has 17 transitions (discarded 6 similar events)
[2025-06-03 02:29:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 7/29 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 212 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 7/29 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 231 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/77 places, 23/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 542 ms. Remains : 13/77 places, 23/99 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-12 finished in 1000 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' '!((!p0 U X(G(p1))))'
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 71 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 66 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 65 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 65 transition count 87
Applied a total of 24 rules in 5 ms. Remains 65 /77 variables (removed 12) and now considering 87/99 (removed 12) transitions.
// Phase 1: matrix 87 rows 65 cols
[2025-06-03 02:29:31] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:31] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-06-03 02:29:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:29:31] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-03 02:29:31] [INFO ] Invariant cache hit.
[2025-06-03 02:29:31] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4129 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4390 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8541ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 8544ms
Starting structural reductions in LTL mode, iteration 1 : 65/77 places, 87/99 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8821 ms. Remains : 65/77 places, 87/99 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-13
Product exploration explored 100000 steps with 1166 reset in 406 ms.
Product exploration explored 100000 steps with 1160 reset in 404 ms.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 164 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
[2025-06-03 02:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:29:41] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 02:29:41] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-06-03 02:29:41] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:29:41] [INFO ] [Real]Added 58 Read/Feed constraints in 12 ms returned sat
[2025-06-03 02:29:41] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 10 ms.
[2025-06-03 02:29:41] [INFO ] Added : 0 causal constraints over 0 iterations in 30 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 65 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2025-06-03 02:29:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-03 02:29:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:29:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:29:42] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 86 sub problems to find dead transitions.
[2025-06-03 02:29:42] [INFO ] Invariant cache hit.
[2025-06-03 02:29:42] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 0/152 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 125 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2646 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (OVERLAPS) 87/152 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 58/125 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/152 variables, 86/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/152 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 211 constraints, problems are : Problem set: 0 solved, 86 unsolved in 3233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 65/65 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5891ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 5894ms
Finished structural reductions in LTL mode , in 1 iterations and 6183 ms. Remains : 65/65 places, 87/87 transitions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 11 stabilizing places and 9 stable transitions
Detected a total of 11/65 stabilizing places and 9/87 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p1), (NOT p1)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
[2025-06-03 02:29:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 02:29:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 02:29:49] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2025-06-03 02:29:49] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:29:49] [INFO ] [Real]Added 58 Read/Feed constraints in 11 ms returned sat
[2025-06-03 02:29:49] [INFO ] Computed and/alt/rep : 86/166/86 causal constraints (skipped 0 transitions) in 12 ms.
[2025-06-03 02:29:49] [INFO ] Added : 0 causal constraints over 0 iterations in 33 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1161 reset in 133 ms.
Product exploration explored 100000 steps with 1158 reset in 331 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (NOT p1)]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Graph (complete) has 198 edges and 65 vertex of which 63 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 63 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 63 transition count 85
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 61 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 7 rules in 14 ms. Remains 61 /65 variables (removed 4) and now considering 83/87 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 02:29:50] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 61 cols
[2025-06-03 02:29:50] [INFO ] Computed 2 invariants in 1 ms
[2025-06-03 02:29:50] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem TDEAD70 is UNSAT
At refinement iteration 3 (OVERLAPS) 83/144 variables, 61/63 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 58/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/144 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 121 constraints, problems are : Problem set: 1 solved, 81 unsolved in 2716 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 81 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 82/142 variables, 60/62 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 57/119 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 81/200 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 1/143 variables, 1/201 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 0/201 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/144 variables, 1/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/144 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/144 variables, 0/202 constraints. Problems are: Problem set: 1 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 202 constraints, problems are : Problem set: 1 solved, 81 unsolved in 4577 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 81/82 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7306ms problems are : Problem set: 1 solved, 81 unsolved
Search for dead transitions found 1 dead transitions in 7307ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/65 places, 82/87 transitions.
Graph (complete) has 190 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 60 /61 variables (removed 1) and now considering 82/82 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/65 places, 82/87 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7332 ms. Remains : 60/65 places, 82/87 transitions.
Built C files in :
/tmp/ltsmin5050696245831176980
[2025-06-03 02:29:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5050696245831176980
Running compilation step : cd /tmp/ltsmin5050696245831176980;'/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 631 ms.
Running link step : cd /tmp/ltsmin5050696245831176980;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin5050696245831176980;'/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/stateBased8982021710106213277.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 87/87 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 86
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 63 transition count 85
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 63 transition count 85
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 62 transition count 84
Applied a total of 6 rules in 3 ms. Remains 62 /65 variables (removed 3) and now considering 84/87 (removed 3) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:30:12] [INFO ] Computed 2 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:12] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-03 02:30:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:12] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:30:12] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-03 02:30:12] [INFO ] Invariant cache hit.
[2025-06-03 02:30:12] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/146 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 121 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3360 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 84/146 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 83/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 0/146 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 204 constraints, problems are : Problem set: 0 solved, 83 unsolved in 4071 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7442ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 7452ms
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 84/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7691 ms. Remains : 62/65 places, 84/87 transitions.
Built C files in :
/tmp/ltsmin7492210483605238366
[2025-06-03 02:30:20] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7492210483605238366
Running compilation step : cd /tmp/ltsmin7492210483605238366;'/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 357 ms.
Running link step : cd /tmp/ltsmin7492210483605238366;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin7492210483605238366;'/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/stateBased12171116072776404589.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 02:30:35] [INFO ] Flatten gal took : 15 ms
[2025-06-03 02:30:35] [INFO ] Flatten gal took : 11 ms
[2025-06-03 02:30:35] [INFO ] Time to serialize gal into /tmp/LTL2917277819927853599.gal : 7 ms
[2025-06-03 02:30:35] [INFO ] Time to serialize properties into /tmp/LTL3587864889796107007.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2917277819927853599.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12576793870970222423.hoa' '-atoms' '/tmp/LTL3587864889796107007.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3587864889796107007.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12576793870970222423.hoa
Reverse transition relation is NOT exact ! Due to transitions t26, t28, t30, t32, t34, t35, t37, t39, t88, t89, t90, t92, t93, t94, t95, t96, t98, Interse...245
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
425 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,4.28785,113920,1,0,267,515869,191,260,1916,642671,553
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-13 finished in 69324 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 3 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Graph (complete) has 221 edges and 77 vertex of which 74 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 74 transition count 90
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 68 transition count 90
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 62 transition count 84
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 62 transition count 84
Applied a total of 25 rules in 8 ms. Remains 62 /77 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 62 cols
[2025-06-03 02:30:40] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-06-03 02:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-03 02:30:40] [INFO ] Implicit Places using invariants and state equation in 140 ms returned [61]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 217 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/77 places, 84/99 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 46 transition count 69
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 40 transition count 57
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 40 transition count 57
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 34 transition count 45
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 34 transition count 45
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 29 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 29 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 24 transition count 30
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 24 transition count 30
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 78 place count 20 transition count 26
Iterating global reduction 0 with 4 rules applied. Total rules applied 82 place count 20 transition count 26
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 83 place count 20 transition count 26
Applied a total of 83 rules in 11 ms. Remains 20 /61 variables (removed 41) and now considering 26/84 (removed 58) transitions.
[2025-06-03 02:30:40] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
// Phase 1: matrix 22 rows 20 cols
[2025-06-03 02:30:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 02:30:40] [INFO ] Flow matrix only has 22 transitions (discarded 4 similar events)
[2025-06-03 02:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:40] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-03 02:30:40] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/77 places, 26/99 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 311 ms. Remains : 20/77 places, 26/99 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-14
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-14 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 77/77 places, 99/99 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 70 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 65 transition count 87
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 63 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 63 transition count 85
Applied a total of 28 rules in 6 ms. Remains 63 /77 variables (removed 14) and now considering 85/99 (removed 14) transitions.
// Phase 1: matrix 85 rows 63 cols
[2025-06-03 02:30:41] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:41] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-06-03 02:30:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 02:30:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2025-06-03 02:30:41] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 327 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/77 places, 85/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 338 ms. Remains : 62/77 places, 85/99 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-08a-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 404 ms.
Product exploration explored 100000 steps with 50000 reset in 475 ms.
Computed a total of 10 stabilizing places and 9 stable transitions
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DiscoveryGPU-PT-08a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DiscoveryGPU-PT-08a-LTLCardinality-15 finished in 1339 ms.
All properties solved by simple procedures.
Total runtime 89856 ms.
BK_STOP 1748917842443
--------------------
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="DiscoveryGPU-PT-08a"
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 DiscoveryGPU-PT-08a, 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 r058-smll-174854064500643"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-08a.tgz
mv DiscoveryGPU-PT-08a 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 ;