Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813400163.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 CANConstruction-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813400163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 9.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 167K 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 CANConstruction-PT-005-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748625169787

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-05-30 17:12:52] [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-05-30 17:12:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:12:52] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2025-05-30 17:12:52] [INFO ] Transformed 112 places.
[2025-05-30 17:12:52] [INFO ] Transformed 140 transitions.
[2025-05-30 17:12:52] [INFO ] Parsed PT model containing 112 places and 140 transitions and 400 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-005-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 140/140 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 104 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 104 transition count 124
Applied a total of 16 rules in 31 ms. Remains 104 /112 variables (removed 8) and now considering 124/140 (removed 16) transitions.
// Phase 1: matrix 124 rows 104 cols
[2025-05-30 17:12:53] [INFO ] Computed 11 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:53] [INFO ] Implicit Places using invariants in 333 ms returned [26, 68]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 409 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 102/112 places, 124/140 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 473 ms. Remains : 102/112 places, 124/140 transitions.
Support contains 37 out of 102 places after structural reductions.
[2025-05-30 17:12:53] [INFO ] Flatten gal took : 65 ms
[2025-05-30 17:12:53] [INFO ] Flatten gal took : 34 ms
[2025-05-30 17:12:53] [INFO ] Input system was already deterministic with 124 transitions.
Support contains 36 out of 102 places (down from 37) after GAL structural reductions.
RANDOM walk for 40000 steps (523 resets) in 1601 ms. (24 steps per ms) remains 11/31 properties
BEST_FIRST walk for 40001 steps (125 resets) in 410 ms. (97 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (118 resets) in 271 ms. (147 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (137 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (132 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (127 resets) in 228 ms. (174 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (142 resets) in 201 ms. (198 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (138 resets) in 171 ms. (232 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (128 resets) in 112 ms. (354 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (127 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (129 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (130 resets) in 122 ms. (325 steps per ms) remains 11/11 properties
// Phase 1: matrix 124 rows 102 cols
[2025-05-30 17:12:55] [INFO ] Computed 9 invariants in 13 ms
[2025-05-30 17:12:55] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 1 (OVERLAPS) 85/98 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/6 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:12:55] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:12:55] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:12:55] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 1 unsolved
Problem AtomicPropp15 is UNSAT
After SMT solving in domain Real declared 100/226 variables, and 11 constraints, problems are : Problem set: 11 solved, 0 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/3 constraints, State Equation: 0/102 constraints, ReadFeed: 0/45 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 536ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-005-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-005-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 25 stable transitions
FORMULA CANConstruction-PT-005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((p0||G(p1)||F(G(p2)))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 109
Applied a total of 16 rules in 16 ms. Remains 94 /102 variables (removed 8) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 94 cols
[2025-05-30 17:12:56] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:56] [INFO ] Implicit Places using invariants in 138 ms returned [12, 39]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/102 places, 109/124 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 107
Applied a total of 4 rules in 10 ms. Remains 90 /92 variables (removed 2) and now considering 107/109 (removed 2) transitions.
// Phase 1: matrix 107 rows 90 cols
[2025-05-30 17:12:56] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:56] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-30 17:12:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:12:56] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/102 places, 107/124 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 90/102 places, 107/124 transitions.
Stuttering acceptance computed with spot in 448 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-02
Product exploration explored 100000 steps with 5795 reset in 522 ms.
Product exploration explored 100000 steps with 6097 reset in 221 ms.
Computed a total of 18 stabilizing places and 22 stable transitions
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/90 stabilizing places and 22/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 1583 steps (21 resets) in 13 ms. (113 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 543 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 107/107 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2025-05-30 17:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:59] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-05-30 17:12:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:12:59] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:12:59] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2025-05-30 17:12:59] [INFO ] Invariant cache hit.
[2025-05-30 17:12:59] [INFO ] State equation strengthened by 45 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:00] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:01] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 13/20 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:03] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:03] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:03] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 107/196 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/197 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/197 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 164 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7265 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 107/196 variables, 89/118 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 45/163 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 102/265 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 1/197 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 266 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7709 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15025ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 15028ms
Finished structural reductions in LTL mode , in 1 iterations and 15432 ms. Remains : 90/90 places, 107/107 transitions.
Computed a total of 18 stabilizing places and 22 stable transitions
Computed a total of 18 stabilizing places and 22 stable transitions
Detected a total of 18/90 stabilizing places and 22/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 1050 steps (15 resets) in 6 ms. (150 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2 p1), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (F (NOT p2)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 360 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 6032 reset in 109 ms.
Product exploration explored 100000 steps with 5959 reset in 137 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 107/107 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 90 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 20 place count 90 transition count 107
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 90 transition count 107
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 33 place count 82 transition count 99
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 82 transition count 99
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 56 place count 82 transition count 99
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 76 place count 62 transition count 79
Deduced a syphon composed of 12 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 96 place count 62 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 101 place count 62 transition count 99
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 101 rules in 41 ms. Remains 62 /90 variables (removed 28) and now considering 99/107 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-30 17:13:17] [INFO ] Redundant transitions in 3 ms returned []
Running 94 sub problems to find dead transitions.
// Phase 1: matrix 99 rows 62 cols
[2025-05-30 17:13:17] [INFO ] Computed 7 invariants in 1 ms
[2025-05-30 17:13:17] [INFO ] State equation strengthened by 65 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:17] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:17] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:17] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:17] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 4 ms to minimize.
Problem TDEAD52 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:18] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 4 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/27 constraints. Problems are: Problem set: 3 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:19] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:13:19] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/30 constraints. Problems are: Problem set: 3 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 91 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 5 (OVERLAPS) 99/160 variables, 61/91 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 65/156 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/156 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/157 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/157 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/157 constraints. Problems are: Problem set: 22 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 157 constraints, problems are : Problem set: 22 solved, 72 unsolved in 6286 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 72 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 23/23 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 17/61 variables, 6/29 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/30 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/30 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 99/160 variables, 61/91 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 65/156 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 72/228 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/228 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 1/161 variables, 1/229 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/229 constraints. Problems are: Problem set: 22 solved, 72 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/229 constraints. Problems are: Problem set: 22 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 229 constraints, problems are : Problem set: 22 solved, 72 unsolved in 6566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 72/94 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12898ms problems are : Problem set: 22 solved, 72 unsolved
Search for dead transitions found 22 dead transitions in 12901ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/90 places, 77/107 transitions.
Graph (complete) has 226 edges and 62 vertex of which 45 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.2 ms
Discarding 17 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 45 /62 variables (removed 17) and now considering 77/77 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/90 places, 77/107 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 12982 ms. Remains : 45/90 places, 77/107 transitions.
Built C files in :
/tmp/ltsmin4518698336910874053
[2025-05-30 17:13:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4518698336910874053
Running compilation step : cd /tmp/ltsmin4518698336910874053;'/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 563 ms.
Running link step : cd /tmp/ltsmin4518698336910874053;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin4518698336910874053;'/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/stateBased17354130438893666846.hoa' '--buchi-type=spotba'
LTSmin run took 830 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CANConstruction-PT-005-LTLCardinality-02 finished in 35779 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' '!(G((G(p1)||p0)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 102 transition count 88
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 66 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 72 place count 66 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 64 transition count 86
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 82 place count 58 transition count 74
Iterating global reduction 2 with 6 rules applied. Total rules applied 88 place count 58 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 53 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 49 transition count 76
Applied a total of 106 rules in 22 ms. Remains 49 /102 variables (removed 53) and now considering 76/124 (removed 48) transitions.
// Phase 1: matrix 76 rows 49 cols
[2025-05-30 17:13:31] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:31] [INFO ] Implicit Places using invariants in 82 ms returned [6, 15, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 83 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/102 places, 76/124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 44 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 44 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 41 transition count 71
Applied a total of 10 rules in 9 ms. Remains 41 /46 variables (removed 5) and now considering 71/76 (removed 5) transitions.
// Phase 1: matrix 71 rows 41 cols
[2025-05-30 17:13:31] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2025-05-30 17:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:32] [INFO ] State equation strengthened by 60 read => feed constraints.
[2025-05-30 17:13:32] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/102 places, 71/124 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 279 ms. Remains : 41/102 places, 71/124 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 30 steps with 1 reset in 1 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-03 finished in 386 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(F(p0))||G(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 94 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 94 transition count 109
Applied a total of 16 rules in 6 ms. Remains 94 /102 variables (removed 8) and now considering 109/124 (removed 15) transitions.
// Phase 1: matrix 109 rows 94 cols
[2025-05-30 17:13:32] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:32] [INFO ] Implicit Places using invariants in 102 ms returned [12, 38, 52]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 103 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 91/102 places, 109/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 88 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 88 transition count 106
Applied a total of 6 rules in 5 ms. Remains 88 /91 variables (removed 3) and now considering 106/109 (removed 3) transitions.
// Phase 1: matrix 106 rows 88 cols
[2025-05-30 17:13:32] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:32] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-05-30 17:13:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:32] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:13:32] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 88/102 places, 106/124 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 404 ms. Remains : 88/102 places, 106/124 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 173 ms.
Computed a total of 17 stabilizing places and 21 stable transitions
Computed a total of 17 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-005-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-005-LTLCardinality-07 finished in 922 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 89
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 67 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 66 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 72 place count 66 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 65 transition count 87
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 80 place count 59 transition count 75
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 59 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 59 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 57 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 96 place count 54 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 106 place count 49 transition count 79
Applied a total of 106 rules in 23 ms. Remains 49 /102 variables (removed 53) and now considering 79/124 (removed 45) transitions.
// Phase 1: matrix 79 rows 49 cols
[2025-05-30 17:13:33] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants in 96 ms returned [5, 16, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 100 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/102 places, 79/124 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 40 transition count 73
Applied a total of 12 rules in 9 ms. Remains 40 /46 variables (removed 6) and now considering 73/79 (removed 6) transitions.
// Phase 1: matrix 73 rows 40 cols
[2025-05-30 17:13:33] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-30 17:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/102 places, 73/124 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 40/102 places, 73/124 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-08
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-08 finished in 487 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' '!((G(F(p0)) U G(p1)))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 102 transition count 90
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 68 transition count 90
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 68 place count 68 transition count 88
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 66 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 59 transition count 75
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 59 transition count 75
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 59 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 57 transition count 73
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 96 place count 54 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 106 place count 49 transition count 79
Applied a total of 106 rules in 31 ms. Remains 49 /102 variables (removed 53) and now considering 79/124 (removed 45) transitions.
// Phase 1: matrix 79 rows 49 cols
[2025-05-30 17:13:33] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants in 64 ms returned [5, 16, 22]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 66 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/102 places, 79/124 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 45 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 78
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 40 transition count 73
Applied a total of 12 rules in 9 ms. Remains 40 /46 variables (removed 6) and now considering 73/79 (removed 6) transitions.
// Phase 1: matrix 73 rows 40 cols
[2025-05-30 17:13:33] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-05-30 17:13:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:33] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-05-30 17:13:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/102 places, 73/124 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 277 ms. Remains : 40/102 places, 73/124 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-09
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-09 finished in 401 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((p0||G(p1)))))'
Support contains 3 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 124/124 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 108
Applied a total of 18 rules in 3 ms. Remains 93 /102 variables (removed 9) and now considering 108/124 (removed 16) transitions.
// Phase 1: matrix 108 rows 93 cols
[2025-05-30 17:13:34] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:34] [INFO ] Implicit Places using invariants in 71 ms returned [12, 38, 52]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 72 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/102 places, 108/124 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 87 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 87 transition count 105
Applied a total of 6 rules in 2 ms. Remains 87 /90 variables (removed 3) and now considering 105/108 (removed 3) transitions.
// Phase 1: matrix 105 rows 87 cols
[2025-05-30 17:13:34] [INFO ] Computed 6 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-05-30 17:13:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 17:13:34] [INFO ] State equation strengthened by 45 read => feed constraints.
[2025-05-30 17:13:34] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 87/102 places, 105/124 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 351 ms. Remains : 87/102 places, 105/124 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-005-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 14 steps with 0 reset in 0 ms.
FORMULA CANConstruction-PT-005-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-005-LTLCardinality-12 finished in 508 ms.
All properties solved by simple procedures.
Total runtime 42346 ms.

BK_STOP 1748625214806

--------------------
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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r030-smll-174853813400163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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