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.r162-smll-177961107700091.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 IBM703-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 844K
-rw-r--r-- 1 mcc users 13K Mar 7 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 7 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 15 11:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 11:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Mar 7 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 199K Mar 7 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 23K Mar 7 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Mar 7 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 15 11:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 15 11:00 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 203K 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 IBM703-PT-none-LTLCardinality-00
FORMULA_NAME IBM703-PT-none-LTLCardinality-01
FORMULA_NAME IBM703-PT-none-LTLCardinality-02
FORMULA_NAME IBM703-PT-none-LTLCardinality-03
FORMULA_NAME IBM703-PT-none-LTLCardinality-04
FORMULA_NAME IBM703-PT-none-LTLCardinality-05
FORMULA_NAME IBM703-PT-none-LTLCardinality-06
FORMULA_NAME IBM703-PT-none-LTLCardinality-07
FORMULA_NAME IBM703-PT-none-LTLCardinality-08
FORMULA_NAME IBM703-PT-none-LTLCardinality-09
FORMULA_NAME IBM703-PT-none-LTLCardinality-10
FORMULA_NAME IBM703-PT-none-LTLCardinality-11
FORMULA_NAME IBM703-PT-none-LTLCardinality-12
FORMULA_NAME IBM703-PT-none-LTLCardinality-13
FORMULA_NAME IBM703-PT-none-LTLCardinality-14
FORMULA_NAME IBM703-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779723833241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM703-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 15:43:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 15:43:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 15:43:55] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2026-05-25 15:43:55] [INFO ] Transformed 262 places.
[2026-05-25 15:43:55] [INFO ] Transformed 284 transitions.
[2026-05-25 15:43:55] [INFO ] Found NUPN structural information;
[2026-05-25 15:43:55] [INFO ] Parsed PT model containing 262 places and 284 transitions and 572 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA IBM703-PT-none-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM703-PT-none-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 262 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 262/262 places, 284/284 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 256 transition count 284
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 32 place count 230 transition count 258
Iterating global reduction 1 with 26 rules applied. Total rules applied 58 place count 230 transition count 258
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 223 transition count 251
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 223 transition count 251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 219 transition count 247
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 219 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 219 transition count 245
Applied a total of 82 rules in 114 ms. Remains 219 /262 variables (removed 43) and now considering 245/284 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14086218343590195926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-577315703629100672.kers'
[2026-05-25 15:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14086218343590195926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-577315703629100672.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 245 rows 219 cols 491 entries
Finished phase 1 with 219 SingleSign rule and 0 generalized
[2026-05-25 15:43:56] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-577315703629100672.kers
Total runtime 3 ms.
[2026-05-25 15:43:56] [INFO ] Implicit Places using invariants in 371 ms returned []
[2026-05-25 15:43:56] [INFO ] Invariant cache hit.
[2026-05-25 15:43:57] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 857 ms to find 0 implicit places.
Running 244 sub problems to find dead transitions.
[2026-05-25 15:43:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 245/463 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 1/464 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 464/464 variables, and 219 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30045 ms.
Refiners :[State Equation: 219/219 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/218 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 245/463 variables, 218/218 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 244/462 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (OVERLAPS) 1/464 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 464/464 variables, and 463 constraints, problems are : Problem set: 0 solved, 244 unsolved in 30026 ms.
Refiners :[State Equation: 219/219 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 60248ms
Starting structural reductions in LTL mode, iteration 1 : 219/262 places, 245/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61286 ms. Remains : 219/262 places, 245/284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 219 /219 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2026-05-25 15:44:57] [INFO ] Invariant cache hit.
[2026-05-25 15:44:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 15:44:57] [INFO ] Invariant cache hit.
[2026-05-25 15:44:57] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 219/219 places, 245/245 transitions.
Support contains 34 out of 219 places after structural reductions.
[2026-05-25 15:44:57] [INFO ] Flatten gal took : 60 ms
[2026-05-25 15:44:58] [INFO ] Flatten gal took : 28 ms
[2026-05-25 15:44:58] [INFO ] Input system was already deterministic with 245 transitions.
RANDOM walk for 40000 steps (754 resets) in 1552 ms. (25 steps per ms) remains 2/24 properties
BEST_FIRST walk for 40001 steps (484 resets) in 632 ms. (63 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (500 resets) in 458 ms. (87 steps per ms) remains 2/2 properties
[2026-05-25 15:44:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 31/52 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 39/91 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 46/137 variables, 21/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 45/182 variables, 23/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 40/222 variables, 19/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 34/256 variables, 18/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/256 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 36/292 variables, 15/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 38/330 variables, 17/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/330 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 35/365 variables, 16/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/365 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 27/392 variables, 15/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/392 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 23/415 variables, 10/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/415 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 25 (OVERLAPS) 23/438 variables, 12/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/438 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 14/452 variables, 8/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/452 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 7/459 variables, 4/216 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/459 variables, 0/216 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/463 variables, 2/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/463 variables, 0/218 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/464 variables, 1/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/464 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/464 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 464/464 variables, and 219 constraints, problems are : Problem set: 1 solved, 1 unsolved in 405 ms.
Refiners :[State Equation: 219/219 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/12 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/31 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/55 variables, 11/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/83 variables, 13/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/115 variables, 15/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 31/146 variables, 15/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/146 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 31/177 variables, 15/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/177 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 33/210 variables, 14/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/210 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 36/246 variables, 17/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 38/284 variables, 17/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/284 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 34/318 variables, 17/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/318 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 27/345 variables, 13/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/345 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 28/373 variables, 13/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/373 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Int declared 398/464 variables, and 186 constraints, problems are : Problem set: 2 solved, 0 unsolved in 291 ms.
Refiners :[State Equation: 185/219 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 702ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IBM703-PT-none-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 9 simplifications.
Computed a total of 219 stabilizing places and 245 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 219 transition count 245
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(X((p0 U p1)))))'
Support contains 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 232
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 199 transition count 225
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 199 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 199 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 194 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 194 transition count 219
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 189 transition count 214
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 189 transition count 214
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 184 transition count 209
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 179 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 179 transition count 204
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 85 place count 175 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 175 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 173 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 173 transition count 198
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 171 transition count 196
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 171 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 98 place count 170 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 169 transition count 194
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 168 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 104 place count 168 transition count 192
Applied a total of 104 rules in 52 ms. Remains 168 /219 variables (removed 51) and now considering 192/245 (removed 53) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14890215312864038155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3964236216332749953.kers'
[2026-05-25 15:45:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14890215312864038155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3964236216332749953.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 192 rows 168 cols 385 entries
Finished phase 1 with 168 SingleSign rule and 0 generalized
[2026-05-25 15:45:00] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3964236216332749953.kers
Total runtime 1 ms.
[2026-05-25 15:45:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-25 15:45:00] [INFO ] Invariant cache hit.
[2026-05-25 15:45:00] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2026-05-25 15:45:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 192/359 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (OVERLAPS) 1/360 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/360 variables, and 168 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30016 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (OVERLAPS) 192/359 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 191/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (OVERLAPS) 1/360 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 359 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30019 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 168/219 places, 192/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 168/219 places, 192/245 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(X((p0 U p1)))))'
Stuttering acceptance computed with spot in 477 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-01
Product exploration explored 100000 steps with 25000 reset in 445 ms.
Product exploration explored 100000 steps with 25000 reset in 265 ms.
Computed a total of 168 stabilizing places and 192 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 192
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (754 resets) in 87 ms. (454 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40001 steps (469 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
[2026-05-25 15:46:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/24 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/46 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/65 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/84 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 16/100 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/100 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 23/123 variables, 9/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/123 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/150 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/150 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 24/174 variables, 12/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/174 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 26/200 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/200 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 24/224 variables, 12/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/224 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/246 variables, 10/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 20/266 variables, 10/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/266 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 21/287 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/287 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 18/305 variables, 10/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/305 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 18/323 variables, 7/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/323 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 15/338 variables, 9/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/338 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/344 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/344 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 6/350 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/350 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 5/355 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 4/359 variables, 2/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/359 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 360/360 variables, and 168 constraints, problems are : Problem set: 1 solved, 0 unsolved in 350 ms.
Refiners :[State Equation: 168/168 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1036 ms.
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 168 /168 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2026-05-25 15:46:02] [INFO ] Invariant cache hit.
[2026-05-25 15:46:02] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-25 15:46:02] [INFO ] Invariant cache hit.
[2026-05-25 15:46:03] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 168/168 places, 192/192 transitions.
Computed a total of 168 stabilizing places and 192 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 168 transition count 192
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 356 steps (5 resets) in 7 ms. (44 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 480 ms.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 107 ms.
Product exploration explored 100000 steps with 25000 reset in 272 ms.
Spot run failed in 151 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/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin2043677276867061149
[2026-05-25 15:46:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2043677276867061149
Running compilation step : cd /tmp/ltsmin2043677276867061149;'/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'
Compilation finished in 814 ms.
Running link step : cd /tmp/ltsmin2043677276867061149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2043677276867061149;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6973529625967355203.hoa' '--buchi-type=spotba'
LTSmin run took 49 ms.
FORMULA IBM703-PT-none-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IBM703-PT-none-LTLCardinality-01 finished in 65634 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||(G(p1) U X(p2)))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 232
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 199 transition count 225
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 199 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 199 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 194 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 194 transition count 219
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 189 transition count 214
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 189 transition count 214
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 184 transition count 209
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 179 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 179 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 174 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 174 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 171 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 171 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 169 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 167 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 166 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 166 transition count 190
Applied a total of 108 rules in 45 ms. Remains 166 /219 variables (removed 53) and now considering 190/245 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9793828121635652324.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5301422928116882059.kers'
[2026-05-25 15:46:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9793828121635652324.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5301422928116882059.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 166 cols 381 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-25 15:46:05] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5301422928116882059.kers
Total runtime 1 ms.
[2026-05-25 15:46:05] [INFO ] Implicit Places using invariants in 103 ms returned []
[2026-05-25 15:46:05] [INFO ] Invariant cache hit.
[2026-05-25 15:46:05] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-25 15:46:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30015 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30018 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 166/219 places, 190/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60362 ms. Remains : 166/219 places, 190/245 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||(G(p1) U X(p2)))))'
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Computed a total of 166 stabilizing places and 190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 166 transition count 190
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 12 factoid took 18 ms. Proved property starting from automaton with 6 states, 10 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 149 ms.
FORMULA IBM703-PT-none-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-02 finished in 61029 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)&&X((F(G(p2))&&p1))))'
Support contains 4 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 208 transition count 234
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 208 transition count 234
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 203 transition count 229
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 203 transition count 229
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 199 transition count 225
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 199 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 196 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 196 transition count 222
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 193 transition count 219
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 193 transition count 219
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 190 transition count 216
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 190 transition count 216
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 187 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 187 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 185 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 185 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 184 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 184 transition count 210
Applied a total of 70 rules in 78 ms. Remains 184 /219 variables (removed 35) and now considering 210/245 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8851822783458343693.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15648039241490463261.kers'
[2026-05-25 15:47:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8851822783458343693.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15648039241490463261.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 184 cols 422 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-25 15:47:06] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15648039241490463261.kers
Total runtime 2 ms.
[2026-05-25 15:47:06] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-25 15:47:06] [INFO ] Invariant cache hit.
[2026-05-25 15:47:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2026-05-25 15:47:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 210/393 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 1/394 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/394 variables, and 184 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30017 ms.
Refiners :[State Equation: 184/184 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 210/393 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 209/392 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 1/394 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 209 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 393 constraints, problems are : Problem set: 0 solved, 209 unsolved in 30018 ms.
Refiners :[State Equation: 184/184 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 184/219 places, 210/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60424 ms. Remains : 184/219 places, 210/245 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(p0)&&X((F(G(p2))&&p1))))'
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-03 finished in 60707 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)))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Graph (complete) has 246 edges and 219 vertex of which 79 are kept as prefixes of interest. Removing 140 places using SCC suffix rule.2 ms
Discarding 140 places :
Also discarding 152 output transitions
Drop transitions (Output transitions of discarded places.) removed 152 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 78 transition count 32
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 65 rules applied. Total rules applied 126 place count 19 transition count 26
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 130 place count 15 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 130 place count 15 transition count 23
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 12 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 11 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 11 transition count 21
Performed 7 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 152 place count 4 transition count 9
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 155 place count 4 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 3 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 3 transition count 4
Applied a total of 158 rules in 41 ms. Remains 3 /219 variables (removed 216) and now considering 4/245 (removed 241) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2215959927653021263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-952589489995812741.kers'
[2026-05-25 15:48:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2215959927653021263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-952589489995812741.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 6 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 15:48:07] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-952589489995812741.kers
Total runtime 0 ms.
[2026-05-25 15:48:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 15:48:07] [INFO ] Invariant cache hit.
[2026-05-25 15:48:07] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2026-05-25 15:48:07] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2026-05-25 15:48:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 73 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/7 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 70 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/219 places, 4/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 3/219 places, 4/245 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)))'
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-06
Product exploration explored 100000 steps with 33305 reset in 202 ms.
Product exploration explored 100000 steps with 33365 reset in 242 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 17 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 51 ms.
FORMULA IBM703-PT-none-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-06 finished in 897 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(F(p0))))'
Support contains 1 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 232
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 199 transition count 225
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 199 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 199 transition count 224
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 194 transition count 219
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 194 transition count 219
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 189 transition count 214
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 189 transition count 214
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 66 place count 184 transition count 209
Iterating global reduction 1 with 5 rules applied. Total rules applied 71 place count 184 transition count 209
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 76 place count 179 transition count 204
Iterating global reduction 1 with 5 rules applied. Total rules applied 81 place count 179 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 86 place count 174 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 91 place count 174 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 94 place count 171 transition count 196
Iterating global reduction 1 with 3 rules applied. Total rules applied 97 place count 171 transition count 196
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 169 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 168 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 167 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 167 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 166 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 166 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 166 transition count 190
Applied a total of 108 rules in 88 ms. Remains 166 /219 variables (removed 53) and now considering 190/245 (removed 55) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-258150657604530107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17562542501636620286.kers'
[2026-05-25 15:48:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-258150657604530107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17562542501636620286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 190 rows 166 cols 381 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-25 15:48:08] [INFO ] Computed 0 invariants in 2 ms
Computed 0 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17562542501636620286.kers
Total runtime 4 ms.
[2026-05-25 15:48:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 15:48:08] [INFO ] Invariant cache hit.
[2026-05-25 15:48:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 189 sub problems to find dead transitions.
[2026-05-25 15:48:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (OVERLAPS) 1/356 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/356 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 166 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30022 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 189 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 1 (OVERLAPS) 190/355 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 189/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 4 (OVERLAPS) 1/356 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 189 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 355 constraints, problems are : Problem set: 0 solved, 189 unsolved in 30013 ms.
Refiners :[State Equation: 166/166 constraints, PredecessorRefiner: 189/189 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 189 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 166/219 places, 190/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60352 ms. Remains : 166/219 places, 190/245 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(F(p0))))'
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-08
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA IBM703-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-08 finished in 60499 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(G((p0||X(X(X((G(p2)&&p1))))))))'
Support contains 5 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 209 transition count 235
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 209 transition count 235
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 204 transition count 230
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 204 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 204 transition count 229
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 200 transition count 225
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 200 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 196 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 196 transition count 221
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 193 transition count 218
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 193 transition count 218
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 190 transition count 215
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 190 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 187 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 187 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 185 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 185 transition count 210
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 184 transition count 209
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 184 transition count 209
Applied a total of 71 rules in 36 ms. Remains 184 /219 variables (removed 35) and now considering 209/245 (removed 36) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8915594500224965982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5299856084328286328.kers'
[2026-05-25 15:49:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8915594500224965982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5299856084328286328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 184 cols 420 entries
Finished phase 1 with 184 SingleSign rule and 0 generalized
[2026-05-25 15:49:08] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5299856084328286328.kers
Total runtime 2 ms.
[2026-05-25 15:49:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-25 15:49:08] [INFO ] Invariant cache hit.
[2026-05-25 15:49:09] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 208 sub problems to find dead transitions.
[2026-05-25 15:49:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 209/392 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (OVERLAPS) 1/393 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 393/393 variables, and 184 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30044 ms.
Refiners :[State Equation: 184/184 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 208 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 1 (OVERLAPS) 209/392 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 208/391 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 208 unsolved
At refinement iteration 4 (OVERLAPS) 1/393 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 208 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 393/393 variables, and 392 constraints, problems are : Problem set: 0 solved, 208 unsolved in 30018 ms.
Refiners :[State Equation: 184/184 constraints, PredecessorRefiner: 208/208 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 208 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 184/219 places, 209/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 184/219 places, 209/245 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(G((p0||X(X(X((G(p2)&&p1))))))))'
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-11
Entered a terminal (fully accepting) state of product in 2176 steps with 39 reset in 4 ms.
FORMULA IBM703-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM703-PT-none-LTLCardinality-11 finished in 60906 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(p2) U p3)))'
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 210 transition count 236
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 210 transition count 236
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 205 transition count 231
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 205 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 205 transition count 230
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 32 place count 202 transition count 227
Iterating global reduction 1 with 3 rules applied. Total rules applied 35 place count 202 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 38 place count 199 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 199 transition count 224
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 196 transition count 221
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 196 transition count 221
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 194 transition count 219
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 194 transition count 219
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 192 transition count 217
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 192 transition count 217
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 191 transition count 216
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 191 transition count 216
Applied a total of 57 rules in 33 ms. Remains 191 /219 variables (removed 28) and now considering 216/245 (removed 29) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9464939692604163838.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14502721341736281321.kers'
[2026-05-25 15:50:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9464939692604163838.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14502721341736281321.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 216 rows 191 cols 433 entries
Finished phase 1 with 191 SingleSign rule and 0 generalized
[2026-05-25 15:50:09] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14502721341736281321.kers
Total runtime 2 ms.
[2026-05-25 15:50:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 15:50:09] [INFO ] Invariant cache hit.
[2026-05-25 15:50:09] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 15:50:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/406 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 1/407 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 407/407 variables, and 191 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[State Equation: 191/191 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 216/406 variables, 190/190 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 215/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 1/407 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 407/407 variables, and 406 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30019 ms.
Refiners :[State Equation: 191/191 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60054ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in LTL mode, iteration 1 : 191/219 places, 216/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60374 ms. Remains : 191/219 places, 216/245 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(p2) U p3)))'
Stuttering acceptance computed with spot in 251 ms :[true, (AND (NOT p1) (NOT p3)), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 391 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 191 stabilizing places and 216 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 191 transition count 216
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 24 factoid took 13 ms. Proved property starting from automaton with 5 states, 10 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 108 ms.
FORMULA IBM703-PT-none-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-12 finished in 61445 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 3 out of 219 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Graph (complete) has 246 edges and 219 vertex of which 197 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 196 transition count 79
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 163 rules applied. Total rules applied 307 place count 53 transition count 59
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 19 rules applied. Total rules applied 326 place count 40 transition count 53
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 332 place count 36 transition count 51
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 334 place count 34 transition count 51
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 334 place count 34 transition count 44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 348 place count 27 transition count 44
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 351 place count 24 transition count 40
Iterating global reduction 5 with 3 rules applied. Total rules applied 354 place count 24 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 3 rules applied. Total rules applied 357 place count 24 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 359 place count 22 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 359 place count 22 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 361 place count 21 transition count 36
Performed 11 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 383 place count 10 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 387 place count 10 transition count 17
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 391 place count 8 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 393 place count 7 transition count 14
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 396 place count 7 transition count 11
Applied a total of 396 rules in 19 ms. Remains 7 /219 variables (removed 212) and now considering 11/245 (removed 234) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10689967242359474957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7975824011786863762.kers'
[2026-05-25 15:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10689967242359474957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7975824011786863762.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 11 rows 7 cols 20 entries
Finished phase 1 with 7 SingleSign rule and 0 generalized
[2026-05-25 15:51:11] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7975824011786863762.kers
Total runtime 1 ms.
[2026-05-25 15:51:11] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 15:51:11] [INFO ] Invariant cache hit.
[2026-05-25 15:51:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-25 15:51:11] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2026-05-25 15:51:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 7 unsolved in 91 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 14 constraints, problems are : Problem set: 0 solved, 7 unsolved in 107 ms.
Refiners :[State Equation: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 200ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 200ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/219 places, 11/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 7/219 places, 11/245 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 50 ms :[(NOT p0)]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-14
Product exploration explored 100000 steps with 20993 reset in 98 ms.
Product exploration explored 100000 steps with 21131 reset in 285 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 16 ms. Proved property starting from automaton with 1 states, 2 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 52 ms.
FORMULA IBM703-PT-none-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-14 finished in 812 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&&X(F(p0)))))'
Support contains 2 out of 219 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 245/245 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 206 transition count 232
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 206 transition count 232
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 200 transition count 226
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 200 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 200 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 196 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 196 transition count 221
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 192 transition count 217
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 192 transition count 217
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 188 transition count 213
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 188 transition count 213
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 184 transition count 209
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 184 transition count 209
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 180 transition count 205
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 180 transition count 205
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 178 transition count 203
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 178 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 84 place count 177 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 177 transition count 202
Applied a total of 85 rules in 33 ms. Remains 177 /219 variables (removed 42) and now considering 202/245 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-156805102916095221.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7719331062677985376.kers'
[2026-05-25 15:51:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-156805102916095221.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7719331062677985376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 177 cols 406 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-25 15:51:11] [INFO ] Computed 0 invariants in 1 ms
Computed 0 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7719331062677985376.kers
Total runtime 3 ms.
[2026-05-25 15:51:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-25 15:51:12] [INFO ] Invariant cache hit.
[2026-05-25 15:51:12] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 201 sub problems to find dead transitions.
[2026-05-25 15:51:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (OVERLAPS) 1/379 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 379/379 variables, and 177 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30020 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 201 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 1 (OVERLAPS) 202/378 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 201/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 4 (OVERLAPS) 1/379 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 201 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 379/379 variables, and 378 constraints, problems are : Problem set: 0 solved, 201 unsolved in 30017 ms.
Refiners :[State Equation: 177/177 constraints, PredecessorRefiner: 201/201 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 201 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 177/219 places, 202/245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60363 ms. Remains : 177/219 places, 202/245 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(F(p0))&&p0)))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : IBM703-PT-none-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 116 ms.
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Computed a total of 177 stabilizing places and 202 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 177 transition count 202
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 18 ms. Proved property starting from automaton with 4 states, 5 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 140 ms.
FORMULA IBM703-PT-none-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IBM703-PT-none-LTLCardinality-15 finished in 60974 ms.
All properties solved by simple procedures.
Total runtime 497470 ms.

BK_STOP 1779724333287

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM703-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is IBM703-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM703-PT-none.tgz
mv IBM703-PT-none execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;