fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2893.203 429817.00 467829.00 997.40 TFTTTTFFTTTFFTTF 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-171683810600025.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-d0m36, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683810600025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 12K Apr 12 19:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 19:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 19:34 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 57K 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-d0m36-CTLCardinality-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716877194319

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m36
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 06:19:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 06:19:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:19:57] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-05-28 06:19:57] [INFO ] Transformed 262 places.
[2024-05-28 06:19:57] [INFO ] Transformed 73 transitions.
[2024-05-28 06:19:57] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 63 transition count 66
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 63 transition count 66
Applied a total of 16 rules in 37 ms. Remains 63 /72 variables (removed 9) and now considering 66/73 (removed 7) transitions.
// Phase 1: matrix 66 rows 63 cols
[2024-05-28 06:19:57] [INFO ] Computed 5 invariants in 18 ms
[2024-05-28 06:19:57] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-28 06:19:57] [INFO ] Invariant cache hit.
[2024-05-28 06:19:57] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-28 06:19:57] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-28 06:19:57] [INFO ] Invariant cache hit.
[2024-05-28 06:19:57] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-28 06:19:59] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 15 ms to minimize.
[2024-05-28 06:19:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 97 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (OVERLAPS) 1/63 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 66/129 variables, 63/70 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 27/97 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 65/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 162 constraints, problems are : Problem set: 0 solved, 65 unsolved in 3282 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
After SMT, in 6572ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 6595ms
Starting structural reductions in LTL mode, iteration 1 : 63/72 places, 66/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7408 ms. Remains : 63/72 places, 66/73 transitions.
Support contains 18 out of 63 places after structural reductions.
[2024-05-28 06:20:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 06:20:04] [INFO ] Flatten gal took : 42 ms
[2024-05-28 06:20:04] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:20:04] [INFO ] Flatten gal took : 19 ms
[2024-05-28 06:20:04] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 12 out of 63 places (down from 18) after GAL structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8896 resets) in 1912 ms. (20 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40001 steps (4116 resets) in 892 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (3641 resets) in 650 ms. (61 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4202 resets) in 119 ms. (333 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (4159 resets) in 117 ms. (338 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (8000 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4153 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (4088 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (4182 resets) in 296 ms. (134 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (4078 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
[2024-05-28 06:20:06] [INFO ] Invariant cache hit.
[2024-05-28 06:20:06] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 32/42 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/53 variables, 3/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 59/112 variables, 53/58 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 20/78 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/78 constraints. Problems are: Problem set: 7 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 8 (OVERLAPS) 17/129 variables, 10/88 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 7/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/129 variables, 0/95 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 95 constraints, problems are : Problem set: 8 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/38 variables, 1/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/52 variables, 3/5 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-28 06:20:06] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-28 06:20:07] [INFO ] Deduced a trap composed of 11 places in 369 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 59/111 variables, 52/59 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 20/79 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/79 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/129 variables, 11/90 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 7/97 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/129 variables, 0/98 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 98 constraints, problems are : Problem set: 8 solved, 1 unsolved in 584 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 783ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 66/66 transitions.
Graph (complete) has 174 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 62 transition count 64
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 60 transition count 62
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 58 transition count 59
Applied a total of 12 rules in 58 ms. Remains 58 /63 variables (removed 5) and now considering 59/66 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 58/63 places, 59/66 transitions.
RANDOM walk for 40000 steps (8925 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (4167 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 318 steps, run visited all 1 properties in 13 ms. (steps per millisecond=24 )
Probabilistic random walk after 318 steps, saw 176 distinct states, run finished after 19 ms. (steps per millisecond=16 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 5 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 06:20:07] [INFO ] Flatten gal took : 12 ms
[2024-05-28 06:20:07] [INFO ] Flatten gal took : 10 ms
[2024-05-28 06:20:07] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 7 stabilizing places and 10 stable transitions
Graph (complete) has 196 edges and 63 vertex of which 62 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 13 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-28 06:20:07] [INFO ] Computed 5 invariants in 7 ms
[2024-05-28 06:20:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-28 06:20:07] [INFO ] Invariant cache hit.
[2024-05-28 06:20:07] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:20:07] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:20:07] [INFO ] Invariant cache hit.
[2024-05-28 06:20:07] [INFO ] State equation strengthened by 25 read => feed constraints.
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:20:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-05-28 06:20:08] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1896 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: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2539 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: 2/2 constraints]
After SMT, in 4533ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4535ms
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4792 ms. Remains : 59/63 places, 61/66 transitions.
[2024-05-28 06:20:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:20:12] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:20:12] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:20:12] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:20:12] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:20:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality17655730038140275182.gal : 4 ms
[2024-05-28 06:20:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10199348836556182597.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17655730038140275182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10199348836556182597.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.50158e+09,12.0518,209336,2,15896,5,996536,6,0,297,626233,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,12.0558,209592,1,0,6,996536,7,1,399,626233,1
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 14 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
[2024-05-28 06:20:24] [INFO ] Invariant cache hit.
[2024-05-28 06:20:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 06:20:24] [INFO ] Invariant cache hit.
[2024-05-28 06:20:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:20:24] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:20:24] [INFO ] Invariant cache hit.
[2024-05-28 06:20:24] [INFO ] State equation strengthened by 25 read => feed constraints.
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:20:25] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:20:25] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2338 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: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2718 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: 2/2 constraints]
After SMT, in 5118ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 5120ms
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5424 ms. Remains : 59/63 places, 61/66 transitions.
[2024-05-28 06:20:30] [INFO ] Flatten gal took : 8 ms
[2024-05-28 06:20:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:20:30] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:20:30] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:20:30] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:20:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality6398820925355278571.gal : 2 ms
[2024-05-28 06:20:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality12081425458150062180.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality6398820925355278571.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12081425458150062180.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.50158e+09,13.9646,209564,2,15896,5,996536,6,0,297,626233,0


Converting to forward existential form...Done !
original formula: E(EF(!(((l236>l210) * AF((l29<=0))))) U EX(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,E(TRUE U !(((l236>l210) * !(EG(!((l29<=0)))))))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
Detected timeout of ITS tools.
[2024-05-28 06:21:00] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:00] [INFO ] Applying decomposition
[2024-05-28 06:21:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1749971136319655391.txt' '-o' '/tmp/graph1749971136319655391.bin' '-w' '/tmp/graph1749971136319655391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1749971136319655391.bin' '-l' '-1' '-v' '-w' '/tmp/graph1749971136319655391.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:21:00] [INFO ] Decomposing Gal with order
[2024-05-28 06:21:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:21:00] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-28 06:21:00] [INFO ] Flatten gal took : 61 ms
[2024-05-28 06:21:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-28 06:21:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality17621597730707666649.gal : 4 ms
[2024-05-28 06:21:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2145467025260197897.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17621597730707666649.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2145467025260197897.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.50158e+09,17.2771,266260,2,16839,5,1.35627e+06,6,0,298,1.00369e+06,0


Converting to forward existential form...Done !
original formula: E(EF(!(((gu1.l236>gu1.l210) * AF((gu0.l29<=0))))) U EX(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,E(TRUE U !(((gu1.l236>gu1.l210) * !(EG(!((gu0.l29<=0)))))))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gu0.t40, gu0.t44, gu0.t45, gu0.t46, gu0.t47, gu0.t48, gu0.t49, gu0.t50, gu0.t52, gu0.t53, gu0...295
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 66/66 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 64
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 59 transition count 61
Applied a total of 9 rules in 11 ms. Remains 59 /63 variables (removed 4) and now considering 61/66 (removed 5) transitions.
[2024-05-28 06:21:30] [INFO ] Invariant cache hit.
[2024-05-28 06:21:30] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-28 06:21:30] [INFO ] Invariant cache hit.
[2024-05-28 06:21:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-28 06:21:30] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-28 06:21:30] [INFO ] Invariant cache hit.
[2024-05-28 06:21:30] [INFO ] State equation strengthened by 25 read => feed constraints.
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-05-28 06:21:31] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 06:21:31] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/120 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 91 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2165 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: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
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
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 1/59 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/120 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 60/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/120 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 151 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2182 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: 2/2 constraints]
After SMT, in 4434ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 4436ms
Starting structural reductions in LTL mode, iteration 1 : 59/63 places, 61/66 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4771 ms. Remains : 59/63 places, 61/66 transitions.
[2024-05-28 06:21:35] [INFO ] Flatten gal took : 7 ms
[2024-05-28 06:21:35] [INFO ] Flatten gal took : 6 ms
[2024-05-28 06:21:35] [INFO ] Input system was already deterministic with 61 transitions.
[2024-05-28 06:21:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:35] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9454989475391351296.gal : 2 ms
[2024-05-28 06:21:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality4378440068050740868.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9454989475391351296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4378440068050740868.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.50158e+09,12.0962,209500,2,15896,5,996536,6,0,297,626233,0


Converting to forward existential form...Done !
original formula: EX(AG((AF((l20<=0)) * AX(FALSE))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((!(EG(!((l20<=0)))) * !(EX(!(FALSE))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t40, t44, t45, t46, t47, t48, t49, t50, t52, t53, t54, t55, t56, t58, t60, Intersection with...235
(forward)formula 0,0,16.194,209500,1,0,176,996536,150,76,2179,626233,215
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2024-05-28 06:21:51] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:51] [INFO ] Flatten gal took : 5 ms
[2024-05-28 06:21:51] [INFO ] Applying decomposition
[2024-05-28 06:21:51] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9029700067733660239.txt' '-o' '/tmp/graph9029700067733660239.bin' '-w' '/tmp/graph9029700067733660239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9029700067733660239.bin' '-l' '-1' '-v' '-w' '/tmp/graph9029700067733660239.weights' '-q' '0' '-e' '0.001'
[2024-05-28 06:21:51] [INFO ] Decomposing Gal with order
[2024-05-28 06:21:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 06:21:51] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-28 06:21:51] [INFO ] Flatten gal took : 9 ms
[2024-05-28 06:21:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-28 06:21:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality4952153518146776724.gal : 11 ms
[2024-05-28 06:21:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality8430506949716901969.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4952153518146776724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8430506949716901969.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71173e+09,7.05177,141644,2,16139,5,708512,6,0,319,654246,0


Converting to forward existential form...Done !
original formula: E(EF(!(((gu1.l236>gu1.l210) * AF((gu0.l29<=0))))) U EX(EX(TRUE)))
=> equivalent forward existential formula: [(EY(EY(FwdU(Init,E(TRUE U !(((gu1.l236>gu1.l210) * !(EG(!((gu0.l29<=0)))))))))) * TRUE)] != FALSE
Reverse transition relation is NOT exact ! Due to transitions gu0.t43, gu0.t47, gu0.t48, gu0.t49, gu0.t50, gu0.t51, gu0.t52, gu0.t53, gu0.t54, gu0.t56, gu0...313
(forward)formula 0,1,311.594,2426544,1,0,2186,1.45255e+07,12,1311,1149,1.69281e+07,441
FORMULA SieveSingleMsgMbox-PT-d0m36-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

Total runtime 427498 ms.

BK_STOP 1716877624136

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-d0m36"
export BK_EXAMINATION="CTLCardinality"
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-d0m36, examination is CTLCardinality"
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-171683810600025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m36.tgz
mv SieveSingleMsgMbox-PT-d0m36 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;