About the Execution of ITS-Tools for GlobalResAllocation-COL-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 525.012 | 13698.00 | 24336.00 | 101.50 | FTFFFFFTTFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074000180.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 GlobalResAllocation-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.4K Mar 7 12:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 12:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 7 12:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 7 12:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 10:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 15 10:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 7 12:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 12:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Mar 7 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 28K 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 GlobalResAllocation-COL-05-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779705324784
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-25 10:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 10:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:35:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-25 10:35:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-25 10:35:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 535 ms
[2026-05-25 10:35:26] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 75 PT places and 56105.0 transition bindings in 13 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA GlobalResAllocation-COL-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 10:35:26] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 5 ms.
[2026-05-25 10:35:26] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-05-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 23 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/3 properties
[2026-05-25 10:35:26] [INFO ] Flatten gal took : 13 ms
[2026-05-25 10:35:26] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 10
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2026-05-25 10:35:26] [INFO ] Unfolded HLPN to a Petri net with 21 places and 35 transitions 145 arcs in 13 ms.
[2026-05-25 10:35:26] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 35/35 transitions.
Reduce isomorphic (modulo) transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 30
Applied a total of 10 rules in 8 ms. Remains 21 /21 variables (removed 0) and now considering 30/35 (removed 5) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2769872666561698914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15086336732188000270.kers'
[2026-05-25 10:35:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2769872666561698914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15086336732188000270.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:26] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15086336732188000270.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 10 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 663ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 677ms
[2026-05-25 10:35:27] [INFO ] Invariant cache hit.
[2026-05-25 10:35:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-25 10:35:27] [INFO ] Invariant cache hit.
[2026-05-25 10:35:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 21/21 places, 30/35 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 810 ms. Remains : 21/21 places, 30/35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:27] [INFO ] Invariant cache hit.
[2026-05-25 10:35:27] [INFO ] Implicit Places using invariants in 16 ms returned []
[2026-05-25 10:35:27] [INFO ] Invariant cache hit.
[2026-05-25 10:35:27] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 21/21 places, 30/30 transitions.
Support contains 21 out of 21 places after structural reductions.
[2026-05-25 10:35:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:35:27] [INFO ] Flatten gal took : 7 ms
[2026-05-25 10:35:27] [INFO ] Input system was already deterministic with 30 transitions.
Reduction of identical properties reduced properties to check from 13 to 10
RANDOM walk for 38 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/10 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' '!(X(F(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0))))||(X(p2)&&F(p3))))))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:28] [INFO ] Invariant cache hit.
[2026-05-25 10:35:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2026-05-25 10:35:28] [INFO ] Invariant cache hit.
[2026-05-25 10:35:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 21/21 places, 30/30 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(((X(!p0) U (X(G(!p0))||(!p1&&X(!p0))))||(X(p2)&&F(p3))))))'
Stuttering acceptance computed with spot in 377 ms :[(OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p3)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p3)), (AND p0 (NOT p2)), (AND p0 (NOT p3))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-00
Product exploration explored 100000 steps with 14526 reset in 415 ms.
Stack based approach found an accepted trace after 37 steps with 5 reset with depth 9 and stack size 9 in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-00 finished in 936 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 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 10 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14157298995938316672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15620858254199039464.kers'
[2026-05-25 10:35:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14157298995938316672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15620858254199039464.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:29] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15620858254199039464.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 305ms
[2026-05-25 10:35:29] [INFO ] Invariant cache hit.
[2026-05-25 10:35:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 10:35:29] [INFO ] Invariant cache hit.
[2026-05-25 10:35:29] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2026-05-25 10:35:29] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 394 ms. Remains : 16/21 places, 30/30 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 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-01
Product exploration explored 100000 steps with 11888 reset in 181 ms.
Product exploration explored 100000 steps with 11849 reset in 192 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 131 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 24 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 85 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 58 ms :[(NOT p0), (NOT p0)]
[2026-05-25 10:35:30] [INFO ] Invariant cache hit.
[2026-05-25 10:35:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 10:35:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2026-05-25 10:35:30] [INFO ] Computed and/alt/rep : 10/40/10 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 10:35:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:35:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 10:35:30] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2026-05-25 10:35:30] [INFO ] Computed and/alt/rep : 10/40/10 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 10:35:30] [INFO ] Added : 8 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 414 ms.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:30] [INFO ] Invariant cache hit.
[2026-05-25 10:35:30] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 10:35:30] [INFO ] Invariant cache hit.
[2026-05-25 10:35:30] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2026-05-25 10:35:30] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 16/16 places, 30/30 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 79 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 31 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 86 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 74 ms :[(NOT p0), (NOT p0)]
[2026-05-25 10:35:30] [INFO ] Invariant cache hit.
[2026-05-25 10:35:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 10:35:30] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2026-05-25 10:35:30] [INFO ] Computed and/alt/rep : 10/40/10 causal constraints (skipped 0 transitions) in 2 ms.
[2026-05-25 10:35:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:35:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-25 10:35:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2026-05-25 10:35:30] [INFO ] Computed and/alt/rep : 10/40/10 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 10:35:30] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 355 ms.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11920 reset in 186 ms.
Product exploration explored 100000 steps with 11828 reset in 161 ms.
Built C files in :
/tmp/ltsmin14211436648019969102
[2026-05-25 10:35:31] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2026-05-25 10:35:31] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:31] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2026-05-25 10:35:31] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:31] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2026-05-25 10:35:31] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 10:35:31] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14211436648019969102
Running compilation step : cd /tmp/ltsmin14211436648019969102;'/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 217 ms.
Running link step : cd /tmp/ltsmin14211436648019969102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin14211436648019969102;'/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/stateBased475161340984856455.hoa' '--buchi-type=spotba'
LTSmin run took 151 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-05-LTLFireability-01 finished in 2837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X(p0)) U X(G(!p0)))))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11288287067064736740.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13942447968488906999.kers'
[2026-05-25 10:35:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11288287067064736740.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13942447968488906999.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:31] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13942447968488906999.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 10 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 361ms
[2026-05-25 10:35:32] [INFO ] Invariant cache hit.
[2026-05-25 10:35:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 10:35:32] [INFO ] Invariant cache hit.
[2026-05-25 10:35:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 21/21 places, 30/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0)&&p0) U X(G(!p0)))))'
Stuttering acceptance computed with spot in 123 ms :[p0, p0, true, p0]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-02 finished in 576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X((F(!p2)||p1))))||p0)))'
Support contains 15 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:32] [INFO ] Invariant cache hit.
[2026-05-25 10:35:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 10:35:32] [INFO ] Invariant cache hit.
[2026-05-25 10:35:32] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 21/21 places, 30/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(X((F(p2)||p1))))||p0)))'
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-04
Product exploration explored 100000 steps with 420 reset in 194 ms.
Stack based approach found an accepted trace after 2229 steps with 3 reset with depth 12 and stack size 12 in 6 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-04 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1829585416526056249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13863592429652274907.kers'
[2026-05-25 10:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1829585416526056249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13863592429652274907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:33] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13863592429652274907.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 250ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 250ms
[2026-05-25 10:35:33] [INFO ] Invariant cache hit.
[2026-05-25 10:35:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 10:35:33] [INFO ] Invariant cache hit.
[2026-05-25 10:35:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2026-05-25 10:35:33] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 16/21 places, 30/30 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 35 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 154 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-05 finished in 539 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((G(p1) U (p2 U X(!p3)))&&F(p3))))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3815220630083388843.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5302394720082864420.kers'
[2026-05-25 10:35:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3815220630083388843.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5302394720082864420.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:33] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5302394720082864420.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 10 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 313ms
[2026-05-25 10:35:33] [INFO ] Invariant cache hit.
[2026-05-25 10:35:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 10:35:33] [INFO ] Invariant cache hit.
[2026-05-25 10:35:34] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 21/21 places, 30/30 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U ((G(p1) U (p2 U X(!p3)))&&F(p3))))'
Stuttering acceptance computed with spot in 379 ms :[true, p3, (NOT p3), p3, (AND (NOT p1) p3), p3, p3, true, (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-06
Entered a terminal (fully accepting) state of product in 15 steps with 2 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-06 finished in 792 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((G(p0) U p1))) U p0)||X(X(X(G(p2)))))))'
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:34] [INFO ] Invariant cache hit.
[2026-05-25 10:35:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2026-05-25 10:35:34] [INFO ] Invariant cache hit.
[2026-05-25 10:35:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 21/21 places, 30/30 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((G(p0) U p1))) U p0)||X(X(X(G(p2)))))))'
Stuttering acceptance computed with spot in 429 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-09
Product exploration explored 100000 steps with 671 reset in 251 ms.
Stack based approach found an accepted trace after 70 steps with 1 reset with depth 68 and stack size 67 in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-09 finished in 787 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(G(p0)) U (X(X(p0))||p1))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9528976404823662350.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7312941930231253634.kers'
[2026-05-25 10:35:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9528976404823662350.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7312941930231253634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:35] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7312941930231253634.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 233ms
[2026-05-25 10:35:35] [INFO ] Invariant cache hit.
[2026-05-25 10:35:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2026-05-25 10:35:35] [INFO ] Invariant cache hit.
[2026-05-25 10:35:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 16/21 places, 30/30 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(G(p0)) U (X(X(p0))||p1))))'
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 82 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 68 ms. Proved property starting from automaton with 6 states, 9 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 75 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-05-LTLFireability-10 finished in 833 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 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8852380706285787178.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15504555886639121548.kers'
[2026-05-25 10:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8852380706285787178.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15504555886639121548.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:36] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15504555886639121548.kers
Total runtime 0 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 10 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 268ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 268ms
[2026-05-25 10:35:36] [INFO ] Invariant cache hit.
[2026-05-25 10:35:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 10:35:36] [INFO ] Invariant cache hit.
[2026-05-25 10:35:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2026-05-25 10:35:36] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 21/21 places, 30/30 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 38 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-12
Product exploration explored 100000 steps with 42129 reset in 186 ms.
Stack based approach found an accepted trace after 1937 steps with 816 reset with depth 4 and stack size 4 in 5 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-12 finished in 589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 10:35:36] [INFO ] Invariant cache hit.
[2026-05-25 10:35:36] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 10:35:36] [INFO ] Invariant cache hit.
[2026-05-25 10:35:36] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-25 10:35:36] [INFO ] Redundant transitions in 0 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 21/21 places, 30/30 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 27 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 199 ms.
Stack based approach found an accepted trace after 46 steps with 0 reset with depth 47 and stack size 47 in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-13 finished in 307 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((X(F(p0))||(!p1 U (p2||G(!p1)))))))'
Support contains 11 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16739723352205153158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16993687705150233734.kers'
[2026-05-25 10:35:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16739723352205153158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16993687705150233734.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:36] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16993687705150233734.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 30/46 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 10/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 242ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 242ms
[2026-05-25 10:35:37] [INFO ] Invariant cache hit.
[2026-05-25 10:35:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 10:35:37] [INFO ] Invariant cache hit.
[2026-05-25 10:35:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 16/21 places, 30/30 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((X(F(p0))||(!p1 U (p2||G(!p1)))))))'
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-14
Product exploration explored 100000 steps with 33333 reset in 143 ms.
Product exploration explored 100000 steps with 33333 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
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 19 ms. Proved property starting from automaton with 3 states, 4 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-05-LTLFireability-14 finished in 766 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 X(X(p1))))&&F((!p2&&(p0 U p1)))))'
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Running 10 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1059251926826469644.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2080605198163817536.kers'
[2026-05-25 10:35:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1059251926826469644.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2080605198163817536.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 0 ms.
// Phase 1: matrix 30 rows 16 cols 100 entries
Finished phase 1 with 10 SingleSign rule and 0 generalized
[2026-05-25 10:35:37] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2080605198163817536.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 32 constraints, problems are : Problem set: 0 solved, 10 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 6/21 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 10/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 10 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 262ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 262ms
[2026-05-25 10:35:37] [INFO ] Invariant cache hit.
[2026-05-25 10:35:37] [INFO ] Implicit Places using invariants in 18 ms returned []
[2026-05-25 10:35:37] [INFO ] Invariant cache hit.
[2026-05-25 10:35:38] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 21/21 places, 30/30 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 X(X(p1))))&&F((p2&&(p0 U p1)))))'
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-15 finished in 732 ms.
All properties solved by simple procedures.
Total runtime 12482 ms.
BK_STOP 1779705338482
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-COL-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-COL-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074000180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-05.tgz
mv GlobalResAllocation-COL-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
