fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r156-tall-174881253500179
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Philosophers-PT-005000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 857714.00 0.00 0.00 ?T????T????T???? normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881253500179.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Philosophers-PT-005000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881253500179
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 205M
-rw-r--r-- 1 mcc users 5.0M May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 24M May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5M May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2M May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 496K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 11M May 29 14:32 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 Philosophers-PT-005000-LTLCardinality-00
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-01
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-02
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-03
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-04
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-05
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-06
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-07
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-08
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-09
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-10
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-11
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-12
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-13
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-14
FORMULA_NAME Philosophers-PT-005000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748876136977

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-005000
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-02 14:55:38] [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]
[2025-06-02 14:55:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 14:55:38] [INFO ] Load time of PNML (sax parser for PT used): 610 ms
[2025-06-02 14:55:38] [INFO ] Transformed 25000 places.
[2025-06-02 14:55:39] [INFO ] Transformed 25000 transitions.
[2025-06-02 14:55:39] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 827 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 332 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-005000-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-005000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 160 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2025-06-02 14:55:40] [INFO ] Computed 10000 invariants in 172 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 14:55:49] [INFO ] Implicit Places using invariants in 9088 ms returned []
Implicit Place search using SMT only with invariants took 9124 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 14:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30327 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30201 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 96246ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 96349ms
Finished structural reductions in LTL mode , in 1 iterations and 105732 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Support contains 25000 out of 25000 places after structural reductions.
[2025-06-02 14:57:27] [INFO ] Flatten gal took : 1115 ms
[2025-06-02 14:57:29] [INFO ] Flatten gal took : 893 ms
[2025-06-02 14:57:32] [INFO ] Input system was already deterministic with 25000 transitions.
RANDOM walk for 21847 steps (4 resets) in 120011 ms. (0 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4004 steps (0 resets) in 3200 ms. (1 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1435 ms. (2 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1772 ms. (2 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1782 ms. (2 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1906 ms. (2 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2416 ms. (1 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2197 ms. (1 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1529 ms. (2 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 552 ms. (7 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 529 ms. (7 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 486 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 486 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 761 ms. (5 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 484 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 489 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 483 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 485 ms. (8 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 484 ms. (8 steps per ms) remains 18/18 properties
[2025-06-02 14:58:08] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 0 solved, 18 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10329ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 219 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 220 ms. Remains : 25000/25000 places, 25000/25000 transitions.
RANDOM walk for 27839 steps (8 resets) in 120012 ms. (0 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2991 ms. (1 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1305 ms. (3 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1775 ms. (2 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1799 ms. (2 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1853 ms. (2 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 2423 ms. (1 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1846 ms. (2 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 1307 ms. (3 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 489 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 478 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 480 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 705 ms. (5 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 482 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 474 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 483 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 482 ms. (8 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (0 resets) in 473 ms. (8 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 99952 steps, run timeout after 105087 ms. (steps per millisecond=0 ) properties seen :1 out of 17
Probabilistic random walk after 99952 steps, saw 99933 distinct states, run finished after 105097 ms. (steps per millisecond=0 ) properties seen :1
[2025-06-02 15:00:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 8 solved, 8 unsolved in 45277 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 8 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 8 solved, 8 unsolved in 45248 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 90720ms problems are : Problem set: 8 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 167 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Successfully simplified 8 atomic propositions for a total of 14 simplifications.
FORMULA Philosophers-PT-005000-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&G(p2))))))'
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 981 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2025-06-02 15:02:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 15:02:33] [INFO ] Implicit Places using invariants in 21523 ms returned []
Implicit Place search using SMT only with invariants took 21531 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2025-06-02 15:02:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30208 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30201 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 100955ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 101004ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123559 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-005000-LTLCardinality-00
Product exploration timeout after 5060 steps with 0 reset in 10003 ms.
Product exploration timeout after 4920 steps with 0 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (8 resets) in 95337 ms. (0 steps per ms) remains 4/7 properties
BEST_FIRST walk for 16004 steps (0 resets) in 25220 ms. (0 steps per ms) remains 4/4 properties
BEST_FIRST walk for 16004 steps (0 resets) in 25068 ms. (0 steps per ms) remains 4/4 properties
BEST_FIRST walk for 24004 steps (0 resets) in 20811 ms. (1 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16976 ms. (2 steps per ms) remains 4/4 properties
[2025-06-02 15:05:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
SMT process timed out in 5171ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 20000 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Applied a total of 0 rules in 624 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 25000/25000 places, 25000/25000 transitions.
RANDOM walk for 40000 steps (8 resets) in 88126 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 12004 steps (0 resets) in 20481 ms. (0 steps per ms) remains 3/3 properties
BEST_FIRST walk for 25004 steps (0 resets) in 20996 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (0 resets) in 16786 ms. (2 steps per ms) remains 3/3 properties
Probabilistic random walk after 193912 steps, saw 193869 distinct states, run finished after 122316 ms. (steps per millisecond=1 ) properties seen :0
[2025-06-02 15:08:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 25000/50000 variables, and 10000 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45044 ms.
Refiners :[Positive P Invariants (semi-flows): 10000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.

BK_STOP 1748876994691

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Philosophers-PT-005000"
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-5832"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-005000, 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 r156-tall-174881253500179"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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