fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074100249
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPPP-PT-C0001N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
435.896 13642.00 22034.00 88.80 FFTTFFTTFTTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074100249.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 GPPP-PT-C0001N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074100249
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.4K Mar 7 11:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 7 11:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 11:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 7 11:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 10:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 10:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 7 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1 Mar 3 18:30 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000010-CTLCardinality-2024-00
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-01
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-02
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-03
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-04
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-05
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-06
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-07
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-08
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-09
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779708515896

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPPP-PT-C0001N0000000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 11:28:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 11:28:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 11:28:37] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2026-05-25 11:28:37] [INFO ] Transformed 33 places.
[2026-05-25 11:28:37] [INFO ] Transformed 22 transitions.
[2026-05-25 11:28:37] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Running 21 sub problems to find dead transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3027931913720625057.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10962060419811537353.kers'
[2026-05-25 11:28:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3027931913720625057.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10962060419811537353.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 22 rows 27 cols 71 entries
Finished phase 1 with 13 SingleSign rule and 7 generalized
[2026-05-25 11:28:37] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10962060419811537353.kers
Total runtime 1 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 0 solved, 21 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/33 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 21/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/55 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 67 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1683ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1699ms
[2026-05-25 11:28:39] [INFO ] Invariant cache hit.
[2026-05-25 11:28:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 11:28:39] [INFO ] Invariant cache hit.
[2026-05-25 11:28:39] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1832 ms. Remains : 33/33 places, 22/22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:39] [INFO ] Invariant cache hit.
[2026-05-25 11:28:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-25 11:28:39] [INFO ] Invariant cache hit.
[2026-05-25 11:28:39] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2026-05-25 11:28:39] [INFO ] Flatten gal took : 18 ms
[2026-05-25 11:28:39] [INFO ] Flatten gal took : 6 ms
[2026-05-25 11:28:39] [INFO ] Input system was already deterministic with 22 transitions.
RANDOM walk for 40000 steps (8 resets) in 1371 ms. (29 steps per ms) remains 83/110 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 83/83 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 83/83 properties
[2026-05-25 11:28:40] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp97 is UNSAT
Problem AtomicPropp100 is UNSAT
Problem AtomicPropp104 is UNSAT
Problem AtomicPropp108 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 7/7 constraints. Problems are: Problem set: 33 solved, 50 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp95 is UNSAT
Problem AtomicPropp102 is UNSAT
Problem AtomicPropp103 is UNSAT
Problem AtomicPropp105 is UNSAT
Problem AtomicPropp107 is UNSAT
Problem AtomicPropp109 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 6/13 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 75 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/46 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/55 variables, 0/46 constraints. Problems are: Problem set: 75 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/55 variables, and 46 constraints, problems are : Problem set: 75 solved, 8 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 75 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 7/15 variables, 3/4 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 75 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 75 solved, 8 unsolved
Problem AtomicPropp86 is UNSAT
At refinement iteration 6 (OVERLAPS) 15/31 variables, 6/11 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/33 variables, 2/13 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/13 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 22/55 variables, 33/46 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 7/53 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/53 constraints. Problems are: Problem set: 76 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/55 variables, 0/53 constraints. Problems are: Problem set: 76 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 55/55 variables, and 53 constraints, problems are : Problem set: 76 solved, 7 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 7/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 76 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 22879 steps, including 62 resets, run visited all 1 properties in 28 ms. (steps per millisecond=817 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 420 ms.
Successfully simplified 76 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 11:28:41] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 4 ms
[2026-05-25 11:28:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-25 11:28:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:41] [INFO ] Input system was already deterministic with 22 transitions.
Support contains 15 out of 33 places (down from 27) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:41] [INFO ] Invariant cache hit.
[2026-05-25 11:28:41] [INFO ] Implicit Places using invariants in 37 ms returned [0, 1, 2, 3]
[2026-05-25 11:28:41] [INFO ] Actually due to overlaps returned [1, 0, 3]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 30/33 places, 22/22 transitions.
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:41] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:41] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality12839198341932635518.gal : 1 ms
[2026-05-25 11:28:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality10088023083536097632.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12839198341932635518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10088023083536097632.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65535e+06,4.73045,119084,2,14195,5,530831,6,0,146,568248,0


Converting to forward existential form...Done !
original formula: EG((EF(((AX(FALSE) * (((c2>=4)&&(ADP<=15))||(a2>_3PG))) * (((GAP<=30)||(Gluc<=c1))||((b1>=33)&&(NADPH<=32))))) * EX(TRUE)))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U ((!(EX(!(FALSE))) * (((c2>=4)&&(ADP<=15))||(a2>_3PG))) * (((GAP<=30)||(Gluc<=c1))||((b1>=33...196
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,5.65994,119120,1,0,44,530831,68,26,1069,568248,53
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:47] [INFO ] Invariant cache hit.
[2026-05-25 11:28:47] [INFO ] Implicit Places using invariants in 60 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:28:47] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 29/33 places, 22/22 transitions.
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:47] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality3431749630481007376.gal : 1 ms
[2026-05-25 11:28:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality4547425523883714860.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3431749630481007376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4547425523883714860.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65535e+06,0.295333,14268,2,3252,5,55141,6,0,141,57747,0


Converting to forward existential form...Done !
original formula: AX(AG(EX(TRUE)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,1,0.476714,16304,1,0,43,55141,57,25,951,57747,49
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:47] [INFO ] Invariant cache hit.
[2026-05-25 11:28:47] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:28:47] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 29/33 places, 22/22 transitions.
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:47] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:47] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11958404531265858864.gal : 1 ms
[2026-05-25 11:28:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality5516067612532115782.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11958404531265858864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5516067612532115782.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65535e+06,0.330166,14284,2,3252,5,55141,6,0,141,57747,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.33061,14284,1,0,6,55141,7,1,181,57747,1
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:48] [INFO ] Invariant cache hit.
[2026-05-25 11:28:48] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:28:48] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 29/33 places, 22/22 transitions.
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:48] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 3 ms
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality2369593277755862779.gal : 1 ms
[2026-05-25 11:28:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10576359916353796120.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality2369593277755862779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10576359916353796120.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65535e+06,0.292379,14280,2,3252,5,55141,6,0,141,57747,0


Converting to forward existential form...Done !
original formula: (AF(AG((_1_3_BPG<=GSSG))) * AX(!(E((NADPplus>a2) U EF((NADPplus<=0))))))
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((_1_3_BPG<=GSSG))))))] = FALSE * [(FwdU(FwdU(EY(Init),(NADPplus>a2)),TRUE) * (NADPplu...171
Hit Full ! (commute/partial/dont) 18/0/4
(forward)formula 0,0,0.64568,20688,1,0,10,78251,16,1,490,85755,7
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Skipped dead transition search.
[2026-05-25 11:28:48] [INFO ] Invariant cache hit.
[2026-05-25 11:28:48] [INFO ] Implicit Places using invariants in 39 ms returned [0, 1, 2, 3, 19]
[2026-05-25 11:28:48] [INFO ] Actually due to overlaps returned [1, 19, 0, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 40 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 29/33 places, 22/22 transitions.
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 2 ms
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:48] [INFO ] Input system was already deterministic with 22 transitions.
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:48] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5239910682771689169.gal : 0 ms
[2026-05-25 11:28:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality11652677777808228311.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5239910682771689169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11652677777808228311.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65535e+06,0.313514,14284,2,3252,5,55141,6,0,141,57747,0


Converting to forward existential form...Done !
original formula: EX((A(EX(TRUE) U ((_2PG>=17)||(FBP<=Pyr))) * EF(AX(FALSE))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !((E(!(((_2PG>=17)||(FBP<=Pyr))) U (!(EX(TRUE)) * !(((_2PG>=17)||(FBP<=Pyr))))) + EG(!(((_2PG...213
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.511035,16376,1,0,43,55141,57,25,949,57747,49
FORMULA GPPP-PT-C0001N0000000010-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2026-05-25 11:28:49] [INFO ] Flatten gal took : 1 ms
[2026-05-25 11:28:49] [INFO ] Flatten gal took : 1 ms
Total runtime 12457 ms.

BK_STOP 1779708529538

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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="GPPP-PT-C0001N0000000010"
export BK_EXAMINATION="CTLCardinality"
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 GPPP-PT-C0001N0000000010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074100249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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