Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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.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 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 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 SieveSingleMsgMbox-PT-d0m04-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749146921719

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 18:08:42] [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-05 18:08:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:08:42] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2025-06-05 18:08:43] [INFO ] Transformed 262 places.
[2025-06-05 18:08:43] [INFO ] Transformed 73 transitions.
[2025-06-05 18:08:43] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 61 transition count 64
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 60 transition count 63
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 59 transition count 62
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 59 transition count 61
Applied a total of 25 rules in 27 ms. Remains 59 /72 variables (removed 13) and now considering 61/73 (removed 12) transitions.
// Phase 1: matrix 61 rows 59 cols
[2025-06-05 18:08:43] [INFO ] Computed 5 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:43] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-05 18:08:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-06-05 18:08:44] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 1600 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2025-06-05 18:08:44] [INFO ] Invariant cache hit.
[2025-06-05 18:08:44] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:45] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 7 (OVERLAPS) 61/120 variables, 59/72 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 25/97 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 97 constraints, problems are : Problem set: 5 solved, 55 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 55 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/6 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 4 (OVERLAPS) 1/52 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 4/56 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 5/13 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 61/117 variables, 56/69 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/117 variables, 25/94 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/117 variables, 8/102 constraints. Problems are: Problem set: 5 solved, 55 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:49] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:49] [INFO ] Deduced a trap along path composed of 14 places in 29 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/117 variables, 2/104 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/117 variables, 0/104 constraints. Problems are: Problem set: 5 solved, 55 unsolved
At refinement iteration 14 (OVERLAPS) 3/120 variables, 3/107 constraints. Problems are: Problem set: 5 solved, 55 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/120 variables, 47/154 constraints. Problems are: Problem set: 7 solved, 53 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/120 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 53 unsolved
At refinement iteration 17 (OVERLAPS) 0/120 variables, 0/154 constraints. Problems are: Problem set: 7 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 154 constraints, problems are : Problem set: 7 solved, 53 unsolved in 6928 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 55/60 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10515ms problems are : Problem set: 7 solved, 53 unsolved
Search for dead transitions found 7 dead transitions in 10525ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 59/72 places, 54/73 transitions.
Reduce places removed 10 places and 8 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 49 transition count 46
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 14 place count 45 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 44 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 16 place count 43 transition count 40
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 16 rules in 3 ms. Remains 43 /59 variables (removed 16) and now considering 40/54 (removed 14) transitions.
// Phase 1: matrix 40 rows 43 cols
[2025-06-05 18:08:55] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:55] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-05 18:08:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:55] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:08:55] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 43/72 places, 40/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 12330 ms. Remains : 43/72 places, 40/73 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 4 out of 42 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:08:55] [INFO ] Flatten gal took : 16 ms
[2025-06-05 18:08:55] [INFO ] Flatten gal took : 7 ms
[2025-06-05 18:08:55] [INFO ] Input system was already deterministic with 40 transitions.
RANDOM walk for 40000 steps (8921 resets) in 903 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4090 resets) in 434 ms. (91 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4035 resets) in 349 ms. (114 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4158 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4626 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
Probably explored full state space saw : 621 states, properties seen :2
Probabilistic random walk after 1518 steps, saw 621 distinct states, run finished after 31 ms. (steps per millisecond=48 ) properties seen :2
Explored full state space saw : 621 states, properties seen :0
Exhaustive walk after 1518 steps, saw 621 distinct states, run finished after 9 ms. (steps per millisecond=168 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 4 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 11 stable transitions
Graph (complete) has 120 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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' '!((p0 U X(G(!p0))))'
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 40/40 transitions.
Graph (complete) has 120 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 39
Applied a total of 2 rules in 10 ms. Remains 40 /42 variables (removed 2) and now considering 39/40 (removed 1) transitions.
// Phase 1: matrix 39 rows 40 cols
[2025-06-05 18:08:56] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-05 18:08:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:08:56] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:08:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:08:56] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 18:08:56] [INFO ] Invariant cache hit.
[2025-06-05 18:08:56] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:57] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:57] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:08:57] [INFO ] Deduced a trap along path composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2520 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4038ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4039ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/42 places, 39/40 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4156 ms. Remains : 40/42 places, 39/40 transitions.
Stuttering acceptance computed with spot in 281 ms :[p0, true, p0]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07
Product exploration explored 100000 steps with 22380 reset in 295 ms.
Product exploration explored 100000 steps with 22441 reset in 145 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[true, p0]
RANDOM walk for 40000 steps (9057 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4171 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 237 steps, run visited all 1 properties in 2 ms. (steps per millisecond=118 )
Probabilistic random walk after 237 steps, saw 130 distinct states, run finished after 5 ms. (steps per millisecond=47 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLCardinality-07 finished in 5210 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)))'
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 40/40 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 40
Applied a total of 1 rules in 3 ms. Remains 41 /42 variables (removed 1) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-05 18:09:01] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 18:09:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:09:01] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2025-06-05 18:09:01] [INFO ] Invariant cache hit.
[2025-06-05 18:09:01] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/80 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:02] [INFO ] Deduced a trap along path composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/81 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 62 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 40/80 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/81 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 36/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 101 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2417 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4040ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 4040ms
Starting structural reductions in LTL mode, iteration 1 : 41/42 places, 40/40 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4163 ms. Remains : 41/42 places, 40/40 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLCardinality-08 finished in 4267 ms.
All properties solved by simple procedures.
Total runtime 23049 ms.

BK_STOP 1749146946987

--------------------
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="SieveSingleMsgMbox-PT-d0m04"
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 SieveSingleMsgMbox-PT-d0m04, 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 r212-tall-174901994200355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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