About the Execution of ITS-Tools for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16139.380 | 3600000.00 | 6919646.00 | 24416.70 | FFFFFF?TFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r114-smll-177955740400036.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DoubleLock-PT-p2s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 6 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 813K Mar 3 18:30 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 DoubleLock-PT-p2s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p2s2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779604795171
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 06:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 06:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:39:57] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2026-05-24 06:39:57] [INFO ] Transformed 184 places.
[2026-05-24 06:39:57] [INFO ] Transformed 1832 transitions.
[2026-05-24 06:39:57] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 549 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 61 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 144 transition count 1768
Applied a total of 4 rules in 75 ms. Remains 144 /148 variables (removed 4) and now considering 1768/1768 (removed 0) transitions.
[2026-05-24 06:39:58] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4238941641268963882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7161388065910231513.kers'
[2026-05-24 06:39:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4238941641268963882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7161388065910231513.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1225 rows 144 cols 4618 entries
Finished phase 1 with 141 SingleSign rule and 1 generalized
[2026-05-24 06:39:58] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7161388065910231513.kers
Total runtime 10 ms.
[2026-05-24 06:39:58] [INFO ] Implicit Places using invariants in 537 ms returned []
[2026-05-24 06:39:58] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:39:58] [INFO ] Invariant cache hit.
[2026-05-24 06:39:59] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:40:00] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2026-05-24 06:40:00] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:40:00] [INFO ] Invariant cache hit.
[2026-05-24 06:40:00] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 3 (OVERLAPS) 1225/1369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
SMT process timed out in 32076ms, After SMT, problems are : Problem set: 0 solved, 1766 unsolved
Search for dead transitions found 0 dead transitions in 32152ms
Starting structural reductions in LTL mode, iteration 1 : 144/148 places, 1768/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34556 ms. Remains : 144/148 places, 1768/1768 transitions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Applied a total of 0 rules in 13 ms. Remains 144 /144 variables (removed 0) and now considering 1768/1768 (removed 0) transitions.
[2026-05-24 06:40:32] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:40:32] [INFO ] Invariant cache hit.
[2026-05-24 06:40:32] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-24 06:40:32] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:40:32] [INFO ] Invariant cache hit.
[2026-05-24 06:40:33] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:40:34] [INFO ] Implicit Places using invariants and state equation in 1570 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1762 ms. Remains : 144/144 places, 1768/1768 transitions.
Support contains 61 out of 144 places after structural reductions.
[2026-05-24 06:40:35] [INFO ] Flatten gal took : 289 ms
[2026-05-24 06:40:35] [INFO ] Flatten gal took : 202 ms
[2026-05-24 06:40:35] [INFO ] Input system was already deterministic with 1768 transitions.
RANDOM walk for 40000 steps (404 resets) in 2434 ms. (16 steps per ms) remains 18/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 70 ms. (56 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 76 ms. (51 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 84 ms. (47 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 95 ms. (41 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 49 ms. (80 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 48 ms. (81 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
[2026-05-24 06:40:36] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:40:36] [INFO ] Invariant cache hit.
[2026-05-24 06:40:36] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 9/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 33/67 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 969/1036 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1036 variables, 21/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1036 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 8 (OVERLAPS) 333/1369 variables, 77/167 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1369 variables, 95/262 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/1369 variables, 0/262 constraints. Problems are: Problem set: 2 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 262 constraints, problems are : Problem set: 2 solved, 13 unsolved in 2851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 11/31 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 34/65 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 940/1005 variables, 65/67 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 15/82 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1005 variables, 0/82 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 362/1367 variables, 77/159 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1367 variables, 101/260 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/1367 variables, 13/273 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1367 variables, 0/273 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 2/1369 variables, 2/275 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1369 variables, 0/275 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1369 variables, 0/275 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 275 constraints, problems are : Problem set: 8 solved, 7 unsolved in 4783 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 13/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7677ms problems are : Problem set: 8 solved, 7 unsolved
Parikh walk visited 0 properties in 2555 ms.
Support contains 13 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 144 transition count 1736
Applied a total of 32 rules in 99 ms. Remains 144 /144 variables (removed 0) and now considering 1736/1768 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 144/144 places, 1736/1768 transitions.
RANDOM walk for 40010 steps (400 resets) in 233 ms. (170 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (80 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (77 resets) in 75 ms. (526 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 85 ms. (465 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (81 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (79 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
[2026-05-24 06:40:47] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9131567955889867330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5370889541727595219.kers'
[2026-05-24 06:40:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9131567955889867330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5370889541727595219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1193 rows 144 cols 4554 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-24 06:40:47] [INFO ] Computed 3 invariants in 6 ms
Computed 3 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-5370889541727595219.kers
Total runtime 7 ms.
[2026-05-24 06:40:47] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1176/1292 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1337 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 263 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1636 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1176/1292 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 45/1337 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1337 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1337 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1337 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1337 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1337 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 273 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4895 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 6578ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1272 ms.
Support contains 9 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1736/1736 transitions.
Applied a total of 0 rules in 59 ms. Remains 144 /144 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 144/144 places, 1736/1736 transitions.
RANDOM walk for 40003 steps (413 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (77 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (79 resets) in 110 ms. (360 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (74 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 143680 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 5
Probabilistic random walk after 143680 steps, saw 100591 distinct states, run finished after 3016 ms. (steps per millisecond=47 ) properties seen :0
[2026-05-24 06:40:58] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:40:58] [INFO ] Invariant cache hit.
[2026-05-24 06:40:58] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1176/1292 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1337 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1337 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 263 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1706 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1176/1292 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 44/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 45/1337 variables, 28/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 72/263 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 5/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1337 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1337 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1337 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1337 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1337 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 273 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5682 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7413ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1292 ms.
Support contains 9 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1736/1736 transitions.
Applied a total of 0 rules in 44 ms. Remains 144 /144 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 144/144 places, 1736/1736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1736/1736 transitions.
Applied a total of 0 rules in 43 ms. Remains 144 /144 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2026-05-24 06:41:07] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:41:07] [INFO ] Invariant cache hit.
[2026-05-24 06:41:07] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-24 06:41:07] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:41:07] [INFO ] Invariant cache hit.
[2026-05-24 06:41:07] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:41:08] [INFO ] Implicit Places using invariants and state equation in 1202 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2026-05-24 06:41:09] [INFO ] Redundant transitions in 245 ms returned []
Running 1734 sub problems to find dead transitions.
[2026-05-24 06:41:09] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:41:09] [INFO ] Invariant cache hit.
[2026-05-24 06:41:09] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1132 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1363 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1369 is UNSAT
Problem TDEAD1370 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1377 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1397 is UNSAT
Problem TDEAD1402 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1404 is UNSAT
Problem TDEAD1405 is UNSAT
Problem TDEAD1410 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1413 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1439 is UNSAT
Problem TDEAD1447 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1454 is UNSAT
Problem TDEAD1455 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1457 is UNSAT
Problem TDEAD1462 is UNSAT
Problem TDEAD1463 is UNSAT
Problem TDEAD1464 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1472 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1496 is UNSAT
Problem TDEAD1497 is UNSAT
Problem TDEAD1498 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1505 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1507 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1524 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1538 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1541 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1583 is UNSAT
Problem TDEAD1584 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 2/5 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 144/1337 variables, and 5 constraints, problems are : Problem set: 192 solved, 1542 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/144 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 192 solved, 1542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 2/5 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/5 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1337 variables, 144/149 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 116/265 constraints. Problems are: Problem set: 192 solved, 1542 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 1807 constraints, problems are : Problem set: 192 solved, 1542 unsolved in 30844 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1542/1734 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62282ms problems are : Problem set: 192 solved, 1542 unsolved
Search for dead transitions found 192 dead transitions in 62293ms
Found 192 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 144/144 places, 1544/1736 transitions.
Applied a total of 0 rules in 31 ms. Remains 144 /144 variables (removed 0) and now considering 1544/1544 (removed 0) transitions.
[2026-05-24 06:42:11] [INFO ] Redundant transitions in 112 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 64279 ms. Remains : 144/144 places, 1544/1736 transitions.
RANDOM walk for 40011 steps (408 resets) in 227 ms. (175 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (76 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (78 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 174190 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 5
Probabilistic random walk after 174190 steps, saw 120931 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2026-05-24 06:42:14] [INFO ] Flow matrix only has 1029 transitions (discarded 515 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9357318044766801473.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15211022401471634818.kers'
[2026-05-24 06:42:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9357318044766801473.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15211022401471634818.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1029 rows 144 cols 3930 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-24 06:42:14] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15211022401471634818.kers
Total runtime 6 ms.
[2026-05-24 06:42:14] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1012/1128 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 45/1173 variables, 28/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1173 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1173 variables, 72/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1173 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1173 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1173/1173 variables, and 259 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 107/116 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1012/1128 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 40/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 45/1173 variables, 28/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1173 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1173 variables, 72/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1173 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1173 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1173 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1173 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1173/1173 variables, and 265 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2803 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 144/144 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4450ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 633 ms.
Support contains 9 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1544/1544 transitions.
Applied a total of 0 rules in 28 ms. Remains 144 /144 variables (removed 0) and now considering 1544/1544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 144/144 places, 1544/1544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 1544/1544 transitions.
Applied a total of 0 rules in 27 ms. Remains 144 /144 variables (removed 0) and now considering 1544/1544 (removed 0) transitions.
[2026-05-24 06:42:19] [INFO ] Flow matrix only has 1029 transitions (discarded 515 similar events)
[2026-05-24 06:42:19] [INFO ] Invariant cache hit.
[2026-05-24 06:42:20] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-24 06:42:20] [INFO ] Flow matrix only has 1029 transitions (discarded 515 similar events)
[2026-05-24 06:42:20] [INFO ] Invariant cache hit.
[2026-05-24 06:42:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:42:21] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1725 ms to find 0 implicit places.
[2026-05-24 06:42:21] [INFO ] Redundant transitions in 46 ms returned []
Running 1542 sub problems to find dead transitions.
[2026-05-24 06:42:21] [INFO ] Flow matrix only has 1029 transitions (discarded 515 similar events)
[2026-05-24 06:42:21] [INFO ] Invariant cache hit.
[2026-05-24 06:42:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1542 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1542 unsolved
At refinement iteration 2 (OVERLAPS) 1029/1173 variables, 144/147 constraints. Problems are: Problem set: 0 solved, 1542 unsolved
SMT process timed out in 30949ms, After SMT, problems are : Problem set: 0 solved, 1542 unsolved
Search for dead transitions found 0 dead transitions in 30953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32761 ms. Remains : 144/144 places, 1544/1544 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p2s2-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 416 stable transitions
FORMULA DoubleLock-PT-p2s2-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))&&X(G(p1)))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 122 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:42:53] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4999575808269767059.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6943284151496891615.kers'
[2026-05-24 06:42:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4999575808269767059.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6943284151496891615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1193 rows 143 cols 4522 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-24 06:42:53] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6943284151496891615.kers
Total runtime 9 ms.
[2026-05-24 06:42:53] [INFO ] Implicit Places using invariants in 296 ms returned []
[2026-05-24 06:42:53] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:42:53] [INFO ] Invariant cache hit.
[2026-05-24 06:42:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:42:55] [INFO ] Implicit Places using invariants and state equation in 1958 ms returned []
Implicit Place search using SMT with State Equation took 2257 ms to find 0 implicit places.
[2026-05-24 06:42:55] [INFO ] Redundant transitions in 46 ms returned []
Running 1734 sub problems to find dead transitions.
[2026-05-24 06:42:55] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:42:55] [INFO ] Invariant cache hit.
[2026-05-24 06:42:55] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
SMT process timed out in 31351ms, After SMT, problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 31358ms
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33797 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p1)&&p0))&&X(G(p1)))))'
Stuttering acceptance computed with spot in 407 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-01
Stuttering criterion allowed to conclude after 57 steps with 0 reset in 8 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-01 finished in 34336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 6 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 30 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:43:27] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:27] [INFO ] Invariant cache hit.
[2026-05-24 06:43:27] [INFO ] Implicit Places using invariants in 370 ms returned []
[2026-05-24 06:43:27] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:27] [INFO ] Invariant cache hit.
[2026-05-24 06:43:28] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:30] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 2559 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2591 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-05 finished in 2773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 70 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:43:30] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:30] [INFO ] Invariant cache hit.
[2026-05-24 06:43:30] [INFO ] Implicit Places using invariants in 426 ms returned []
[2026-05-24 06:43:30] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:30] [INFO ] Invariant cache hit.
[2026-05-24 06:43:31] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:32] [INFO ] Implicit Places using invariants and state equation in 1813 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2026-05-24 06:43:32] [INFO ] Redundant transitions in 82 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2417 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-06
Product exploration explored 100000 steps with 1607 reset in 975 ms.
Product exploration explored 100000 steps with 1612 reset in 971 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 31015 steps (314 resets) in 210 ms. (146 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Knowledge-based reduction took 337 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1736/1736 transitions.
Applied a total of 0 rules in 31 ms. Remains 143 /143 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2026-05-24 06:43:35] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:35] [INFO ] Invariant cache hit.
[2026-05-24 06:43:35] [INFO ] Implicit Places using invariants in 219 ms returned []
[2026-05-24 06:43:35] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:35] [INFO ] Invariant cache hit.
[2026-05-24 06:43:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:37] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2026-05-24 06:43:37] [INFO ] Redundant transitions in 71 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2373 ms. Remains : 143/143 places, 1736/1736 transitions.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40008 steps (413 resets) in 273 ms. (146 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39363 steps (68 resets) in 173 ms. (226 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Knowledge-based reduction took 363 ms.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1581 reset in 725 ms.
Product exploration explored 100000 steps with 1613 reset in 726 ms.
Built C files in :
/tmp/ltsmin13098197750277696748
[2026-05-24 06:43:39] [INFO ] Too many transitions (1736) to apply POR reductions. Disabling POR matrices.
[2026-05-24 06:43:39] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13098197750277696748
Running compilation step : cd /tmp/ltsmin13098197750277696748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13098197750277696748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13098197750277696748;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 1736/1736 transitions.
Applied a total of 0 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2026-05-24 06:43:42] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:42] [INFO ] Invariant cache hit.
[2026-05-24 06:43:42] [INFO ] Implicit Places using invariants in 309 ms returned []
[2026-05-24 06:43:42] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:43:42] [INFO ] Invariant cache hit.
[2026-05-24 06:43:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:44] [INFO ] Implicit Places using invariants and state equation in 1457 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2026-05-24 06:43:44] [INFO ] Redundant transitions in 79 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1896 ms. Remains : 143/143 places, 1736/1736 transitions.
Built C files in :
/tmp/ltsmin566318820998848205
[2026-05-24 06:43:44] [INFO ] Too many transitions (1736) to apply POR reductions. Disabling POR matrices.
[2026-05-24 06:43:44] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin566318820998848205
Running compilation step : cd /tmp/ltsmin566318820998848205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin566318820998848205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin566318820998848205;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-24 06:43:47] [INFO ] Flatten gal took : 146 ms
[2026-05-24 06:43:48] [INFO ] Flatten gal took : 121 ms
[2026-05-24 06:43:48] [INFO ] Time to serialize gal into /tmp/LTL5043228140414432300.gal : 44 ms
[2026-05-24 06:43:48] [INFO ] Time to serialize properties into /tmp/LTL13308765080550071808.prop : 2 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5043228140414432300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13027695249731956555.hoa' '-atoms' '/tmp/LTL13308765080550071808.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13308765080550071808.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13027695249731956555.hoa
Detected timeout of ITS tools.
[2026-05-24 06:44:03] [INFO ] Flatten gal took : 58 ms
[2026-05-24 06:44:03] [INFO ] Flatten gal took : 60 ms
[2026-05-24 06:44:03] [INFO ] Time to serialize gal into /tmp/LTL14810131378742848253.gal : 18 ms
[2026-05-24 06:44:03] [INFO ] Time to serialize properties into /tmp/LTL7807092068664051581.ltl : 5 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14810131378742848253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7807092068664051581.ltl' '-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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p24<1)||(l45<1))"))))
Formula 0 simplified : GF!"((p24<1)||(l45<1))"
Detected timeout of ITS tools.
[2026-05-24 06:44:18] [INFO ] Flatten gal took : 85 ms
[2026-05-24 06:44:18] [INFO ] Applying decomposition
[2026-05-24 06:44:18] [INFO ] Flatten gal took : 59 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11784435017697374334.txt' '-o' '/tmp/graph11784435017697374334.bin' '-w' '/tmp/graph11784435017697374334.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11784435017697374334.bin' '-l' '-1' '-v' '-w' '/tmp/graph11784435017697374334.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:44:18] [INFO ] Decomposing Gal with order
[2026-05-24 06:44:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:44:19] [INFO ] Removed a total of 4133 redundant transitions.
[2026-05-24 06:44:19] [INFO ] Flatten gal took : 316 ms
[2026-05-24 06:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 191 labels/synchronizations in 98 ms.
[2026-05-24 06:44:19] [INFO ] Time to serialize gal into /tmp/LTL10290495387360653977.gal : 19 ms
[2026-05-24 06:44:19] [INFO ] Time to serialize properties into /tmp/LTL15969540376478890461.ltl : 0 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10290495387360653977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15969540376478890461.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i1.i0.u27.p24<1)||(i8.u48.l45<1))"))))
Formula 0 simplified : GF!"((i1.i0.u27.p24<1)||(i8.u48.l45<1))"
Detected timeout of ITS tools.
Treatment of property DoubleLock-PT-p2s2-LTLFireability-06 finished in 64414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p1))&&p0)) U X((G(p2) U !p3))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 9 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:44:34] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:34] [INFO ] Invariant cache hit.
[2026-05-24 06:44:35] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-24 06:44:35] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:35] [INFO ] Invariant cache hit.
[2026-05-24 06:44:35] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:44:36] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2182 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(F(p1))&&p0)) U X((G(p2) U !p3))))'
Stuttering acceptance computed with spot in 477 ms :[p3, (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), p3, (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Product exploration explored 100000 steps with 50000 reset in 447 ms.
Computed a total of 8 stabilizing places and 416 stable transitions
Computed a total of 8 stabilizing places and 416 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 33 factoid took 15 ms. Proved property starting from automaton with 8 states, 22 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 42 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p2s2-LTLFireability-07 finished in 3643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 41 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:44:38] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:38] [INFO ] Invariant cache hit.
[2026-05-24 06:44:38] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 06:44:38] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:38] [INFO ] Invariant cache hit.
[2026-05-24 06:44:39] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:44:40] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 1958 ms to find 0 implicit places.
[2026-05-24 06:44:40] [INFO ] Redundant transitions in 45 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2054 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-08
Stuttering criterion allowed to conclude after 60 steps with 1 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-08 finished in 2209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F((G(p1)||G(p2))) U G(p0)))))'
Support contains 2 out of 144 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 35 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:44:40] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:40] [INFO ] Invariant cache hit.
[2026-05-24 06:44:40] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-24 06:44:40] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:44:40] [INFO ] Invariant cache hit.
[2026-05-24 06:44:41] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:44:42] [INFO ] Implicit Places using invariants and state equation in 1926 ms returned []
Implicit Place search using SMT with State Equation took 2240 ms to find 0 implicit places.
[2026-05-24 06:44:42] [INFO ] Redundant transitions in 77 ms returned []
Skipped dead transition search.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2364 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((G(p0)||G(p1))) U G(p2))||p2)))'
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-09
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-09 finished in 2461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((F(p2)&&(G(p4)||p3))))))'
Support contains 10 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 1768/1768 (removed 0) transitions.
[2026-05-24 06:44:43] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8289730397413870845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15551470518056855541.kers'
[2026-05-24 06:44:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8289730397413870845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15551470518056855541.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1225 rows 144 cols 4618 entries
Finished phase 1 with 141 SingleSign rule and 1 generalized
[2026-05-24 06:44:43] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15551470518056855541.kers
Total runtime 11 ms.
[2026-05-24 06:44:43] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-05-24 06:44:43] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:44:43] [INFO ] Invariant cache hit.
[2026-05-24 06:44:43] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:44:45] [INFO ] Implicit Places using invariants and state equation in 2565 ms returned []
Implicit Place search using SMT with State Equation took 2943 ms to find 0 implicit places.
Running 1766 sub problems to find dead transitions.
[2026-05-24 06:44:45] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
[2026-05-24 06:44:45] [INFO ] Invariant cache hit.
[2026-05-24 06:44:45] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 144/1369 variables, and 2 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/144 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1766 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 3 (OVERLAPS) 1225/1369 variables, 144/146 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 116/262 constraints. Problems are: Problem set: 0 solved, 1766 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 2028 constraints, problems are : Problem set: 0 solved, 1766 unsolved in 30643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1766/1766 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62292ms problems are : Problem set: 0 solved, 1766 unsolved
Search for dead transitions found 0 dead transitions in 62301ms
Finished structural reductions in LTL mode , in 1 iterations and 65261 ms. Remains : 144/144 places, 1768/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(X((F(p2)&&(G(p4)||p3))))))'
Stuttering acceptance computed with spot in 1268 ms :[(OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), true, (NOT p2), (NOT p4), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p3) (NOT p4))), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p2), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-11
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-11 finished in 66669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(!p1 U G(p2))))||X(p3))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:45:49] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15845239166330813804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1565368964557016725.kers'
[2026-05-24 06:45:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15845239166330813804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1565368964557016725.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1193 rows 143 cols 4522 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-24 06:45:49] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1565368964557016725.kers
Total runtime 6 ms.
[2026-05-24 06:45:49] [INFO ] Implicit Places using invariants in 270 ms returned []
[2026-05-24 06:45:49] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:45:49] [INFO ] Invariant cache hit.
[2026-05-24 06:45:50] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:45:51] [INFO ] Implicit Places using invariants and state equation in 1904 ms returned []
Implicit Place search using SMT with State Equation took 2186 ms to find 0 implicit places.
Running 1734 sub problems to find dead transitions.
[2026-05-24 06:45:51] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:45:51] [INFO ] Invariant cache hit.
[2026-05-24 06:45:51] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 143/1336 variables, and 2 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/143 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1193/1336 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1336 variables, 116/261 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 1995 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62206ms problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 62210ms
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64412 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&(!p1 U G(p2))))||X(p3))))'
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-13
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-13 finished in 64759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:46:54] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:46:54] [INFO ] Invariant cache hit.
[2026-05-24 06:46:54] [INFO ] Implicit Places using invariants in 230 ms returned []
[2026-05-24 06:46:54] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:46:54] [INFO ] Invariant cache hit.
[2026-05-24 06:46:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:46:56] [INFO ] Implicit Places using invariants and state equation in 1463 ms returned []
Implicit Place search using SMT with State Equation took 1695 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1704 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&G(p1))))'
Stuttering acceptance computed with spot in 155 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-14
Entered a terminal (fully accepting) state of product in 8184 steps with 128 reset in 43 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-14 finished in 1931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(((p0 U p1)||X(X(p2)))) U p3)&&G(X(F(p4)))))'
Support contains 10 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 1768/1768 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 1736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 1736
Applied a total of 2 rules in 8 ms. Remains 143 /144 variables (removed 1) and now considering 1736/1768 (removed 32) transitions.
[2026-05-24 06:46:56] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:46:56] [INFO ] Invariant cache hit.
[2026-05-24 06:46:56] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 06:46:56] [INFO ] Flow matrix only has 1193 transitions (discarded 543 similar events)
[2026-05-24 06:46:56] [INFO ] Invariant cache hit.
[2026-05-24 06:46:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:46:57] [INFO ] Implicit Places using invariants and state equation in 1245 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 143/144 places, 1736/1768 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1470 ms. Remains : 143/144 places, 1736/1768 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(((p0 U p1)||X(X(p2)))) U p3)&&G(X(F(p4)))))'
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p4) (NOT p3)), (NOT p4), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p4), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p2s2-LTLFireability-15
Stuttering criterion allowed to conclude after 53 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p2s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p2s2-LTLFireability-15 finished in 1892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 103 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 06:46:58] [INFO ] Flatten gal took : 46 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5364950697312690782
[2026-05-24 06:46:58] [INFO ] Too many transitions (1768) to apply POR reductions. Disabling POR matrices.
[2026-05-24 06:46:58] [INFO ] Applying decomposition
[2026-05-24 06:46:58] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5364950697312690782
Running compilation step : cd /tmp/ltsmin5364950697312690782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 06:46:58] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9903869546862597612.txt' '-o' '/tmp/graph9903869546862597612.bin' '-w' '/tmp/graph9903869546862597612.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9903869546862597612.bin' '-l' '-1' '-v' '-w' '/tmp/graph9903869546862597612.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:46:58] [INFO ] Decomposing Gal with order
[2026-05-24 06:46:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:46:58] [INFO ] Removed a total of 4196 redundant transitions.
[2026-05-24 06:46:58] [INFO ] Flatten gal took : 157 ms
[2026-05-24 06:46:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 155 labels/synchronizations in 70 ms.
[2026-05-24 06:46:59] [INFO ] Time to serialize gal into /tmp/LTLFireability763941021205170645.gal : 16 ms
[2026-05-24 06:46:59] [INFO ] Time to serialize properties into /tmp/LTLFireability10796792481400808036.ltl : 0 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability763941021205170645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10796792481400808036.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u28.p24<1)||(i9.u49.l45<1))"))))
Formula 0 simplified : GF!"((i0.u28.p24<1)||(i9.u49.l45<1))"
Compilation finished in 5865 ms.
Running link step : cd /tmp/ltsmin5364950697312690782;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin5364950697312690782;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-24 07:09:19] [INFO ] Flatten gal took : 66 ms
[2026-05-24 07:09:19] [INFO ] Time to serialize gal into /tmp/LTLFireability10053920520086837317.gal : 18 ms
[2026-05-24 07:09:19] [INFO ] Time to serialize properties into /tmp/LTLFireability9139547721640606049.ltl : 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10053920520086837317.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9139547721640606049.ltl' '-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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("((p24<1)||(l45<1))"))))
Formula 0 simplified : GF!"((p24<1)||(l45<1))"
Detected timeout of ITS tools.
[2026-05-24 07:31:42] [INFO ] Flatten gal took : 965 ms
[2026-05-24 07:31:44] [INFO ] Input system was already deterministic with 1768 transitions.
[2026-05-24 07:31:44] [INFO ] Transformed 144 places.
[2026-05-24 07:31:44] [INFO ] Transformed 1768 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 07:31:45] [INFO ] Time to serialize gal into /tmp/LTLFireability12418282370021073780.gal : 39 ms
[2026-05-24 07:31:45] [INFO ] Time to serialize properties into /tmp/LTLFireability13453268972020472687.ltl : 4 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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12418282370021073780.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13453268972020472687.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("((p24<1)||(l45<1))"))))
Formula 0 simplified : GF!"((p24<1)||(l45<1))"
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="DoubleLock-PT-p2s2"
export BK_EXAMINATION="LTLFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p2s2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-177955740400036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;
