Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 1.1M 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-d2m04-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749176117063

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-d2m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-06 02:15:18] [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-06 02:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 02:15:18] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-06-06 02:15:18] [INFO ] Transformed 2398 places.
[2025-06-06 02:15:18] [INFO ] Transformed 1954 transitions.
[2025-06-06 02:15:18] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1984 places in 29 ms
Reduce places removed 1984 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 828 transitions.
Iterating post reduction 0 with 853 rules applied. Total rules applied 853 place count 389 transition count 1126
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 971 place count 271 transition count 375
Iterating global reduction 1 with 118 rules applied. Total rules applied 1089 place count 271 transition count 375
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1098 place count 271 transition count 366
Discarding 91 places :
Symmetric choice reduction at 2 with 91 rule applications. Total rules 1189 place count 180 transition count 275
Iterating global reduction 2 with 91 rules applied. Total rules applied 1280 place count 180 transition count 275
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 2 with 35 rules applied. Total rules applied 1315 place count 180 transition count 240
Discarding 36 places :
Symmetric choice reduction at 3 with 36 rule applications. Total rules 1351 place count 144 transition count 192
Iterating global reduction 3 with 36 rules applied. Total rules applied 1387 place count 144 transition count 192
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1408 place count 144 transition count 171
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1416 place count 136 transition count 158
Iterating global reduction 4 with 8 rules applied. Total rules applied 1424 place count 136 transition count 158
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1432 place count 128 transition count 150
Iterating global reduction 4 with 8 rules applied. Total rules applied 1440 place count 128 transition count 150
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1444 place count 124 transition count 145
Iterating global reduction 4 with 4 rules applied. Total rules applied 1448 place count 124 transition count 145
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1452 place count 120 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1456 place count 120 transition count 141
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1459 place count 117 transition count 138
Iterating global reduction 4 with 3 rules applied. Total rules applied 1462 place count 117 transition count 138
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1463 place count 116 transition count 135
Iterating global reduction 4 with 1 rules applied. Total rules applied 1464 place count 116 transition count 135
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1465 place count 115 transition count 134
Iterating global reduction 4 with 1 rules applied. Total rules applied 1466 place count 115 transition count 134
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1467 place count 114 transition count 133
Iterating global reduction 4 with 1 rules applied. Total rules applied 1468 place count 114 transition count 133
Applied a total of 1468 rules in 95 ms. Remains 114 /414 variables (removed 300) and now considering 133/1954 (removed 1821) transitions.
// Phase 1: matrix 133 rows 114 cols
[2025-06-06 02:15:18] [INFO ] Computed 5 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:15:19] [INFO ] Implicit Places using invariants in 547 ms returned []
[2025-06-06 02:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:15:19] [INFO ] State equation strengthened by 53 read => feed constraints.
[2025-06-06 02:15:19] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2025-06-06 02:15:19] [INFO ] Invariant cache hit.
[2025-06-06 02:15:19] [INFO ] State equation strengthened by 53 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:21] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:22] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 132 unsolved
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
At refinement iteration 6 (OVERLAPS) 133/247 variables, 114/127 constraints. Problems are: Problem set: 12 solved, 120 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 53/180 constraints. Problems are: Problem set: 12 solved, 120 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/180 constraints. Problems are: Problem set: 12 solved, 120 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:28] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 4 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/247 variables, 1/181 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 0/181 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 11 (OVERLAPS) 0/247 variables, 0/181 constraints. Problems are: Problem set: 14 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 247/247 variables, and 181 constraints, problems are : Problem set: 14 solved, 118 unsolved in 18905 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 118 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 3/4 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 3 (OVERLAPS) 5/100 variables, 1/5 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 2/7 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 1/8 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/8 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 9/109 variables, 1/9 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 5/14 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/14 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 132/241 variables, 109/123 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/241 variables, 52/175 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 12/187 constraints. Problems are: Problem set: 14 solved, 118 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:41] [INFO ] Deduced a trap along path composed of 5 places in 41 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:15:42] [INFO ] Deduced a trap along path composed of 10 places in 25 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 2/189 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/189 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 15 (OVERLAPS) 6/247 variables, 5/194 constraints. Problems are: Problem set: 14 solved, 118 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 1/195 constraints. Problems are: Problem set: 14 solved, 118 unsolved
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 106/301 constraints. Problems are: Problem set: 19 solved, 113 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/247 variables, and 301 constraints, problems are : Problem set: 19 solved, 113 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 114/114 constraints, ReadFeed: 53/53 constraints, PredecessorRefiner: 118/132 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 49103ms problems are : Problem set: 19 solved, 113 unsolved
Search for dead transitions found 19 dead transitions in 49112ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 114/414 places, 114/1954 transitions.
Reduce places removed 28 places and 22 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 86 transition count 87
Reduce places removed 15 places and 16 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 48 place count 71 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 70 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 70 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 50 rules in 3 ms. Remains 70 /114 variables (removed 44) and now considering 70/114 (removed 44) transitions.
// Phase 1: matrix 70 rows 70 cols
[2025-06-06 02:16:09] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:09] [INFO ] Implicit Places using invariants in 69 ms returned []
[2025-06-06 02:16:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:09] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-06 02:16:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 70/414 places, 70/1954 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50427 ms. Remains : 70/414 places, 70/1954 transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Support contains 4 out of 67 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-06 02:16:09] [INFO ] Flatten gal took : 25 ms
[2025-06-06 02:16:09] [INFO ] Flatten gal took : 9 ms
[2025-06-06 02:16:09] [INFO ] Input system was already deterministic with 70 transitions.
RANDOM walk for 40000 steps (8981 resets) in 1479 ms. (27 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 251 ms. (158 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (4141 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (4136 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
Probably explored full state space saw : 1158 states, properties seen :1
Probabilistic random walk after 2881 steps, saw 1158 distinct states, run finished after 40 ms. (steps per millisecond=72 ) properties seen :1
Explored full state space saw : 1158 states, properties seen :0
Exhaustive walk after 2881 steps, saw 1158 distinct states, run finished after 15 ms. (steps per millisecond=192 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 67 stabilizing places and 70 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 70
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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' '!(F(G(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 70/70 transitions.
Graph (complete) has 198 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 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 66 transition count 69
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 64 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 64 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 64 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 63 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 63 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 62 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 62 transition count 63
Applied a total of 12 rules in 15 ms. Remains 62 /67 variables (removed 5) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 62 cols
[2025-06-06 02:16:10] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:10] [INFO ] Implicit Places using invariants in 52 ms returned []
[2025-06-06 02:16:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:10] [INFO ] State equation strengthened by 24 read => feed constraints.
[2025-06-06 02:16:10] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:16:10] [INFO ] Redundant transitions in 1 ms returned []
Running 62 sub problems to find dead transitions.
[2025-06-06 02:16:10] [INFO ] Invariant cache hit.
[2025-06-06 02:16:10] [INFO ] State equation strengthened by 24 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, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:10] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-06 02:16:10] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 5 (OVERLAPS) 63/125 variables, 62/67 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 24/91 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/91 constraints. Problems are: Problem set: 3 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 91 constraints, problems are : Problem set: 3 solved, 59 unsolved in 2476 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 59 unsolved
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: 3 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 2/4 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 62/121 variables, 59/64 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 23/87 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 6/93 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/93 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 4/125 variables, 3/96 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 1/97 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 53/150 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/125 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 59 unsolved
At refinement iteration 14 (OVERLAPS) 0/125 variables, 0/150 constraints. Problems are: Problem set: 3 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 150 constraints, problems are : Problem set: 3 solved, 59 unsolved in 6885 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 59/62 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9386ms problems are : Problem set: 3 solved, 59 unsolved
Search for dead transitions found 3 dead transitions in 9387ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/67 places, 60/70 transitions.
Graph (complete) has 174 edges and 62 vertex of which 59 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 2 transitions.
Reduce places removed 4 places and 2 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 54 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 9 place count 52 transition count 52
Reduce places removed 2 places and 2 transitions.
Graph (complete) has 141 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 48 transition count 50
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 48 transition count 49
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 14 place count 47 transition count 48
Iterating global reduction 4 with 1 rules applied. Total rules applied 15 place count 47 transition count 48
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 16 place count 46 transition count 47
Iterating global reduction 4 with 1 rules applied. Total rules applied 17 place count 46 transition count 47
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 45 transition count 46
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 45 transition count 46
Applied a total of 19 rules in 10 ms. Remains 45 /62 variables (removed 17) and now considering 46/60 (removed 14) transitions.
// Phase 1: matrix 46 rows 45 cols
[2025-06-06 02:16:19] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:19] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 02:16:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:19] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-06 02:16:19] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/67 places, 46/70 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9686 ms. Remains : 45/67 places, 46/70 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d2m04-LTLCardinality-01
Product exploration explored 100000 steps with 22331 reset in 235 ms.
Product exploration explored 100000 steps with 22400 reset in 138 ms.
Computed a total of 45 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8949 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4095 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 156 steps, run visited all 1 properties in 4 ms. (steps per millisecond=39 )
Probabilistic random walk after 156 steps, saw 101 distinct states, run finished after 9 ms. (steps per millisecond=17 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2025-06-06 02:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-06 02:16:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 02:16:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-06 02:16:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 02:16:21] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-06 02:16:21] [INFO ] Invariant cache hit.
[2025-06-06 02:16:21] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/91 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 65 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1441 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/91 variables, 45/46 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 19/65 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 45/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 110 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2197 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3649ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 3652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3790 ms. Remains : 45/45 places, 46/46 transitions.
Computed a total of 45 stabilizing places and 46 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 46
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (9068 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4097 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 156 steps, run visited all 1 properties in 5 ms. (steps per millisecond=31 )
Probabilistic random walk after 156 steps, saw 101 distinct states, run finished after 5 ms. (steps per millisecond=31 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22485 reset in 88 ms.
Product exploration explored 100000 steps with 22428 reset in 90 ms.
Built C files in :
/tmp/ltsmin9158050592945257586
[2025-06-06 02:16:25] [INFO ] Computing symmetric may disable matrix : 46 transitions.
[2025-06-06 02:16:25] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:16:25] [INFO ] Computing symmetric may enable matrix : 46 transitions.
[2025-06-06 02:16:25] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:16:25] [INFO ] Computing Do-Not-Accords matrix : 46 transitions.
[2025-06-06 02:16:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 02:16:25] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9158050592945257586
Running compilation step : cd /tmp/ltsmin9158050592945257586;'/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 254 ms.
Running link step : cd /tmp/ltsmin9158050592945257586;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9158050592945257586;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4714422770178659867.hoa' '--buchi-type=spotba'
LTSmin run took 117 ms.
FORMULA SieveSingleMsgMbox-PT-d2m04-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d2m04-LTLCardinality-01 finished in 15561 ms.
All properties solved by simple procedures.
Total runtime 67391 ms.

BK_STOP 1749176186148

--------------------
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-d2m04"
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-d2m04, 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-174901994400451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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