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.r034-tall-177946842100700.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 CANInsertWithFailure-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100700
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 6 10:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779662525749

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 22:42:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 22:42:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:42:07] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2026-05-24 22:42:07] [INFO ] Transformed 114 places.
[2026-05-24 22:42:07] [INFO ] Transformed 180 transitions.
[2026-05-24 22:42:07] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 17 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-383177302488067030.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9579122333242157125.kers'
[2026-05-24 22:42:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-383177302488067030.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9579122333242157125.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:42:07] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9579122333242157125.kers
Total runtime 2 ms.
[2026-05-24 22:42:07] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-24 22:42:07] [INFO ] Invariant cache hit.
[2026-05-24 22:42:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:42:07] [INFO ] Invariant cache hit.
[2026-05-24 22:42:07] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17844 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18751 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36653ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 36667ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37137 ms. Remains : 113/114 places, 180/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:44] [INFO ] Invariant cache hit.
[2026-05-24 22:42:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 22:42:44] [INFO ] Invariant cache hit.
[2026-05-24 22:42:44] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 113/113 places, 180/180 transitions.
Support contains 38 out of 113 places after structural reductions.
[2026-05-24 22:42:44] [INFO ] Flatten gal took : 32 ms
[2026-05-24 22:42:44] [INFO ] Flatten gal took : 14 ms
[2026-05-24 22:42:44] [INFO ] Input system was already deterministic with 180 transitions.
RANDOM walk for 35951 steps (347 resets) in 874 ms. (41 steps per ms) remains 0/31 properties
Computed a total of 22 stabilizing places and 35 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U (F(G(p2)) U p2)) U p3))'
Support contains 7 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 113 transition count 153
Reduce places removed 27 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 33 rules applied. Total rules applied 60 place count 86 transition count 147
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 63 transition count 118
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 63 transition count 118
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 61 transition count 116
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 61 transition count 116
Applied a total of 122 rules in 39 ms. Remains 61 /113 variables (removed 52) and now considering 116/180 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14336321639439808905.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6483298741997714009.kers'
[2026-05-24 22:42:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14336321639439808905.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6483298741997714009.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 61 cols 270 entries
Finished phase 1 with 49 SingleSign rule and 5 generalized
[2026-05-24 22:42:45] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6483298741997714009.kers
Total runtime 3 ms.
[2026-05-24 22:42:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 22:42:45] [INFO ] Invariant cache hit.
[2026-05-24 22:42:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2026-05-24 22:42:45] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2026-05-24 22:42:45] [INFO ] Redundant transitions in 3 ms returned []
Running 111 sub problems to find dead transitions.
[2026-05-24 22:42:45] [INFO ] Invariant cache hit.
[2026-05-24 22:42:45] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 116/176 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 66/133 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 1/177 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/177 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 177/177 variables, and 134 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 116/176 variables, 60/82 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/176 variables, 66/148 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/176 variables, 111/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/176 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/177 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/177 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 177/177 variables, and 260 constraints, problems are : Problem set: 0 solved, 111 unsolved in 10775 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15800ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 15801ms
Starting structural reductions in SI_LTL mode, iteration 1 : 61/113 places, 116/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16013 ms. Remains : 61/113 places, 116/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U G(p1)) U (F(G(p2)) U p2)) U p3))'
Stuttering acceptance computed with spot in 349 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-00
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-00 finished in 16465 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((X(p2)||p1))))))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1011187302423146948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15568621780131690811.kers'
[2026-05-24 22:43:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1011187302423146948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15568621780131690811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:43:02] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15568621780131690811.kers
Total runtime 1 ms.
[2026-05-24 22:43:02] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 22:43:02] [INFO ] Invariant cache hit.
[2026-05-24 22:43:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:43:02] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:43:02] [INFO ] Invariant cache hit.
[2026-05-24 22:43:02] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16612 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35711ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35714ms
Finished structural reductions in LTL mode , in 1 iterations and 35946 ms. Remains : 113/113 places, 180/180 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((X(p2)||p1))))))))'
Stuttering acceptance computed with spot in 311 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-01
Entered a terminal (fully accepting) state of product in 229 steps with 1 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-01 finished in 36313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 113 transition count 147
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 79 transition count 146
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 106 place count 60 transition count 127
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 60 transition count 115
Applied a total of 118 rules in 19 ms. Remains 60 /113 variables (removed 53) and now considering 115/180 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6670093039850168483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10490784832865547636.kers'
[2026-05-24 22:43:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6670093039850168483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10490784832865547636.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 60 cols 266 entries
Finished phase 1 with 48 SingleSign rule and 5 generalized
[2026-05-24 22:43:38] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10490784832865547636.kers
Total runtime 0 ms.
[2026-05-24 22:43:38] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 22:43:38] [INFO ] Invariant cache hit.
[2026-05-24 22:43:38] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 22:43:38] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-05-24 22:43:38] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-24 22:43:38] [INFO ] Invariant cache hit.
[2026-05-24 22:43:38] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 115/174 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 67/152 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/175 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 153 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7588 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 115/174 variables, 59/85 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 67/152 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 110/262 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/175 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/175 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/175 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 263 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9862 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17461ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 17463ms
Starting structural reductions in SI_LTL mode, iteration 1 : 60/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17634 ms. Remains : 60/113 places, 115/180 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 47 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-02
Product exploration explored 100000 steps with 3383 reset in 234 ms.
Stack based approach found an accepted trace after 348 steps with 10 reset with depth 15 and stack size 15 in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-02 finished in 17956 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(X(F(p0)))&&G(p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3365102863288201347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6914371710555522746.kers'
[2026-05-24 22:43:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3365102863288201347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6914371710555522746.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:43:56] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6914371710555522746.kers
Total runtime 0 ms.
[2026-05-24 22:43:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 22:43:56] [INFO ] Invariant cache hit.
[2026-05-24 22:43:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:43:56] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:43:56] [INFO ] Invariant cache hit.
[2026-05-24 22:43:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16879 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19096 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35990ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35991ms
Finished structural reductions in LTL mode , in 1 iterations and 36212 ms. Remains : 113/113 places, 180/180 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(F(p0)))&&G(p1))))'
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-04
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-04 finished in 36471 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 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 59 transition count 115
Applied a total of 119 rules in 18 ms. Remains 59 /113 variables (removed 54) and now considering 115/180 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6122840982065262645.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1081593713135198795.kers'
[2026-05-24 22:44:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6122840982065262645.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1081593713135198795.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 59 cols 265 entries
Finished phase 1 with 47 SingleSign rule and 5 generalized
[2026-05-24 22:44:32] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1081593713135198795.kers
Total runtime 1 ms.
[2026-05-24 22:44:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 22:44:32] [INFO ] Invariant cache hit.
[2026-05-24 22:44:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 22:44:32] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2026-05-24 22:44:32] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-24 22:44:32] [INFO ] Invariant cache hit.
[2026-05-24 22:44:32] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 115/173 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 150 constraints, problems are : Problem set: 0 solved, 110 unsolved in 6729 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 115/173 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 110/259 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 260 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9230 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15975ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 15976ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16147 ms. Remains : 59/113 places, 115/180 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 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-05
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-05 finished in 16266 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((X((p0||X(p1)))||F(p2))) U X(!p0)))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17110485394613019136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9457366964210504399.kers'
[2026-05-24 22:44:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17110485394613019136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9457366964210504399.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:44:49] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9457366964210504399.kers
Total runtime 2 ms.
[2026-05-24 22:44:49] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-24 22:44:49] [INFO ] Invariant cache hit.
[2026-05-24 22:44:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:44:49] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:44:49] [INFO ] Invariant cache hit.
[2026-05-24 22:44:49] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16896 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18509 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35416ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35417ms
Finished structural reductions in LTL mode , in 1 iterations and 35656 ms. Remains : 113/113 places, 180/180 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((X((p0||X(p1)))||F(p2))) U X(!p0)))'
Stuttering acceptance computed with spot in 263 ms :[p0, p0, (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 8 factoid took 19 ms. Proved property starting from automaton with 6 states, 9 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-06 finished in 36257 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((G(F(p1))||(F(p1)&&X(F(p2))))))) U G(p3)))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:25] [INFO ] Invariant cache hit.
[2026-05-24 22:45:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 22:45:25] [INFO ] Invariant cache hit.
[2026-05-24 22:45:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:25] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 113/113 places, 180/180 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((G(F(p1))||(F(p1)&&X(F(p2))))))) U G(p3)))'
Stuttering acceptance computed with spot in 324 ms :[(NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-07
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-07 finished in 604 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((p0||G(p1)))))||(p2 U G(p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:25] [INFO ] Invariant cache hit.
[2026-05-24 22:45:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 22:45:26] [INFO ] Invariant cache hit.
[2026-05-24 22:45:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:26] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 113/113 places, 180/180 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||X((p0||G(p1)))))||(p2 U G(p1))))'
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-08 finished in 567 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(((X(X(X(p0))) U p1)||p0))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:26] [INFO ] Invariant cache hit.
[2026-05-24 22:45:26] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 22:45:26] [INFO ] Invariant cache hit.
[2026-05-24 22:45:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:26] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 113/113 places, 180/180 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(X(X(p0))) U p1)||p0))))'
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), true]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-09 finished in 541 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(G(p0))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:27] [INFO ] Invariant cache hit.
[2026-05-24 22:45:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2026-05-24 22:45:27] [INFO ] Invariant cache hit.
[2026-05-24 22:45:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 113/113 places, 180/180 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(G(p0))))'
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-10
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-10 finished in 374 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((G(p0)||X(F(p1))))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:27] [INFO ] Invariant cache hit.
[2026-05-24 22:45:27] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-24 22:45:27] [INFO ] Invariant cache hit.
[2026-05-24 22:45:27] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:27] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 113/113 places, 180/180 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((G(p0)||X(F(p1))))))'
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-11
Product exploration explored 100000 steps with 1283 reset in 220 ms.
Product exploration explored 100000 steps with 1298 reset in 173 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge based reduction with 2 factoid took 63 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (414 resets) in 195 ms. (204 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40000 steps (45 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
[2026-05-24 22:45:28] [INFO ] Invariant cache hit.
[2026-05-24 22:45:28] [INFO ] State equation strengthened by 45 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 3/293 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[Positive P Invariants (semi-flows): 0/5 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/113 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 13 ms. Proved property starting from automaton with 5 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 213 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-11 finished in 1071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U X(!p1))))&&(G(p2) U X(p3))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:45:28] [INFO ] Invariant cache hit.
[2026-05-24 22:45:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-24 22:45:28] [INFO ] Invariant cache hit.
[2026-05-24 22:45:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:28] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 113/113 places, 180/180 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((p0 U X(!p1))))&&(G(p2) U X(p3))))'
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p3) p1), p1, (NOT p3), (NOT p3), p1, p1, p1, true, (NOT p2)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-13
Entered a terminal (fully accepting) state of product in 28 steps with 2 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-13 finished in 576 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(G(p0))&&F(p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 59 transition count 115
Applied a total of 119 rules in 14 ms. Remains 59 /113 variables (removed 54) and now considering 115/180 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4993964786481722082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2371995972811350026.kers'
[2026-05-24 22:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4993964786481722082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2371995972811350026.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 59 cols 265 entries
Finished phase 1 with 47 SingleSign rule and 5 generalized
[2026-05-24 22:45:29] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2371995972811350026.kers
Total runtime 2 ms.
[2026-05-24 22:45:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-24 22:45:29] [INFO ] Invariant cache hit.
[2026-05-24 22:45:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-24 22:45:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2026-05-24 22:45:29] [INFO ] Redundant transitions in 7 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-24 22:45:29] [INFO ] Invariant cache hit.
[2026-05-24 22:45:29] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 115/173 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 150 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7047 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 115/173 variables, 58/82 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 67/149 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 110/259 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 1/174 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 0/174 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 260 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9540 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16597ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 16597ms
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 115/180 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16766 ms. Remains : 59/113 places, 115/180 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(G(p0))&&F(p1))))'
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLFireability-15
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLFireability-15 finished in 16943 ms.
All properties solved by simple procedures.
Total runtime 219087 ms.

BK_STOP 1779662746064

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-005, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842100700"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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