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.r354-tall-178024402800131.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 LastZero-PT-N20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.9K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 11K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 3.1M Jun 10 11:58 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 LastZero-PT-N20-LTLCardinality-00
FORMULA_NAME LastZero-PT-N20-LTLCardinality-01
FORMULA_NAME LastZero-PT-N20-LTLCardinality-02
FORMULA_NAME LastZero-PT-N20-LTLCardinality-03
FORMULA_NAME LastZero-PT-N20-LTLCardinality-04
FORMULA_NAME LastZero-PT-N20-LTLCardinality-05
FORMULA_NAME LastZero-PT-N20-LTLCardinality-06
FORMULA_NAME LastZero-PT-N20-LTLCardinality-07
FORMULA_NAME LastZero-PT-N20-LTLCardinality-08
FORMULA_NAME LastZero-PT-N20-LTLCardinality-09
FORMULA_NAME LastZero-PT-N20-LTLCardinality-10
FORMULA_NAME LastZero-PT-N20-LTLCardinality-11
FORMULA_NAME LastZero-PT-N20-LTLCardinality-12
FORMULA_NAME LastZero-PT-N20-LTLCardinality-13
FORMULA_NAME LastZero-PT-N20-LTLCardinality-14
FORMULA_NAME LastZero-PT-N20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1781642950173

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-06-16 20:49: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-06-16 20:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:49:11] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2026-06-16 20:49:11] [INFO ] Transformed 924 places.
[2026-06-16 20:49:11] [INFO ] Transformed 10061 transitions.
[2026-06-16 20:49:11] [INFO ] Parsed PT model containing 924 places and 10061 transitions and 30983 arcs in 402 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 442 places in 52 ms
Reduce places removed 442 places and 6561 transitions.
Reduce places removed 1 places and 0 transitions.
FORMULA LastZero-PT-N20-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N20-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 3500/3500 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 480 transition count 3500
Applied a total of 1 rules in 66 ms. Remains 480 /481 variables (removed 1) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:49:12] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11025922252039976986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11262272861994273377.kers'
[2026-06-16 20:49:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11025922252039976986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11262272861994273377.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 3310 rows 479 cols 9278 entries
Finished phase 1 with 460 SingleSign rule and 0 generalized
[2026-06-16 20:49:12] [INFO ] Computed 20 invariants in 13 ms
Computed 20 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-11262272861994273377.kers
Total runtime 16 ms.
[2026-06-16 20:49:12] [INFO ] Implicit Places using invariants in 647 ms returned []
[2026-06-16 20:49:12] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:49:12] [INFO ] Invariant cache hit.
[2026-06-16 20:49:13] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:49:30] [INFO ] Implicit Places using invariants and state equation in 17355 ms returned [165]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18047 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 479/481 places, 3500/3500 transitions.
Applied a total of 0 rules in 18 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18145 ms. Remains : 479/481 places, 3500/3500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 3500/3500 transitions.
Applied a total of 0 rules in 17 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:49:30] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6515757554360925622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12340487793588868271.kers'
[2026-06-16 20:49:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6515757554360925622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12340487793588868271.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3310 rows 478 cols 9258 entries
Finished phase 1 with 460 SingleSign rule and 0 generalized
[2026-06-16 20:49:30] [INFO ] Computed 19 invariants in 10 ms
Computed 19 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12340487793588868271.kers
Total runtime 17 ms.
[2026-06-16 20:49:30] [INFO ] Implicit Places using invariants in 375 ms returned []
[2026-06-16 20:49:30] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:49:30] [INFO ] Invariant cache hit.
[2026-06-16 20:49:31] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:49:53] [INFO ] Implicit Places using invariants and state equation in 22851 ms returned []
Implicit Place search using SMT with State Equation took 23229 ms to find 0 implicit places.
Running 3480 sub problems to find dead transitions.
[2026-06-16 20:49:53] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:49:53] [INFO ] Invariant cache hit.
[2026-06-16 20:49:53] [INFO ] State equation strengthened by 420 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/3789 variables, and 19 constraints, problems are : Problem set: 0 solved, 3480 unsolved in 30085 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/479 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 3480/3480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3480 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/3789 variables, and 19 constraints, problems are : Problem set: 0 solved, 3480 unsolved in 30073 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 0/479 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 0/3480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62288ms problems are : Problem set: 0 solved, 3480 unsolved
Search for dead transitions found 0 dead transitions in 62324ms
Finished structural reductions in LTL mode , in 1 iterations and 85701 ms. Remains : 479/479 places, 3500/3500 transitions.
Support contains 8 out of 479 places after structural reductions.
[2026-06-16 20:50:56] [INFO ] Flatten gal took : 203 ms
[2026-06-16 20:50:56] [INFO ] Flatten gal took : 133 ms
[2026-06-16 20:50:56] [INFO ] Input system was already deterministic with 3500 transitions.
RANDOM walk for 40000 steps (652 resets) in 1199 ms. (33 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (64 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (64 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (64 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
[2026-06-16 20:50:57] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:50:57] [INFO ] Invariant cache hit.
[2026-06-16 20:50:57] [INFO ] State equation strengthened by 420 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 173/187 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 6 (OVERLAPS) 582/769 variables, 62/80 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/769 variables, 1/81 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/769 variables, 38/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/769 variables, 0/119 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/790 variables, 11/130 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/790 variables, 10/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/790 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 456/1246 variables, 42/182 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1246 variables, 0/182 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 278/1524 variables, 75/257 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1524 variables, 2/259 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1524 variables, 41/300 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1524 variables, 0/300 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 35/1559 variables, 19/319 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1559 variables, 1/320 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1559 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1559 variables, 0/322 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1565 variables, 3/325 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1565 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 6/1571 variables, 3/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1571 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 3/1574 variables, 2/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1574 variables, 0/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1576 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1576 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1578 variables, 1/332 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1578 variables, 0/332 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/1580 variables, 1/333 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1580 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1582 variables, 1/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1582 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 1675/3257 variables, 52/386 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3257 variables, 0/386 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 519/3776 variables, 273/659 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3776 variables, 14/673 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/3776 variables, 232/905 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3776 variables, 0/905 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 13/3789 variables, 13/918 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/3789 variables, 0/918 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/3789 variables, 0/918 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3789/3789 variables, and 918 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1305 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 479/479 constraints, ReadFeed: 420/420 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 139/151 variables, 12/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 470/621 variables, 49/62 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 30/92 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 1/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/621 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/623 variables, 2/95 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/623 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 454/1077 variables, 40/135 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1077 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 253/1330 variables, 73/208 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1330 variables, 2/210 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1330 variables, 40/250 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1330 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 33/1363 variables, 18/268 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1363 variables, 1/269 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1363 variables, 2/271 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1363 variables, 0/271 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 6/1369 variables, 3/274 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1369 variables, 0/274 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 6/1375 variables, 3/277 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1375 variables, 0/277 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1380 variables, 3/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1380 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1382 variables, 1/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1382 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1384 variables, 1/282 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1384 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1386 variables, 1/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1386 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/1388 variables, 1/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1388 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1818/3206 variables, 52/336 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3206 variables, 0/336 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 569/3775 variables, 298/634 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3775 variables, 15/649 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/3775 variables, 256/905 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/3775 variables, 0/905 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 14/3789 variables, 14/919 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/3789 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/3789 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3789/3789 variables, and 919 constraints, problems are : Problem set: 2 solved, 1 unsolved in 1929 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 479/479 constraints, ReadFeed: 420/420 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3255ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 16 ms.
FORMULA LastZero-PT-N20-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
Computed a total of 479 stabilizing places and 3500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 3500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LastZero-PT-N20-LTLCardinality-04 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))'
Support contains 2 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 3500/3500 transitions.
Applied a total of 0 rules in 11 ms. Remains 479 /479 variables (removed 0) and now considering 3500/3500 (removed 0) transitions.
[2026-06-16 20:51:00] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:51:00] [INFO ] Invariant cache hit.
[2026-06-16 20:51:00] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-06-16 20:51:00] [INFO ] Flow matrix only has 3310 transitions (discarded 190 similar events)
[2026-06-16 20:51:00] [INFO ] Invariant cache hit.
[2026-06-16 20:51:01] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:51:21] [INFO ] Implicit Places using invariants and state equation in 20641 ms returned []
Implicit Place search using SMT with State Equation took 20955 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 20969 ms. Remains : 479/479 places, 3500/3500 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))'
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LastZero-PT-N20-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 632 ms.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Computed a total of 479 stabilizing places and 3500 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 479 transition count 3500
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 20 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 440 ms.
FORMULA LastZero-PT-N20-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LastZero-PT-N20-LTLCardinality-03 finished in 22767 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 479 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 479/479 places, 3500/3500 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 70 ms. Remains 478 /479 variables (removed 1) and now considering 3499/3500 (removed 1) transitions.
[2026-06-16 20:51:23] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8212992342499225386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14929233842339267654.kers'
[2026-06-16 20:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8212992342499225386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14929233842339267654.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 3309 rows 477 cols 9256 entries
Finished phase 1 with 459 SingleSign rule and 0 generalized
[2026-06-16 20:51:23] [INFO ] Computed 19 invariants in 9 ms
Computed 19 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-14929233842339267654.kers
Total runtime 12 ms.
[2026-06-16 20:51:23] [INFO ] Implicit Places using invariants in 333 ms returned []
[2026-06-16 20:51:23] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:51:23] [INFO ] Invariant cache hit.
[2026-06-16 20:51:24] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:51:42] [INFO ] Implicit Places using invariants and state equation in 18947 ms returned []
Implicit Place search using SMT with State Equation took 19288 ms to find 0 implicit places.
[2026-06-16 20:51:42] [INFO ] Redundant transitions in 264 ms returned []
Running 3479 sub problems to find dead transitions.
[2026-06-16 20:51:43] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:51:43] [INFO ] Invariant cache hit.
[2026-06-16 20:51:43] [INFO ] State equation strengthened by 420 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 477/3787 variables, and 18 constraints, problems are : Problem set: 0 solved, 3479 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/478 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 3479/3479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/477 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 3479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/3787 variables, and 18 constraints, problems are : Problem set: 0 solved, 3479 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, State Equation: 0/478 constraints, ReadFeed: 0/420 constraints, PredecessorRefiner: 0/3479 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61849ms problems are : Problem set: 0 solved, 3479 unsolved
Search for dead transitions found 0 dead transitions in 61859ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81504 ms. Remains : 478/479 places, 3499/3500 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 42 ms :[(NOT p0)]
Running random walk in product with property : LastZero-PT-N20-LTLCardinality-06
Product exploration explored 100000 steps with 1666 reset in 556 ms.
Product exploration explored 100000 steps with 1666 reset in 485 ms.
Computed a total of 478 stabilizing places and 3499 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 478 transition count 3499
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 80 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2026-06-16 20:52:46] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:52:46] [INFO ] Invariant cache hit.
[2026-06-16 20:52:48] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2026-06-16 20:52:50] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2026-06-16 20:52:50] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 20:52:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 25 ms returned sat
[2026-06-16 20:52:53] [INFO ] [Nat]Absence check using state equation in 1544 ms returned sat
[2026-06-16 20:52:53] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:52:53] [INFO ] [Nat]Added 420 Read/Feed constraints in 349 ms returned sat
[2026-06-16 20:52:54] [INFO ] Computed and/alt/rep : 461/2001/460 causal constraints (skipped 2829 transitions) in 217 ms.
[2026-06-16 20:52:54] [INFO ] Added : 24 causal constraints over 5 iterations in 1118 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 9014 ms.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 3499/3499 transitions.
Applied a total of 0 rules in 49 ms. Remains 478 /478 variables (removed 0) and now considering 3499/3499 (removed 0) transitions.
[2026-06-16 20:52:55] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:52:55] [INFO ] Invariant cache hit.
[2026-06-16 20:52:55] [INFO ] Implicit Places using invariants in 344 ms returned []
[2026-06-16 20:52:55] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:52:55] [INFO ] Invariant cache hit.
[2026-06-16 20:52:56] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:53:14] [INFO ] Implicit Places using invariants and state equation in 19415 ms returned []
Implicit Place search using SMT with State Equation took 19766 ms to find 0 implicit places.
[2026-06-16 20:53:15] [INFO ] Redundant transitions in 234 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20059 ms. Remains : 478/478 places, 3499/3499 transitions.
Computed a total of 478 stabilizing places and 3499 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 478 transition count 3499
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 114 steps (0 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2026-06-16 20:53:15] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:53:15] [INFO ] Invariant cache hit.
[2026-06-16 20:53:17] [INFO ] [Real]Absence check using 19 positive place invariants in 18 ms returned sat
[2026-06-16 20:53:19] [INFO ] [Real]Absence check using state equation in 2083 ms returned sat
[2026-06-16 20:53:19] [INFO ] Solution in real domain found non-integer solution.
[2026-06-16 20:53:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2026-06-16 20:53:22] [INFO ] [Nat]Absence check using state equation in 1460 ms returned sat
[2026-06-16 20:53:22] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:53:22] [INFO ] [Nat]Added 420 Read/Feed constraints in 333 ms returned sat
[2026-06-16 20:53:23] [INFO ] Computed and/alt/rep : 461/2001/460 causal constraints (skipped 2829 transitions) in 212 ms.
[2026-06-16 20:53:23] [INFO ] Added : 24 causal constraints over 5 iterations in 969 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 8773 ms.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1666 reset in 452 ms.
Product exploration explored 100000 steps with 1666 reset in 425 ms.
Built C files in :
/tmp/ltsmin13213999077984865390
[2026-06-16 20:53:24] [INFO ] Too many transitions (3499) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:53:24] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13213999077984865390
Running compilation step : cd /tmp/ltsmin13213999077984865390;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13213999077984865390;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13213999077984865390;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 478 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 478/478 places, 3499/3499 transitions.
Applied a total of 0 rules in 36 ms. Remains 478 /478 variables (removed 0) and now considering 3499/3499 (removed 0) transitions.
[2026-06-16 20:53:28] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:53:28] [INFO ] Invariant cache hit.
[2026-06-16 20:53:28] [INFO ] Implicit Places using invariants in 459 ms returned []
[2026-06-16 20:53:28] [INFO ] Flow matrix only has 3309 transitions (discarded 190 similar events)
[2026-06-16 20:53:28] [INFO ] Invariant cache hit.
[2026-06-16 20:53:28] [INFO ] State equation strengthened by 420 read => feed constraints.
[2026-06-16 20:53:48] [INFO ] Implicit Places using invariants and state equation in 19623 ms returned []
Implicit Place search using SMT with State Equation took 20088 ms to find 0 implicit places.
[2026-06-16 20:53:48] [INFO ] Redundant transitions in 148 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20281 ms. Remains : 478/478 places, 3499/3499 transitions.
Built C files in :
/tmp/ltsmin1336449050586333626
[2026-06-16 20:53:48] [INFO ] Too many transitions (3499) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:53:48] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1336449050586333626
Running compilation step : cd /tmp/ltsmin1336449050586333626;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1336449050586333626;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1336449050586333626;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-06-16 20:53:51] [INFO ] Flatten gal took : 80 ms
[2026-06-16 20:53:51] [INFO ] Flatten gal took : 80 ms
[2026-06-16 20:53:51] [INFO ] Time to serialize gal into /tmp/LTL15904538250694413601.gal : 29 ms
[2026-06-16 20:53:51] [INFO ] Time to serialize properties into /tmp/LTL13969600821859748709.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15904538250694413601.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14551472711769740192.hoa' '-atoms' '/tmp/LTL13969600821859748709.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13969600821859748709.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14551472711769740192.hoa
Detected timeout of ITS tools.
[2026-06-16 20:54:06] [INFO ] Flatten gal took : 72 ms
[2026-06-16 20:54:06] [INFO ] Flatten gal took : 73 ms
[2026-06-16 20:54:06] [INFO ] Time to serialize gal into /tmp/LTL6253555149389365932.gal : 19 ms
[2026-06-16 20:54:06] [INFO ] Time to serialize properties into /tmp/LTL10382068024558581434.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6253555149389365932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10382068024558581434.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(array_10_1<=tmp_12_4)"))))
Formula 0 simplified : GF!"(array_10_1<=tmp_12_4)"
Detected timeout of ITS tools.
[2026-06-16 20:54:22] [INFO ] Flatten gal took : 62 ms
[2026-06-16 20:54:22] [INFO ] Applying decomposition
[2026-06-16 20:54:22] [INFO ] Flatten gal took : 64 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9654333656492858584.txt' '-o' '/tmp/graph9654333656492858584.bin' '-w' '/tmp/graph9654333656492858584.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9654333656492858584.bin' '-l' '-1' '-v' '-w' '/tmp/graph9654333656492858584.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:54:22] [INFO ] Decomposing Gal with order
[2026-06-16 20:54:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:54:22] [INFO ] Removed a total of 5860 redundant transitions.
[2026-06-16 20:54:22] [INFO ] Flatten gal took : 293 ms
[2026-06-16 20:54:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 55 ms.
[2026-06-16 20:54:23] [INFO ] Time to serialize gal into /tmp/LTL10700896685899091735.gal : 15 ms
[2026-06-16 20:54:23] [INFO ] Time to serialize properties into /tmp/LTL1855470299286170960.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10700896685899091735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1855470299286170960.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu0.array_10_1<=gu0.tmp_12_4)"))))
Formula 0 simplified : GF!"(gu0.array_10_1<=gu0.tmp_12_4)"
Detected timeout of ITS tools.
Treatment of property LastZero-PT-N20-LTLCardinality-06 finished in 194865 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)))'
Spot run failed in 80 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-06-16 20:54:38] [INFO ] Flatten gal took : 123 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin654851013550474280
[2026-06-16 20:54:38] [INFO ] Too many transitions (3500) to apply POR reductions. Disabling POR matrices.
[2026-06-16 20:54:38] [INFO ] Applying decomposition
[2026-06-16 20:54:38] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin654851013550474280
Running compilation step : cd /tmp/ltsmin654851013550474280;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-06-16 20:54:38] [INFO ] Flatten gal took : 116 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13791194666479198966.txt' '-o' '/tmp/graph13791194666479198966.bin' '-w' '/tmp/graph13791194666479198966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13791194666479198966.bin' '-l' '-1' '-v' '-w' '/tmp/graph13791194666479198966.weights' '-q' '0' '-e' '0.001'
[2026-06-16 20:54:38] [INFO ] Decomposing Gal with order
[2026-06-16 20:54:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-06-16 20:54:39] [INFO ] Removed a total of 5829 redundant transitions.
[2026-06-16 20:54:39] [INFO ] Flatten gal took : 186 ms
[2026-06-16 20:54:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 81 ms.
[2026-06-16 20:54:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality16192456139081850795.gal : 12 ms
[2026-06-16 20:54:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality7617224816196020579.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16192456139081850795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7617224816196020579.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu132.array_10_1<=gu132.tmp_12_4)"))))
Formula 0 simplified : GF!"(gu132.array_10_1<=gu132.tmp_12_4)"
Compilation finished in 8138 ms.
Running link step : cd /tmp/ltsmin654851013550474280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin654851013550474280;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi0.gu18.t909, gi0.gu25.t1090, gi0.t1103, gi0.t1102, gi0.t1101, gi0.t1100, gi0.t1099, gi0.t10...3105
Computing Next relation with stutter on 524288 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
9213 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,92.2846,2223340,1,0,1822,6.97728e+06,20,911,10702,5.71666e+06,379
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA LastZero-PT-N20-LTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 422551 ms.

BK_STOP 1781643374339

--------------------
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="LastZero-PT-N20"
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 LastZero-PT-N20, 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 r354-tall-178024402800131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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