Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422100139.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 HospitalTriage-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422100139
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.3K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 78K 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 HospitalTriage-PT-none-LTLCardinality-00
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-01
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-02
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-03
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-04
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-05
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-06
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-07
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-08
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-09
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-10
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-11
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-12
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-13
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-14
FORMULA_NAME HospitalTriage-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748789001383

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HospitalTriage-PT-none
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 14:43:22] [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-01 14:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 14:43:23] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-01 14:43:23] [INFO ] Transformed 245 places.
[2025-06-01 14:43:23] [INFO ] Transformed 228 transitions.
[2025-06-01 14:43:23] [INFO ] Parsed PT model containing 245 places and 228 transitions and 680 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 80 transitions.
FORMULA HospitalTriage-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 153 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 153 transition count 140
Applied a total of 16 rules in 31 ms. Remains 153 /161 variables (removed 8) and now considering 140/148 (removed 8) transitions.
// Phase 1: matrix 140 rows 153 cols
[2025-06-01 14:43:23] [INFO ] Computed 33 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:23] [INFO ] Implicit Places using invariants in 260 ms returned [35, 43, 51, 57, 78, 111, 132, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 309 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/161 places, 140/148 transitions.
Applied a total of 0 rules in 6 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 145/161 places, 140/148 transitions.
Support contains 19 out of 145 places after structural reductions.
[2025-06-01 14:43:23] [INFO ] Flatten gal took : 34 ms
[2025-06-01 14:43:23] [INFO ] Flatten gal took : 14 ms
[2025-06-01 14:43:23] [INFO ] Input system was already deterministic with 140 transitions.
RANDOM walk for 40000 steps (8 resets) in 1284 ms. (31 steps per ms) remains 5/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
// Phase 1: matrix 140 rows 145 cols
[2025-06-01 14:43:24] [INFO ] Computed 25 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 82/285 variables, and 9 constraints, problems are : Problem set: 5 solved, 0 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 9/25 constraints, State Equation: 0/145 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HospitalTriage-PT-none-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA HospitalTriage-PT-none-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLCardinality-15 FALSE 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' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 14:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2025-06-01 14:43:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:25] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-01 14:43:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 7081 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12199ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 12202ms
Finished structural reductions in LTL mode , in 1 iterations and 12459 ms. Remains : 145/145 places, 140/140 transitions.
Stuttering acceptance computed with spot in 466 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 69 steps with 0 reset in 4 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-00 finished in 12994 ms.
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' '!(X(X(F((p0&&F(p1))))))'
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 14:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-01 14:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-01 14:43:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4703 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6842 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11569ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11569ms
Finished structural reductions in LTL mode , in 1 iterations and 11747 ms. Remains : 145/145 places, 140/140 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-05
Product exploration explored 100000 steps with 18076 reset in 304 ms.
Product exploration explored 100000 steps with 17612 reset in 254 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 p1 p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 213 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 608 steps (0 resets) in 12 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 302 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2025-06-01 14:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:51] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-01 14:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:43:51] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-01 14:43:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4678 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6966 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11661ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11662ms
Finished structural reductions in LTL mode , in 1 iterations and 11843 ms. Remains : 145/145 places, 140/140 transitions.
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 p1 p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 224 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 628 steps (0 resets) in 8 ms. (69 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 315 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 17632 reset in 174 ms.
Product exploration explored 100000 steps with 17680 reset in 187 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 145 transition count 140
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 18 Pre rules applied. Total rules applied 58 place count 145 transition count 148
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 76 place count 145 transition count 148
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 131 transition count 134
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 131 transition count 134
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 125 transition count 128
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 125 transition count 128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 125 transition count 128
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 122 rules in 40 ms. Remains 125 /145 variables (removed 20) and now considering 128/140 (removed 12) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 14:44:05] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
// Phase 1: matrix 128 rows 125 cols
[2025-06-01 14:44:05] [INFO ] Computed 23 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:05] [INFO ] Deduced a trap composed of 1 places in 38 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:05] [INFO ] Deduced a trap composed of 1 places in 25 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:05] [INFO ] Deduced a trap composed of 1 places in 34 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:05] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:05] [INFO ] Deduced a trap composed of 1 places in 30 ms of which 2 ms to minimize.
Problem TDEAD104 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 5/10 constraints. Problems are: Problem set: 12 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 12 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 10/125 variables, 18/28 constraints. Problems are: Problem set: 12 solved, 106 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 1 places in 18 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:06] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:07] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 14:44:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 17/45 constraints. Problems are: Problem set: 39 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 39 solved, 79 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
At refinement iteration 6 (OVERLAPS) 127/252 variables, 125/170 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/170 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/252 variables, 0/170 constraints. Problems are: Problem set: 72 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/253 variables, and 170 constraints, problems are : Problem set: 72 solved, 46 unsolved in 3367 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 72 solved, 46 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 5/5 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 71/122 variables, 22/27 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 16/43 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/43 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 3/125 variables, 1/44 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/45 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/45 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 127/252 variables, 125/170 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/252 variables, 46/216 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/216 constraints. Problems are: Problem set: 72 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/216 constraints. Problems are: Problem set: 72 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/253 variables, and 216 constraints, problems are : Problem set: 72 solved, 46 unsolved in 2359 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 46/118 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5749ms problems are : Problem set: 72 solved, 46 unsolved
Search for dead transitions found 72 dead transitions in 5749ms
Found 72 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 72 transitions
Dead transitions reduction (with SMT) removed 72 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 125/145 places, 56/140 transitions.
Graph (complete) has 190 edges and 125 vertex of which 61 are kept as prefixes of interest. Removing 64 places using SCC suffix rule.0 ms
Discarding 64 places :
Also discarding 0 output transitions
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 56 transition count 56
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 19 place count 56 transition count 48
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 19 place count 56 transition count 56
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 35 place count 56 transition count 56
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 35 rules in 13 ms. Remains 56 /125 variables (removed 69) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/145 places, 56/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5815 ms. Remains : 56/145 places, 56/140 transitions.
Built C files in :
/tmp/ltsmin12653873374865090348
[2025-06-01 14:44:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12653873374865090348
Running compilation step : cd /tmp/ltsmin12653873374865090348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 390 ms.
Running link step : cd /tmp/ltsmin12653873374865090348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin12653873374865090348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15475856350840743822.hoa' '--buchi-type=spotba'
LTSmin run took 524 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HospitalTriage-PT-none-LTLCardinality-05 finished in 34279 ms.
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' '!(X(G((X(p1)||p0))))'
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2025-06-01 14:44:12] [INFO ] Computed 25 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:44:12] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-01 14:44:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 14:44:12] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2025-06-01 14:44:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 170 constraints, problems are : Problem set: 0 solved, 128 unsolved in 4576 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/133 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 12/145 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 140/285 variables, 145/170 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 128/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 298 constraints, problems are : Problem set: 0 solved, 128 unsolved in 6857 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11449ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 11450ms
Finished structural reductions in LTL mode , in 1 iterations and 11630 ms. Remains : 145/145 places, 140/140 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 256 steps with 0 reset in 6 ms.
FORMULA HospitalTriage-PT-none-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLCardinality-13 finished in 11800 ms.
All properties solved by simple procedures.
Total runtime 60968 ms.

BK_STOP 1748789063881

--------------------
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="HospitalTriage-PT-none"
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 HospitalTriage-PT-none, 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 r114-tall-174876422100139"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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