fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r162-smll-177961108000542
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2528.848 64430.00 168437.00 234.10 FFTFTFFTTFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Mar 7 16:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 7 16:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 7 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 15 11:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 15 11:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Mar 7 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K Mar 7 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 7 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 16:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 11:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 14M 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 LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-13
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14
FORMULA_NAME LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779959497204

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-28 09:11:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 09:11:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 09:11:40] [INFO ] Load time of PNML (sax parser for PT used): 988 ms
[2026-05-28 09:11:40] [INFO ] Transformed 21462 places.
[2026-05-28 09:11:40] [INFO ] Transformed 21129 transitions.
[2026-05-28 09:11:40] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 1342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 46 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1198 resets) in 6650 ms. (6 steps per ms) remains 14/16 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (37 resets) in 1910 ms. (20 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (37 resets) in 1223 ms. (32 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 414 ms. (96 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (35 resets) in 328 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 429 ms. (93 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (36 resets) in 452 ms. (88 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 488 ms. (81 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 344 ms. (115 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (35 resets) in 545 ms. (73 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 605 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 474 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 654 ms. (61 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (36 resets) in 228 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (37 resets) in 342 ms. (116 steps per ms) remains 14/14 properties
[2026-05-28 09:11:45] [INFO ] Flatten gal took : 2693 ms
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12957204184517885738.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13235138832456925311.kers'
[2026-05-28 09:11:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12957204184517885738.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13235138832456925311.kers]
Culling duplicate invariants (modulo rational): removing 68 columns.
Culled 68 columns in 52 ms.
// Phase 1: matrix 21129 rows 21394 cols 59092 entries
[2026-05-28 09:11:46] [INFO ] Flatten gal took : 765 ms
[2026-05-28 09:11:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10762573993217525578.gal : 379 ms
[2026-05-28 09:11:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16847957783730526119.prop : 4 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10762573993217525578.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16847957783730526119.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Finished phase 1 with 12711 SingleSign rule and 8418 generalized
[2026-05-28 09:11:47] [INFO ] Computed 333 invariants in 1038 ms
Computed 333 P flows in 1039 ms.
Exported basis to /tmp/petrispot-output-13235138832456925311.kers
Total runtime 1064 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SMT process timed out in 6765ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 495 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 8701 are kept as prefixes of interest. Removing 12761 places using SCC suffix rule.70 ms
Discarding 12761 places :
Also discarding 4825 output transitions
Drop transitions (Output transitions of discarded places.) removed 4825 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3794 transitions
Reduce isomorphic transitions removed 3794 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3348 transitions
Trivial Post-agglo rules discarded 3348 transitions
Performed 3348 trivial Post agglomeration. Transition count delta: 3348
Iterating post reduction 0 with 7142 rules applied. Total rules applied 7143 place count 8701 transition count 9162
Reduce places removed 3350 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 1 with 3461 rules applied. Total rules applied 10604 place count 5351 transition count 9051
Reduce places removed 111 places and 0 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Iterating post reduction 2 with 309 rules applied. Total rules applied 10913 place count 5240 transition count 8853
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 3 with 198 rules applied. Total rules applied 11111 place count 5042 transition count 8853
Performed 122 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 122 Pre rules applied. Total rules applied 11111 place count 5042 transition count 8731
Deduced a syphon composed of 122 places in 5 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 11355 place count 4920 transition count 8731
Discarding 64 places :
Symmetric choice reduction at 4 with 64 rule applications. Total rules 11419 place count 4856 transition count 8667
Iterating global reduction 4 with 64 rules applied. Total rules applied 11483 place count 4856 transition count 8667
Loading property file /tmp/ReachabilityCardinality16847957783730526119.prop.
Free-agglomeration rule (complex) applied 173 times.
Iterating global reduction 4 with 173 rules applied. Total rules applied 11656 place count 4856 transition count 8494
Reduce places removed 173 places and 0 transitions.
Iterating post reduction 4 with 173 rules applied. Total rules applied 11829 place count 4683 transition count 8494
Partial Free-agglomeration rule applied 824 times.
Drop transitions (Partial Free agglomeration) removed 824 transitions
Iterating global reduction 5 with 824 rules applied. Total rules applied 12653 place count 4683 transition count 8494
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 5 with 5 rules applied. Total rules applied 12658 place count 4678 transition count 8494
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 12661 place count 4678 transition count 8491
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 12664 place count 4675 transition count 8491
Applied a total of 12664 rules in 8228 ms. Remains 4675 /21462 variables (removed 16787) and now considering 8491/21129 (removed 12638) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8247 ms. Remains : 4675/21462 places, 8491/21129 transitions.
RANDOM walk for 40000 steps (3091 resets) in 4062 ms. (9 steps per ms) remains 13/14 properties
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 306 ms. (130 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 146 ms. (272 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 169 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (43 resets) in 257 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (43 resets) in 141 ms. (281 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 211 ms. (188 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (42 resets) in 354 ms. (112 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (41 resets) in 481 ms. (82 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (41 resets) in 450 ms. (88 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (43 resets) in 408 ms. (97 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (43 resets) in 148 ms. (268 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (41 resets) in 206 ms. (193 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 25529 steps, run timeout after 6001 ms. (steps per millisecond=4 ) properties seen :0 out of 13
Probabilistic random walk after 25529 steps, saw 13179 distinct states, run finished after 6010 ms. (steps per millisecond=4 ) properties seen :0
[2026-05-28 09:12:09] [INFO ] Flow matrix only has 8160 transitions (discarded 331 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1054455201652372854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14748389123224104309.kers'
[2026-05-28 09:12:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1054455201652372854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14748389123224104309.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 6 ms.
// Phase 1: matrix 8160 rows 4674 cols 21206 entries
Finished phase 1 with 4492 SingleSign rule and 178 generalized
[2026-05-28 09:12:09] [INFO ] Computed 5 invariants in 94 ms
Computed 5 P flows in 95 ms.
Exported basis to /tmp/petrispot-output-14748389123224104309.kers
Total runtime 107 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 127/533 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/533 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1686/2219 variables, 533/536 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2219 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-04 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-07 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 7138/9357 variables, 1266/1802 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/9357 variables, 0/1802 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 63/9420 variables, 1/1803 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-08 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-11 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-13 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/9420 variables, 63/1866 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/9420 variables, 0/1866 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/9421 variables, 1/1867 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/9421 variables, 1/1868 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/9421 variables, 0/1868 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 3414/12835 variables, 2812/4680 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12835 variables, 0/4680 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/12835 variables, 0/4680 constraints. Problems are: Problem set: 10 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12835/12835 variables, and 4680 constraints, problems are : Problem set: 10 solved, 3 unsolved in 21165 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 4675/4675 constraints, PredecessorRefiner: 13/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 393/503 variables, 110/110 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 0/110 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5737/6240 variables, 435/545 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6240 variables, 0/545 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 61/6301 variables, 1/546 constraints. Problems are: Problem set: 10 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6301 variables, 0/546 constraints. Problems are: Problem set: 10 solved, 3 unsolved
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-01 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-03 is UNSAT
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 6369/12670 variables, 4029/4575 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/12670 variables, 2/4577 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/12670 variables, 0/4577 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 32/12702 variables, 2/4579 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/12702 variables, 1/4580 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/12702 variables, 0/4580 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 133/12835 variables, 100/4680 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/12835 variables, 0/4680 constraints. Problems are: Problem set: 12 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/12835 variables, 0/4680 constraints. Problems are: Problem set: 12 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12835/12835 variables, and 4680 constraints, problems are : Problem set: 12 solved, 1 unsolved in 10881 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 4675/4675 constraints, PredecessorRefiner: 2/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 32281ms problems are : Problem set: 12 solved, 1 unsolved
Finished Parikh walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA LeafsetExtension-PT-S64C4-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 24 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 62020 ms.

BK_STOP 1779959561634

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="LeafsetExtension-PT-S64C4"
export BK_EXAMINATION="ReachabilityCardinality"
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 LeafsetExtension-PT-S64C4, examination is ReachabilityCardinality"
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-177961108000542"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LeafsetExtension-PT-S64C4.tgz
mv LeafsetExtension-PT-S64C4 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;