Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r162-smll-177961107700123.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 IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-177961107700123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 8.4K Mar 7 17:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 17:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 17:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 7 17:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 11:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 11:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 7 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 7 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 121K Mar 7 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 11:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 11:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779728889318

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C05M04P03D02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 17:08:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 17:08:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 17:08:11] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2026-05-25 17:08:11] [INFO ] Transformed 111 places.
[2026-05-25 17:08:11] [INFO ] Transformed 45 transitions.
[2026-05-25 17:08:11] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 27 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 77 transition count 45
Applied a total of 34 rules in 44 ms. Remains 77 /111 variables (removed 34) and now considering 45/45 (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-23724378288064971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10915871194713702332.kers'
[2026-05-25 17:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-23724378288064971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10915871194713702332.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 45 rows 55 cols 110 entries
Finished phase 1 with 38 SingleSign rule and 6 generalized
[2026-05-25 17:08:12] [INFO ] Computed 33 invariants in 0 ms
Computed 33 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10915871194713702332.kers
Total runtime 2 ms.
[2026-05-25 17:08:12] [INFO ] Implicit Places using invariants in 411 ms returned [23, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/111 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 75/111 places, 45/45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 45/45 (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-11676603850190547764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2916634281889915765.kers'
[2026-05-25 17:08:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11676603850190547764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2916634281889915765.kers]
Culling duplicate invariants (modulo rational): removing 22 columns.
Culled 22 columns in 0 ms.
// Phase 1: matrix 45 rows 53 cols 106 entries
Finished phase 1 with 40 SingleSign rule and 4 generalized
[2026-05-25 17:08:12] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2916634281889915765.kers
Total runtime 1 ms.
[2026-05-25 17:08:12] [INFO ] Implicit Places using invariants in 109 ms returned []
[2026-05-25 17:08:12] [INFO ] Invariant cache hit.
[2026-05-25 17:08:12] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2026-05-25 17:08:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/120 variables, 75/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 106 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 14/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/75 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/120 variables, 75/106 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 44/150 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 150 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2157 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5112ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 5140ms
Finished structural reductions in LTL mode , in 1 iterations and 5507 ms. Remains : 75/75 places, 45/45 transitions.
Support contains 43 out of 75 places after structural reductions.
[2026-05-25 17:08:18] [INFO ] Flatten gal took : 34 ms
[2026-05-25 17:08:18] [INFO ] Flatten gal took : 14 ms
[2026-05-25 17:08:18] [INFO ] Input system was already deterministic with 45 transitions.
RANDOM walk for 40000 steps (8 resets) in 2163 ms. (18 steps per ms) remains 9/35 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
[2026-05-25 17:08:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 1 (OVERLAPS) 6/14 variables, 6/6 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/52 variables, 6/12 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 63/120 variables, and 21 constraints, problems are : Problem set: 7 solved, 0 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 6/16 constraints, State Equation: 0/75 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (F(G(p1)) U (!p0 U p2)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 66 transition count 45
Applied a total of 9 rules in 4 ms. Remains 66 /75 variables (removed 9) and now considering 45/45 (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-7339518567543344873.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8377445304340262534.kers'
[2026-05-25 17:08:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7339518567543344873.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8377445304340262534.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 53 cols 106 entries
Finished phase 1 with 40 SingleSign rule and 4 generalized
[2026-05-25 17:08:20] [INFO ] Computed 22 invariants in 0 ms
Computed 22 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8377445304340262534.kers
Total runtime 1 ms.
[2026-05-25 17:08:20] [INFO ] Implicit Places using invariants in 82 ms returned [5, 11, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 63/75 places, 45/45 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 (F(G(p1)) U (!p0 U p2)))))'
Stuttering acceptance computed with spot in 410 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00
Product exploration explored 100000 steps with 2207 reset in 457 ms.
Product exploration explored 100000 steps with 2199 reset in 295 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 81 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 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-8704488361386302176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1670157678364876766.kers'
[2026-05-25 17:08:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8704488361386302176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1670157678364876766.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 50 cols 100 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:08:21] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1670157678364876766.kers
Total runtime 1 ms.
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) 30/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf9 is UNSAT
After SMT solving in domain Real declared 45/108 variables, and 13 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 10/15 constraints, Generalized P Invariants (flows): 3/4 constraints, State Equation: 0/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 70ms 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 243 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p2), (NOT p2), (NOT p1), false, false, false, false]
[2026-05-25 17:08:22] [INFO ] Invariant cache hit.
[2026-05-25 17:08:22] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2026-05-25 17:08:22] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 4 ms returned sat
[2026-05-25 17:08:22] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 17:08:22] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 9 ms.
[2026-05-25 17:08:22] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 1192 ms.
Stuttering acceptance computed with spot in 395 ms :[(NOT p2), (NOT p2), (NOT p1), false, false, false, false]
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 63 transition count 40
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 55 transition count 36
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 23 place count 51 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 25 place count 49 transition count 34
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 25 place count 49 transition count 23
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 51 place count 34 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 51 place count 34 transition count 21
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 32 transition count 21
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 77 place count 18 transition count 13
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 80 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 82 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 85 place count 13 transition count 10
Applied a total of 85 rules in 45 ms. Remains 13 /63 variables (removed 50) and now considering 10/45 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15494691412568666908.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8753503832912181700.kers'
[2026-05-25 17:08:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15494691412568666908.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8753503832912181700.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 10 rows 10 cols 20 entries
Finished phase 1 with 9 SingleSign rule and 0 generalized
[2026-05-25 17:08:23] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8753503832912181700.kers
Total runtime 1 ms.
[2026-05-25 17:08:23] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 17:08:23] [INFO ] Invariant cache hit.
[2026-05-25 17:08:23] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2026-05-25 17:08:23] [INFO ] Redundant transitions in 1 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 17:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 26 constraints, problems are : Problem set: 0 solved, 9 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 376ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 377ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/63 places, 10/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 13/63 places, 10/45 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 17 factoid took 71 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
[2026-05-25 17:08:24] [INFO ] Invariant cache hit.
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
Problem apf7 is UNSAT
After SMT solving in domain Real declared 10/23 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 1/4 constraints, State Equation: 0/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 18 factoid took 193 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter insensitive) to 7 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (NOT p2), (NOT p1), false, false, false, false]
[2026-05-25 17:08:24] [INFO ] Invariant cache hit.
[2026-05-25 17:08:24] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2026-05-25 17:08:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2026-05-25 17:08:24] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 17:08:24] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p2)
Knowledge-based reduction took 851 ms.
Stuttering acceptance computed with spot in 329 ms :[(NOT p2), (NOT p2), (NOT p1), false, false, false, false]
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (NOT p2), (NOT p1), false, false, false, false]
Product exploration explored 100000 steps with 16239 reset in 152 ms.
Product exploration explored 100000 steps with 16253 reset in 178 ms.
Built C files in :
/tmp/ltsmin14832146081475916389
[2026-05-25 17:08:25] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2026-05-25 17:08:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:25] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2026-05-25 17:08:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:25] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2026-05-25 17:08:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14832146081475916389
Running compilation step : cd /tmp/ltsmin14832146081475916389;'/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 394 ms.
Running link step : cd /tmp/ltsmin14832146081475916389;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin14832146081475916389;'/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/stateBased14747136153496620992.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-00 finished in 6018 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 22 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 50 transition count 33
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 28 place count 50 transition count 21
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 58 place count 32 transition count 21
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 58 place count 32 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 66 place count 28 transition count 17
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 86 place count 16 transition count 9
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 14 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 88 place count 14 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 93 place count 11 transition count 7
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 94 place count 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 97 place count 9 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 98 place count 8 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 101 place count 6 transition count 4
Applied a total of 101 rules in 15 ms. Remains 6 /75 variables (removed 69) and now considering 4/45 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14400451954022048084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11933932526943474315.kers'
[2026-05-25 17:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14400451954022048084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11933932526943474315.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 4 cols 8 entries
Finished phase 1 with 2 SingleSign rule and 1 generalized
[2026-05-25 17:08:26] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11933932526943474315.kers
Total runtime 0 ms.
[2026-05-25 17:08:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 17:08:26] [INFO ] Invariant cache hit.
[2026-05-25 17:08:26] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2026-05-25 17:08:26] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-25 17:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/75 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 6/75 places, 4/45 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 45 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 184 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-02 finished in 540 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(F(p0))))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 7 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (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-6119163979354426875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11165379008180660403.kers'
[2026-05-25 17:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6119163979354426875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11165379008180660403.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:08:26] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11165379008180660403.kers
Total runtime 1 ms.
[2026-05-25 17:08:27] [INFO ] Implicit Places using invariants in 97 ms returned [5, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 63/75 places, 45/45 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(F(p0))))))'
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03
Product exploration explored 100000 steps with 20000 reset in 151 ms.
Product exploration explored 100000 steps with 20000 reset in 171 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 1 factoid took 49 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 217 steps (0 resets) in 8 ms. (24 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 57 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 297 ms.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (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-155722566958865399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16301548526243989427.kers'
[2026-05-25 17:08:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-155722566958865399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16301548526243989427.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 50 cols 100 entries
Finished phase 1 with 42 SingleSign rule and 2 generalized
[2026-05-25 17:08:28] [INFO ] Computed 19 invariants in 0 ms
Computed 19 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16301548526243989427.kers
Total runtime 1 ms.
[2026-05-25 17:08:28] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 17:08:28] [INFO ] Invariant cache hit.
[2026-05-25 17:08:28] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 44 sub problems to find dead transitions.
[2026-05-25 17:08:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/108 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 82 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/108 variables, 63/82 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 126 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1815 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3353ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3354ms
Finished structural reductions in LTL mode , in 1 iterations and 3541 ms. Remains : 63/63 places, 45/45 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 1 factoid took 69 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 216 steps (0 resets) in 6 ms. (30 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 390 ms.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 150 ms.
Product exploration explored 100000 steps with 20000 reset in 227 ms.
Spot run failed in 136 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/ltsmin4877580327698212012
[2026-05-25 17:08:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4877580327698212012
Running compilation step : cd /tmp/ltsmin4877580327698212012;'/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 247 ms.
Running link step : cd /tmp/ltsmin4877580327698212012;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4877580327698212012;'/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/stateBased10918240671996950841.hoa' '--buchi-type=spotba'
LTSmin run took 17 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-03 finished in 6412 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(((p0 U X(p1)) U p2)) U (X(p0) U p3)))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 6 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (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-10817000031855331971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15096622091433163650.kers'
[2026-05-25 17:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10817000031855331971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15096622091433163650.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:08:33] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15096622091433163650.kers
Total runtime 1 ms.
[2026-05-25 17:08:33] [INFO ] Implicit Places using invariants in 105 ms returned [6, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 63/75 places, 45/45 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(((p0 U X(p1)) U p2)) U (X(p0) U p3)))))'
Stuttering acceptance computed with spot in 363 ms :[(NOT p3), (NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), true, (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4541 steps with 511 reset in 9 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-04 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' '!(G((G(p0) U X((p1||F(G(p1))||G(p2))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 6 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (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-4336339883065857330.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2259497940924230718.kers'
[2026-05-25 17:08:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4336339883065857330.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2259497940924230718.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:08:33] [INFO ] Computed 21 invariants in 1 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2259497940924230718.kers
Total runtime 1 ms.
[2026-05-25 17:08:34] [INFO ] Implicit Places using invariants in 101 ms returned [5, 11, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 62/75 places, 45/45 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((G(p0) U X((p1||F(G(p1))||G(p2))))))'
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 883 steps with 0 reset with depth 884 and stack size 884 in 3 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-05 finished in 750 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||X(X((p1&&G(p2))))) U (p3&&X(p4))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 3 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (removed 0) transitions.
[2026-05-25 17:08:34] [INFO ] Invariant cache hit.
[2026-05-25 17:08:34] [INFO ] Implicit Places using invariants in 58 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 64/75 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 64 /64 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63 ms. Remains : 64/75 places, 45/45 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||X(X((p1&&G(p2))))) U (X(p3)&&p4)))'
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p4) (NOT p3)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 226 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 23 factoid took 12 ms. Proved property starting from automaton with 7 states, 15 edges and 5 AP (stutter sensitive
Knowledge-based reduction took 18 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-08 finished in 888 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 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 22 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 50 transition count 33
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 28 place count 50 transition count 20
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 60 place count 31 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 60 place count 31 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 27 transition count 16
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 86 place count 16 transition count 9
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 15 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 15 transition count 8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 13 transition count 8
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 93 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 93 place count 11 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 96 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 96 place count 9 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 98 place count 8 transition count 5
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 6 with 2 rules applied. Total rules applied 100 place count 7 transition count 4
Applied a total of 100 rules in 13 ms. Remains 7 /75 variables (removed 68) and now considering 4/45 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11863611811225695988.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6441132574066925441.kers'
[2026-05-25 17:08:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11863611811225695988.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6441132574066925441.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 5 cols 10 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 17:08:35] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6441132574066925441.kers
Total runtime 0 ms.
[2026-05-25 17:08:35] [INFO ] Implicit Places using invariants in 39 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/75 places, 4/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 6/75 places, 4/45 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 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09
Product exploration explored 100000 steps with 21195 reset in 102 ms.
Product exploration explored 100000 steps with 20972 reset in 120 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 65 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 68 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 97 ms :[(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-13282117545666876084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16861488844814331847.kers'
[2026-05-25 17:08:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13282117545666876084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16861488844814331847.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 4 rows 4 cols 8 entries
Finished phase 1 with 3 SingleSign rule and 0 generalized
[2026-05-25 17:08:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16861488844814331847.kers
Total runtime 0 ms.
[2026-05-25 17:08:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:08:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2026-05-25 17:08:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:08:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:08:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2026-05-25 17:08:36] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 17:08:36] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 311 ms.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2026-05-25 17:08:36] [INFO ] Invariant cache hit.
[2026-05-25 17:08:36] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-25 17:08:36] [INFO ] Invariant cache hit.
[2026-05-25 17:08:36] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-25 17:08:36] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
[2026-05-25 17:08:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/10 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 6/6 places, 4/4 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 65 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 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 84 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 90 ms :[(NOT p0), (NOT p0)]
[2026-05-25 17:08:36] [INFO ] Invariant cache hit.
[2026-05-25 17:08:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:08:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2026-05-25 17:08:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 17:08:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 17:08:36] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2026-05-25 17:08:36] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2026-05-25 17:08:36] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 304 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21333 reset in 97 ms.
Product exploration explored 100000 steps with 21169 reset in 114 ms.
Built C files in :
/tmp/ltsmin10990804023513946621
[2026-05-25 17:08:37] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2026-05-25 17:08:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:37] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2026-05-25 17:08:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:37] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2026-05-25 17:08:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 17:08:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10990804023513946621
Running compilation step : cd /tmp/ltsmin10990804023513946621;'/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 125 ms.
Running link step : cd /tmp/ltsmin10990804023513946621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10990804023513946621;'/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/stateBased15113012958031706892.hoa' '--buchi-type=spotba'
LTSmin run took 19 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-09 finished in 1966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 45/45 transitions.
Ensure Unique test removed 9 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 45
Applied a total of 10 rules in 1 ms. Remains 65 /75 variables (removed 10) and now considering 45/45 (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-2851978418984565789.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18205337027468908034.kers'
[2026-05-25 17:08:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2851978418984565789.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18205337027468908034.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 45 rows 52 cols 104 entries
Finished phase 1 with 41 SingleSign rule and 3 generalized
[2026-05-25 17:08:37] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18205337027468908034.kers
Total runtime 1 ms.
[2026-05-25 17:08:37] [INFO ] Implicit Places using invariants in 102 ms returned [5, 11, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 104 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/75 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 62 /62 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 62/75 places, 45/45 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C05M04P03D02-LTLCardinality-10 finished in 272 ms.
All properties solved by simple procedures.
Total runtime 26392 ms.

BK_STOP 1779728917863

--------------------
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="IOTPpurchase-PT-C05M04P03D02"
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 IOTPpurchase-PT-C05M04P03D02, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-177961107700123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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 ;