fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r378-smll-171683810700067
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
428.836 40892.00 70384.00 427.20 TFTTTFTTTFTFTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r378-smll-171683810700067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m18, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810700067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 19:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 46K Apr 12 19:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716897101495

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-d1m18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-28 11:51:44] [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]
[2024-05-28 11:51:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:51:44] [INFO ] Load time of PNML (sax parser for PT used): 318 ms
[2024-05-28 11:51:44] [INFO ] Transformed 1295 places.
[2024-05-28 11:51:44] [INFO ] Transformed 749 transitions.
[2024-05-28 11:51:44] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 559 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1036 places in 23 ms
Reduce places removed 1036 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 318 place count 181 transition count 232
Iterating global reduction 1 with 61 rules applied. Total rules applied 379 place count 181 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 385 place count 181 transition count 226
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 429 place count 137 transition count 182
Iterating global reduction 2 with 44 rules applied. Total rules applied 473 place count 137 transition count 182
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 488 place count 137 transition count 167
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 514 place count 111 transition count 139
Iterating global reduction 3 with 26 rules applied. Total rules applied 540 place count 111 transition count 139
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 555 place count 111 transition count 124
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 562 place count 104 transition count 114
Iterating global reduction 4 with 7 rules applied. Total rules applied 569 place count 104 transition count 114
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 576 place count 97 transition count 107
Iterating global reduction 4 with 7 rules applied. Total rules applied 583 place count 97 transition count 107
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 587 place count 93 transition count 102
Iterating global reduction 4 with 4 rules applied. Total rules applied 591 place count 93 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 592 place count 93 transition count 101
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 596 place count 89 transition count 97
Iterating global reduction 5 with 4 rules applied. Total rules applied 600 place count 89 transition count 97
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 603 place count 86 transition count 94
Iterating global reduction 5 with 3 rules applied. Total rules applied 606 place count 86 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 607 place count 85 transition count 92
Iterating global reduction 5 with 1 rules applied. Total rules applied 608 place count 85 transition count 92
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 609 place count 84 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 610 place count 84 transition count 91
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 611 place count 83 transition count 90
Iterating global reduction 5 with 1 rules applied. Total rules applied 612 place count 83 transition count 90
Applied a total of 612 rules in 197 ms. Remains 83 /259 variables (removed 176) and now considering 90/749 (removed 659) transitions.
// Phase 1: matrix 90 rows 83 cols
[2024-05-28 11:51:45] [INFO ] Computed 5 invariants in 25 ms
[2024-05-28 11:51:45] [INFO ] Implicit Places using invariants in 501 ms returned []
[2024-05-28 11:51:45] [INFO ] Invariant cache hit.
[2024-05-28 11:51:46] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 11:51:46] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 1009 ms to find 0 implicit places.
Running 89 sub problems to find dead transitions.
[2024-05-28 11:51:46] [INFO ] Invariant cache hit.
[2024-05-28 11:51:46] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:51:48] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 27 ms to minimize.
[2024-05-28 11:51:48] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4723 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 10231ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 10258ms
Starting structural reductions in LTL mode, iteration 1 : 83/259 places, 90/749 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11506 ms. Remains : 83/259 places, 90/749 transitions.
Support contains 1 out of 83 places after structural reductions.
[2024-05-28 11:51:56] [INFO ] Flatten gal took : 62 ms
[2024-05-28 11:51:56] [INFO ] Flatten gal took : 24 ms
[2024-05-28 11:51:57] [INFO ] Input system was already deterministic with 90 transitions.
RANDOM walk for 40000 steps (8989 resets) in 1053 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (4041 resets) in 419 ms. (95 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 24 ms. (steps per millisecond=158 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 30 ms. (steps per millisecond=126 ) properties seen :1
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-28 11:51:57] [INFO ] Invariant cache hit.
[2024-05-28 11:51:57] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-28 11:51:57] [INFO ] Invariant cache hit.
[2024-05-28 11:51:57] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 11:51:57] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-28 11:51:57] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-28 11:51:57] [INFO ] Invariant cache hit.
[2024-05-28 11:51:57] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:51:59] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-28 11:51:59] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4881 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 10121ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 10124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10473 ms. Remains : 83/83 places, 90/90 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15
Product exploration explored 100000 steps with 22562 reset in 344 ms.
Product exploration explored 100000 steps with 22433 reset in 405 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8988 resets) in 280 ms. (142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4132 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 24 ms. (steps per millisecond=158 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 24 ms. (steps per millisecond=158 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 90/90 transitions.
Applied a total of 0 rules in 12 ms. Remains 83 /83 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-28 11:52:09] [INFO ] Invariant cache hit.
[2024-05-28 11:52:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-28 11:52:10] [INFO ] Invariant cache hit.
[2024-05-28 11:52:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-28 11:52:10] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-28 11:52:10] [INFO ] Redundant transitions in 3 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-28 11:52:10] [INFO ] Invariant cache hit.
[2024-05-28 11:52:10] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-28 11:52:11] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-28 11:52:11] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/173 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 126 constraints, problems are : Problem set: 0 solved, 89 unsolved in 4260 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/83 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 90/173 variables, 83/90 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 89/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 215 constraints, problems are : Problem set: 0 solved, 89 unsolved in 5181 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 83/83 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
After SMT, in 9576ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 9579ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10107 ms. Remains : 83/83 places, 90/90 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 260 edges and 83 vertex of which 82 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9043 resets) in 101 ms. (392 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (4095 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3795 steps, run visited all 1 properties in 16 ms. (steps per millisecond=237 )
Probabilistic random walk after 3795 steps, saw 1698 distinct states, run finished after 16 ms. (steps per millisecond=237 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22406 reset in 121 ms.
Product exploration explored 100000 steps with 22375 reset in 126 ms.
Built C files in :
/tmp/ltsmin5020077029193197842
[2024-05-28 11:52:20] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-28 11:52:20] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:52:20] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-28 11:52:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:52:20] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-28 11:52:20] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 11:52:20] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5020077029193197842
Running compilation step : cd /tmp/ltsmin5020077029193197842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 812 ms.
Running link step : cd /tmp/ltsmin5020077029193197842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 67 ms.
Running LTSmin : cd /tmp/ltsmin5020077029193197842;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5742995983962612906.hoa' '--buchi-type=spotba'
LTSmin run took 460 ms.
FORMULA SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d1m18-LTLCardinality-15 finished in 24765 ms.
All properties solved by simple procedures.
Total runtime 38326 ms.

BK_STOP 1716897142387

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-d1m18"
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-5568"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m18, 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 r378-smll-171683810700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m18.tgz
mv SieveSingleMsgMbox-PT-d1m18 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;