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.r194-tall-177969914100459.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 ParamProductionCell-PT-0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914100459
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.5K Mar 8 08:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 8 08:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 8 08:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 8 08:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Mar 16 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 16 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 16 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 16 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 8 08:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Mar 8 08:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 8 08:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Mar 8 08:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 16 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 16 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 149K 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 ParamProductionCell-PT-0-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779783203133

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-26 08:13:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 08:13:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 08:13:24] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2026-05-26 08:13:24] [INFO ] Transformed 198 places.
[2026-05-26 08:13:24] [INFO ] Transformed 176 transitions.
[2026-05-26 08:13:24] [INFO ] Found NUPN structural information;
[2026-05-26 08:13:24] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-0-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 31 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17165537192029614912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8008558106779379341.kers'
[2026-05-26 08:13:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17165537192029614912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8008558106779379341.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 171 rows 181 cols 468 entries
Finished phase 1 with 108 SingleSign rule and 36 generalized
[2026-05-26 08:13:24] [INFO ] Computed 49 invariants in 2 ms
Computed 49 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-8008558106779379341.kers
Total runtime 9 ms.
[2026-05-26 08:13:25] [INFO ] Implicit Places using invariants in 382 ms returned [15, 18, 19, 24, 31, 35, 41, 42, 47, 59, 64, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 160, 161, 163, 166]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 421 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/198 places, 171/176 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 164 transition count 169
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 164 transition count 169
Applied a total of 4 rules in 21 ms. Remains 164 /166 variables (removed 2) and now considering 169/171 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2926258381434302663.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15148999283902013797.kers'
[2026-05-26 08:13:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2926258381434302663.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15148999283902013797.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 169 rows 158 cols 360 entries
Finished phase 1 with 141 SingleSign rule and 1 generalized
[2026-05-26 08:13:25] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15148999283902013797.kers
Total runtime 1 ms.
[2026-05-26 08:13:25] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 08:13:25] [INFO ] Invariant cache hit.
[2026-05-26 08:13:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:13:25] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 164/198 places, 169/176 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 836 ms. Remains : 164/198 places, 169/176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2026-05-26 08:13:25] [INFO ] Invariant cache hit.
[2026-05-26 08:13:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-26 08:13:25] [INFO ] Invariant cache hit.
[2026-05-26 08:13:25] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:13:25] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2026-05-26 08:13:25] [INFO ] Invariant cache hit.
[2026-05-26 08:13:25] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 2/164 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 169/333 variables, 164/220 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 59/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/333 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 279 constraints, problems are : Problem set: 0 solved, 168 unsolved in 13830 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 34/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 2/164 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 169/333 variables, 164/220 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 59/279 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 168/447 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/333 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 447 constraints, problems are : Problem set: 0 solved, 168 unsolved in 15785 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 164/164 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29668ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 29684ms
Finished structural reductions in LTL mode , in 1 iterations and 30001 ms. Remains : 164/164 places, 169/169 transitions.
Support contains 27 out of 164 places after structural reductions.
[2026-05-26 08:13:55] [INFO ] Flatten gal took : 33 ms
[2026-05-26 08:13:55] [INFO ] Flatten gal took : 15 ms
[2026-05-26 08:13:55] [INFO ] Input system was already deterministic with 169 transitions.
RANDOM walk for 4303 steps (1 resets) in 145 ms. (29 steps per ms) remains 0/17 properties
Computed a total of 0 stabilizing places and 0 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' '!(F(G(p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 164 transition count 144
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 139 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 137 transition count 142
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 54 place count 137 transition count 133
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 72 place count 128 transition count 133
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 73 place count 127 transition count 132
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 127 transition count 132
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 156 place count 85 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 156 place count 85 transition count 91
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 158 place count 84 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 83 transition count 90
Applied a total of 160 rules in 33 ms. Remains 83 /164 variables (removed 81) and now considering 90/169 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12385398110002916542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10667119515402361500.kers'
[2026-05-26 08:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12385398110002916542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10667119515402361500.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 90 rows 79 cols 202 entries
Finished phase 1 with 62 SingleSign rule and 1 generalized
[2026-05-26 08:13:56] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10667119515402361500.kers
Total runtime 6 ms.
[2026-05-26 08:13:56] [INFO ] Implicit Places using invariants in 111 ms returned [0, 1, 24, 69]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 112 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/164 places, 90/169 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 79 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 78 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 75 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 74 transition count 85
Applied a total of 10 rules in 8 ms. Remains 74 /79 variables (removed 5) and now considering 85/90 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12839006860588439203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6447444925314226048.kers'
[2026-05-26 08:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12839006860588439203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6447444925314226048.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 85 rows 70 cols 182 entries
Finished phase 1 with 58 SingleSign rule and 0 generalized
[2026-05-26 08:13:56] [INFO ] Computed 16 invariants in 0 ms
Computed 16 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-6447444925314226048.kers
Total runtime 7 ms.
[2026-05-26 08:13:56] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-26 08:13:56] [INFO ] Invariant cache hit.
[2026-05-26 08:13:56] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:13:56] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/164 places, 85/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 603 ms. Remains : 74/164 places, 85/169 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 582 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 371 ms.
Stack based approach found an accepted trace after 101 steps with 0 reset with depth 102 and stack size 102 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-03 finished in 1649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 168
Applied a total of 2 rules in 13 ms. Remains 163 /164 variables (removed 1) and now considering 168/169 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10578963691429807449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4227024231255285156.kers'
[2026-05-26 08:13:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10578963691429807449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4227024231255285156.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 168 rows 157 cols 358 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-26 08:13:57] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4227024231255285156.kers
Total runtime 1 ms.
[2026-05-26 08:13:57] [INFO ] Implicit Places using invariants in 158 ms returned [15, 30, 38, 137]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 160 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 177 ms. Remains : 159/164 places, 168/169 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p1))))))'
Stuttering acceptance computed with spot in 229 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-04
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Product exploration explored 100000 steps with 25000 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 224 ms. (177 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7515366488889869136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8910987084361225473.kers'
[2026-05-26 08:13:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7515366488889869136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8910987084361225473.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 168 rows 153 cols 348 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-26 08:13:58] [INFO ] Computed 18 invariants in 0 ms
Computed 18 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8910987084361225473.kers
Total runtime 1 ms.
[2026-05-26 08:13:58] [INFO ] State equation strengthened by 59 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 1/327 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 0/18 constraints, State Equation: 0/159 constraints, ReadFeed: 0/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 481 ms.
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 1 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2026-05-26 08:13:59] [INFO ] Invariant cache hit.
[2026-05-26 08:13:59] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-26 08:13:59] [INFO ] Invariant cache hit.
[2026-05-26 08:13:59] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:13:59] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-26 08:13:59] [INFO ] Invariant cache hit.
[2026-05-26 08:13:59] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/159 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 168/327 variables, 159/209 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 59/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/327 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 269 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13491 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 159/159 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/327 variables, 159/210 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 59/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 167/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 436 constraints, problems are : Problem set: 0 solved, 167 unsolved in 15202 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 159/159 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28711ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 28712ms
Finished structural reductions in LTL mode , in 1 iterations and 29035 ms. Remains : 159/159 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 666 steps (0 resets) in 17 ms. (37 steps per ms) remains 0/2 properties
Knowledge based reduction with 2 factoid took 64 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Knowledge-based reduction took 285 ms.
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 85 ms.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Spot run failed in 81 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4859858657982182424
[2026-05-26 08:14:28] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4859858657982182424
Running compilation step : cd /tmp/ltsmin4859858657982182424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin4859858657982182424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4859858657982182424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13842388347940367008.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-04 finished in 31866 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))))))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 168
Applied a total of 2 rules in 6 ms. Remains 163 /164 variables (removed 1) and now considering 168/169 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4245021637321058585.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1245428398241538848.kers'
[2026-05-26 08:14:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4245021637321058585.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1245428398241538848.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 168 rows 157 cols 358 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-26 08:14:29] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1245428398241538848.kers
Total runtime 1 ms.
[2026-05-26 08:14:29] [INFO ] Implicit Places using invariants in 88 ms returned [15, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/164 places, 168/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 97 ms. Remains : 161/164 places, 168/169 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))))))'
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-07 finished in 369 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((G((X(p1)&&(p1||X(p2))))||p0))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 169/169 (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-12911097939765479676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13329669835228300329.kers'
[2026-05-26 08:14:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12911097939765479676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13329669835228300329.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 169 rows 158 cols 360 entries
Finished phase 1 with 141 SingleSign rule and 1 generalized
[2026-05-26 08:14:29] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13329669835228300329.kers
Total runtime 2 ms.
[2026-05-26 08:14:29] [INFO ] Implicit Places using invariants in 86 ms returned [15, 30, 38, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 87 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/164 places, 169/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 160/164 places, 169/169 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((G((X(p1)&&(p1||X(p2))))||p0))))'
Stuttering acceptance computed with spot in 176 ms :[true, (OR (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-08 finished in 299 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))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 164 transition count 140
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 135 transition count 140
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 58 place count 135 transition count 132
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 127 transition count 132
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 126 transition count 131
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 126 transition count 131
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 162 place count 82 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 162 place count 82 transition count 88
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 164 place count 81 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 80 transition count 87
Applied a total of 166 rules in 20 ms. Remains 80 /164 variables (removed 84) and now considering 87/169 (removed 82) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17217608448975006332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10418924054962618828.kers'
[2026-05-26 08:14:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17217608448975006332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10418924054962618828.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 87 rows 76 cols 196 entries
Finished phase 1 with 59 SingleSign rule and 1 generalized
[2026-05-26 08:14:30] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10418924054962618828.kers
Total runtime 1 ms.
[2026-05-26 08:14:30] [INFO ] Implicit Places using invariants in 59 ms returned [0, 1, 11, 18, 23, 69]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 59 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/164 places, 87/169 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 74 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 86
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 68 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 67 transition count 80
Applied a total of 14 rules in 5 ms. Remains 67 /74 variables (removed 7) and now considering 80/87 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15005592014158706629.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10023314697205555011.kers'
[2026-05-26 08:14:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15005592014158706629.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10023314697205555011.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 80 rows 63 cols 168 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-26 08:14:30] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10023314697205555011.kers
Total runtime 0 ms.
[2026-05-26 08:14:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-26 08:14:30] [INFO ] Invariant cache hit.
[2026-05-26 08:14:30] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:14:30] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/164 places, 80/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 67/164 places, 80/169 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))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-09
Product exploration explored 100000 steps with 1303 reset in 82 ms.
Product exploration explored 100000 steps with 1314 reset in 116 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 290 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
[2026-05-26 08:14:30] [INFO ] Invariant cache hit.
[2026-05-26 08:14:30] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2026-05-26 08:14:30] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2026-05-26 08:14:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:14:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2026-05-26 08:14:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-26 08:14:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:14:31] [INFO ] [Nat]Added 58 Read/Feed constraints in 6 ms returned sat
[2026-05-26 08:14:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 415 ms
[2026-05-26 08:14:31] [INFO ] Computed and/alt/rep : 79/195/79 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-26 08:14:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 198 ms
[2026-05-26 08:14:31] [INFO ] Added : 74 causal constraints over 17 iterations in 360 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1160 ms.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2026-05-26 08:14:31] [INFO ] Invariant cache hit.
[2026-05-26 08:14:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-26 08:14:31] [INFO ] Invariant cache hit.
[2026-05-26 08:14:31] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:14:32] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2026-05-26 08:14:32] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2026-05-26 08:14:32] [INFO ] Invariant cache hit.
[2026-05-26 08:14:32] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/113 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 58/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 172 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4242 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 80/147 variables, 67/116 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 58/174 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 79/253 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 254 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 67/67 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7764ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 7764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7943 ms. Remains : 67/67 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 53 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
RANDOM walk for 324 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2026-05-26 08:14:40] [INFO ] Invariant cache hit.
[2026-05-26 08:14:40] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2026-05-26 08:14:40] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2026-05-26 08:14:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:14:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2026-05-26 08:14:40] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-26 08:14:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:14:40] [INFO ] [Nat]Added 58 Read/Feed constraints in 7 ms returned sat
[2026-05-26 08:14:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 429 ms
[2026-05-26 08:14:40] [INFO ] Computed and/alt/rep : 79/195/79 causal constraints (skipped 0 transitions) in 5 ms.
[2026-05-26 08:14:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 202 ms
[2026-05-26 08:14:40] [INFO ] Added : 74 causal constraints over 17 iterations in 344 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1135 ms.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1312 reset in 103 ms.
Product exploration explored 100000 steps with 1313 reset in 131 ms.
Built C files in :
/tmp/ltsmin4828958431914260194
[2026-05-26 08:14:41] [INFO ] Computing symmetric may disable matrix : 80 transitions.
[2026-05-26 08:14:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:14:41] [INFO ] Computing symmetric may enable matrix : 80 transitions.
[2026-05-26 08:14:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:14:41] [INFO ] Computing Do-Not-Accords matrix : 80 transitions.
[2026-05-26 08:14:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:14:41] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4828958431914260194
Running compilation step : cd /tmp/ltsmin4828958431914260194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 202 ms.
Running link step : cd /tmp/ltsmin4828958431914260194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4828958431914260194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15401753159816027526.hoa' '--buchi-type=spotba'
LTSmin run took 59 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-09 finished in 11494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(p2)&&F(p3))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 168
Applied a total of 2 rules in 4 ms. Remains 163 /164 variables (removed 1) and now considering 168/169 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16574226720808464586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16314396618762641212.kers'
[2026-05-26 08:14:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16574226720808464586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16314396618762641212.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 168 rows 157 cols 358 entries
Finished phase 1 with 140 SingleSign rule and 1 generalized
[2026-05-26 08:14:41] [INFO ] Computed 22 invariants in 1 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16314396618762641212.kers
Total runtime 2 ms.
[2026-05-26 08:14:41] [INFO ] Implicit Places using invariants in 107 ms returned [15, 30, 38, 137]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 109 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/169 transitions.
Applied a total of 0 rules in 1 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 159/164 places, 168/169 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(p2)&&F(p3))))'
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p3) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-10 finished in 379 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((F(p0)&&F(p1))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 163 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 163 transition count 168
Applied a total of 2 rules in 5 ms. Remains 163 /164 variables (removed 1) and now considering 168/169 (removed 1) transitions.
[2026-05-26 08:14:42] [INFO ] Invariant cache hit.
[2026-05-26 08:14:42] [INFO ] Implicit Places using invariants in 80 ms returned [15, 30, 38, 137]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 83 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/164 places, 168/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 159/164 places, 168/169 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((F(p0)&&F(p1))))'
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-11
Product exploration explored 100000 steps with 5109 reset in 94 ms.
Product exploration explored 100000 steps with 5100 reset in 104 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 11 factoid took 50 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 77 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
Knowledge based reduction with 11 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-110952226239261694.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10197995717795035157.kers'
[2026-05-26 08:14:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-110952226239261694.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10197995717795035157.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 168 rows 153 cols 348 entries
Finished phase 1 with 141 SingleSign rule and 0 generalized
[2026-05-26 08:14:42] [INFO ] Computed 18 invariants in 2 ms
Computed 18 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10197995717795035157.kers
Total runtime 3 ms.
[2026-05-26 08:14:42] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2026-05-26 08:14:42] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2026-05-26 08:14:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:14:43] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2026-05-26 08:14:43] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2026-05-26 08:14:43] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:14:43] [INFO ] [Nat]Added 59 Read/Feed constraints in 23 ms returned sat
[2026-05-26 08:14:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2026-05-26 08:14:43] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 10 ms.
[2026-05-26 08:14:43] [INFO ] Added : 15 causal constraints over 3 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1028 ms.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 159 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2026-05-26 08:14:43] [INFO ] Invariant cache hit.
[2026-05-26 08:14:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-26 08:14:43] [INFO ] Invariant cache hit.
[2026-05-26 08:14:43] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:14:44] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 167 sub problems to find dead transitions.
[2026-05-26 08:14:44] [INFO ] Invariant cache hit.
[2026-05-26 08:14:44] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 20/36 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 11/47 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 2/159 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 168/327 variables, 159/209 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 59/268 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 0/327 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/327 variables, and 269 constraints, problems are : Problem set: 0 solved, 167 unsolved in 13115 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 159/159 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (OVERLAPS) 2/159 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 168/327 variables, 159/210 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 59/269 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/327 variables, 167/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/327 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (OVERLAPS) 0/327 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/327 variables, and 436 constraints, problems are : Problem set: 0 solved, 167 unsolved in 14885 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 159/159 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28013ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 28016ms
Finished structural reductions in LTL mode , in 1 iterations and 28407 ms. Remains : 159/159 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
RANDOM walk for 72 steps (0 resets) in 4 ms. (14 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2026-05-26 08:15:12] [INFO ] Invariant cache hit.
[2026-05-26 08:15:12] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2026-05-26 08:15:12] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2026-05-26 08:15:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 08:15:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2026-05-26 08:15:12] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2026-05-26 08:15:12] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-26 08:15:12] [INFO ] [Nat]Added 59 Read/Feed constraints in 22 ms returned sat
[2026-05-26 08:15:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2026-05-26 08:15:12] [INFO ] Computed and/alt/rep : 167/276/167 causal constraints (skipped 0 transitions) in 6 ms.
[2026-05-26 08:15:13] [INFO ] Added : 15 causal constraints over 3 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 1084 ms.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5111 reset in 91 ms.
Product exploration explored 100000 steps with 5104 reset in 94 ms.
Spot run failed in 43 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4669456717722746079
[2026-05-26 08:15:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4669456717722746079
Running compilation step : cd /tmp/ltsmin4669456717722746079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin4669456717722746079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4669456717722746079;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10511856589309006181.hoa' '--buchi-type=spotba'
LTSmin run took 26 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-11 finished in 31985 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(p1)||p0))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 169/169 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 164 transition count 142
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 137 transition count 142
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 54 place count 137 transition count 134
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 70 place count 129 transition count 134
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 128 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 128 transition count 133
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 154 place count 86 transition count 93
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 154 place count 86 transition count 92
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 156 place count 85 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 158 place count 84 transition count 91
Applied a total of 158 rules in 14 ms. Remains 84 /164 variables (removed 80) and now considering 91/169 (removed 78) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11815423872550703079.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15660566331339127721.kers'
[2026-05-26 08:15:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11815423872550703079.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15660566331339127721.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 91 rows 80 cols 204 entries
Finished phase 1 with 63 SingleSign rule and 1 generalized
[2026-05-26 08:15:14] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15660566331339127721.kers
Total runtime 0 ms.
[2026-05-26 08:15:14] [INFO ] Implicit Places using invariants in 62 ms returned [0, 1, 11, 18, 23, 73]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 63 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/164 places, 91/169 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 78 transition count 90
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 90
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 72 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 71 transition count 84
Applied a total of 14 rules in 5 ms. Remains 71 /78 variables (removed 7) and now considering 84/91 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7253712065458752258.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-994107600763401029.kers'
[2026-05-26 08:15:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7253712065458752258.kers, --Pflows, --basisKERS=/tmp/petrispot-output-994107600763401029.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 84 rows 67 cols 176 entries
Finished phase 1 with 57 SingleSign rule and 0 generalized
[2026-05-26 08:15:14] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-994107600763401029.kers
Total runtime 0 ms.
[2026-05-26 08:15:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-26 08:15:14] [INFO ] Invariant cache hit.
[2026-05-26 08:15:14] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:15:14] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/164 places, 84/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 71/164 places, 84/169 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(p1)||p0))))'
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 9 factoid took 69 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
[2026-05-26 08:15:14] [INFO ] Invariant cache hit.
[2026-05-26 08:15:14] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/50 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/103 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 31/134 variables, 58/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/155 variables, 21/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 8/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/155 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/155 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 71/71 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 47/155 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 5/14 constraints, State Equation: 0/71 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 101ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 10 factoid took 93 ms. Proved property starting from automaton with 2 states, 4 edges and 2 AP (stutter insensitive
Knowledge-based reduction took 347 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLCardinality-12 finished in 926 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 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 164 transition count 140
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 135 transition count 140
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 58 place count 135 transition count 131
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 76 place count 126 transition count 131
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 125 transition count 130
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 125 transition count 130
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 164 place count 81 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 164 place count 81 transition count 87
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 166 place count 80 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 168 place count 79 transition count 86
Applied a total of 168 rules in 14 ms. Remains 79 /164 variables (removed 85) and now considering 86/169 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9198262668788541757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-380428369670984254.kers'
[2026-05-26 08:15:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9198262668788541757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-380428369670984254.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 86 rows 75 cols 194 entries
Finished phase 1 with 58 SingleSign rule and 1 generalized
[2026-05-26 08:15:14] [INFO ] Computed 20 invariants in 0 ms
Computed 20 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-380428369670984254.kers
Total runtime 0 ms.
[2026-05-26 08:15:15] [INFO ] Implicit Places using invariants in 64 ms returned [0, 1, 11, 18, 23, 68]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/164 places, 86/169 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 73 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 67 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 66 transition count 79
Applied a total of 14 rules in 4 ms. Remains 66 /73 variables (removed 7) and now considering 79/86 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17517587943769123455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2494753057935218551.kers'
[2026-05-26 08:15:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17517587943769123455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2494753057935218551.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 79 rows 62 cols 166 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-26 08:15:15] [INFO ] Computed 14 invariants in 0 ms
Computed 14 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2494753057935218551.kers
Total runtime 0 ms.
[2026-05-26 08:15:15] [INFO ] Implicit Places using invariants in 49 ms returned []
[2026-05-26 08:15:15] [INFO ] Invariant cache hit.
[2026-05-26 08:15:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:15:15] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/164 places, 79/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 66/164 places, 79/169 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 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-15
Product exploration explored 100000 steps with 1400 reset in 80 ms.
Product exploration explored 100000 steps with 1407 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 182 steps (0 resets) in 5 ms. (30 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 222 ms.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 79/79 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 79/79 (removed 0) transitions.
[2026-05-26 08:15:15] [INFO ] Invariant cache hit.
[2026-05-26 08:15:15] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-26 08:15:15] [INFO ] Invariant cache hit.
[2026-05-26 08:15:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-26 08:15:15] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-26 08:15:15] [INFO ] Redundant transitions in 2 ms returned []
Running 78 sub problems to find dead transitions.
[2026-05-26 08:15:15] [INFO ] Invariant cache hit.
[2026-05-26 08:15:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/116 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 58/174 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/145 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 175 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3691 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 37/51 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 79/145 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 58/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 78/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 255 constraints, problems are : Problem set: 0 solved, 78 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7120ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 7121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7290 ms. Remains : 66/66 places, 79/79 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 237 steps (0 resets) in 4 ms. (47 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 190 ms.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1443 reset in 83 ms.
Product exploration explored 100000 steps with 1438 reset in 90 ms.
Built C files in :
/tmp/ltsmin16127738673468414693
[2026-05-26 08:15:23] [INFO ] Computing symmetric may disable matrix : 79 transitions.
[2026-05-26 08:15:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:15:23] [INFO ] Computing symmetric may enable matrix : 79 transitions.
[2026-05-26 08:15:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:15:23] [INFO ] Computing Do-Not-Accords matrix : 79 transitions.
[2026-05-26 08:15:23] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-26 08:15:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16127738673468414693
Running compilation step : cd /tmp/ltsmin16127738673468414693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin16127738673468414693;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16127738673468414693;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased130633299608794376.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLCardinality-15 finished in 9037 ms.
All properties solved by simple procedures.
Total runtime 119724 ms.

BK_STOP 1779783324025

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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