fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690533400897
Last Updated
July 7, 2024

About the Execution of LTSMin+red for Szymanski-PT-b12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14785.403 256775.00 330124.00 733.60 T?TT?FTFTF?TFF?T 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.r536-tall-171690533400897.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 ltsminxred
Input is Szymanski-PT-b12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533400897
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.0M
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 15:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b12-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-b12-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717284996251

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:36:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 23:36:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:36:37] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2024-06-01 23:36:37] [INFO ] Transformed 568 places.
[2024-06-01 23:36:37] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:36:37] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b12-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 132 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2024-06-01 23:36:38] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2024-06-01 23:36:38] [INFO ] Computed 1 invariants in 59 ms
[2024-06-01 23:36:38] [INFO ] Implicit Places using invariants in 654 ms returned []
[2024-06-01 23:36:38] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:36:38] [INFO ] Invariant cache hit.
[2024-06-01 23:36:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:37:08] [INFO ] Implicit Places using invariants and state equation in 30184 ms returned []
Implicit Place search using SMT with State Equation took 30865 ms to find 0 implicit places.
Running 8062 sub problems to find dead transitions.
[2024-06-01 23:37:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:37:09] [INFO ] Invariant cache hit.
[2024-06-01 23:37:09] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30153 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 8062/8062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8062 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8062 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/3039 variables, and 1 constraints, problems are : Problem set: 0 solved, 8062 unsolved in 30099 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/306 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/8062 constraints, Known Traps: 0/0 constraints]
After SMT, in 86128ms problems are : Problem set: 0 solved, 8062 unsolved
Search for dead transitions found 0 dead transitions in 86224ms
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117278 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 51 out of 306 places after structural reductions.
[2024-06-01 23:38:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 23:38:35] [INFO ] Flatten gal took : 424 ms
[2024-06-01 23:38:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-b12-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:38:36] [INFO ] Flatten gal took : 241 ms
[2024-06-01 23:38:36] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 34 out of 306 places (down from 51) after GAL structural reductions.
RANDOM walk for 40029 steps (10 resets) in 1130 ms. (35 steps per ms) remains 19/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
[2024-06-01 23:38:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:38:37] [INFO ] Invariant cache hit.
[2024-06-01 23:38:37] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 278/306 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3039 variables, 147/454 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3039 variables, 0/454 constraints. Problems are: Problem set: 15 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 15 solved, 4 unsolved in 1067 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 299/306 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 0/1 constraints. Problems are: Problem set: 15 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2733/3039 variables, 306/307 constraints. Problems are: Problem set: 15 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3039/3039 variables, and 454 constraints, problems are : Problem set: 15 solved, 4 unsolved in 3947 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 306/306 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 5063ms problems are : Problem set: 15 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 260 ms.
Support contains 7 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 306 transition count 7937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 128 place count 305 transition count 7809
Iterating global reduction 1 with 1 rules applied. Total rules applied 129 place count 305 transition count 7809
Applied a total of 129 rules in 377 ms. Remains 305 /306 variables (removed 1) and now considering 7809/8064 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 379 ms. Remains : 305/306 places, 7809/8064 transitions.
RANDOM walk for 40022 steps (8 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/3 properties
[2024-06-01 23:38:43] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2024-06-01 23:38:43] [INFO ] Computed 2 invariants in 26 ms
[2024-06-01 23:38:43] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2605/2910 variables, 305/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2910 variables, 147/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2910 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 454 constraints, problems are : Problem set: 0 solved, 2 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 283/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:38:44] [INFO ] Deduced a trap composed of 57 places in 398 ms of which 16 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:38:44] [INFO ] Deduced a trap composed of 82 places in 357 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2605/2910 variables, 305/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2910 variables, 147/456 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2910 variables, 2/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2910 variables, 0/458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:38:48] [INFO ] Deduced a trap composed of 59 places in 384 ms of which 3 ms to minimize.
[2024-06-01 23:38:49] [INFO ] Deduced a trap composed of 74 places in 328 ms of which 3 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/2910 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2910 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 460 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 6967ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 366 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7808
Applied a total of 1 rules in 211 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7809 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 305/305 places, 7808/7809 transitions.
RANDOM walk for 40023 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 177544 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 2
Probabilistic random walk after 177544 steps, saw 138938 distinct states, run finished after 3004 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 23:38:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:38:53] [INFO ] Computed 3 invariants in 22 ms
[2024-06-01 23:38:53] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 2 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:38:55] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 5 ms to minimize.
[2024-06-01 23:38:55] [INFO ] Deduced a trap composed of 101 places in 418 ms of which 2 ms to minimize.
[2024-06-01 23:38:55] [INFO ] Deduced a trap composed of 134 places in 389 ms of which 2 ms to minimize.
[2024-06-01 23:38:56] [INFO ] Deduced a trap composed of 129 places in 391 ms of which 2 ms to minimize.
[2024-06-01 23:38:56] [INFO ] Deduced a trap composed of 129 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:38:56] [INFO ] Deduced a trap composed of 138 places in 289 ms of which 2 ms to minimize.
[2024-06-01 23:38:57] [INFO ] Deduced a trap composed of 103 places in 281 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 23:38:57] [INFO ] Deduced a trap composed of 152 places in 314 ms of which 2 ms to minimize.
[2024-06-01 23:38:58] [INFO ] Deduced a trap composed of 145 places in 241 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 466 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 6980ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 735 ms.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 288 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:39:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:39:02] [INFO ] Invariant cache hit.
[2024-06-01 23:39:02] [INFO ] Implicit Places using invariants in 590 ms returned []
[2024-06-01 23:39:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:39:02] [INFO ] Invariant cache hit.
[2024-06-01 23:39:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:39:19] [INFO ] Implicit Places using invariants and state equation in 17082 ms returned []
Implicit Place search using SMT with State Equation took 17673 ms to find 0 implicit places.
[2024-06-01 23:39:20] [INFO ] Redundant transitions in 820 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:39:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:39:20] [INFO ] Invariant cache hit.
[2024-06-01 23:39:20] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7806 constraints, Known Traps: 0/0 constraints]
After SMT, in 87369ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87442ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106163 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 15 atomic propositions for a total of 9 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA Szymanski-PT-b12-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b12-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:40:48] [INFO ] Flatten gal took : 187 ms
[2024-06-01 23:40:48] [INFO ] Flatten gal took : 189 ms
[2024-06-01 23:40:48] [INFO ] Input system was already deterministic with 8064 transitions.
FORMULA Szymanski-PT-b12-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 12 stabilizing places and 2432 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 679 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 681 ms. Remains : 305/306 places, 7936/8064 transitions.
[2024-06-01 23:40:49] [INFO ] Flatten gal took : 163 ms
[2024-06-01 23:40:49] [INFO ] Flatten gal took : 180 ms
[2024-06-01 23:40:50] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 72 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 305/306 places, 7936/8064 transitions.
[2024-06-01 23:40:50] [INFO ] Flatten gal took : 160 ms
[2024-06-01 23:40:50] [INFO ] Flatten gal took : 185 ms
[2024-06-01 23:40:50] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 305/306 places, 7936/8064 transitions.
[2024-06-01 23:40:51] [INFO ] Flatten gal took : 155 ms
[2024-06-01 23:40:51] [INFO ] Flatten gal took : 175 ms
[2024-06-01 23:40:51] [INFO ] Input system was already deterministic with 7936 transitions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 53 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 305/306 places, 7936/8064 transitions.
[2024-06-01 23:40:51] [INFO ] Flatten gal took : 154 ms
[2024-06-01 23:40:52] [INFO ] Flatten gal took : 179 ms
[2024-06-01 23:40:52] [INFO ] Input system was already deterministic with 7936 transitions.
[2024-06-01 23:40:52] [INFO ] Flatten gal took : 172 ms
[2024-06-01 23:40:52] [INFO ] Flatten gal took : 180 ms
[2024-06-01 23:40:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 23:40:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 8064 transitions and 32128 arcs took 31 ms.
Total runtime 255417 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Szymanski-PT-b12-CTLCardinality-2024-01
Could not compute solution for formula : Szymanski-PT-b12-CTLCardinality-2024-04
Could not compute solution for formula : Szymanski-PT-b12-CTLCardinality-2024-10
Could not compute solution for formula : Szymanski-PT-b12-CTLCardinality-2023-14

BK_STOP 1717285253026

--------------------
content from stderr:

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Szymanski-PT-b12-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/608/ctl_0_
ctl formula name Szymanski-PT-b12-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/608/ctl_1_
ctl formula name Szymanski-PT-b12-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/608/ctl_2_
ctl formula name Szymanski-PT-b12-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/608/ctl_3_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Szymanski-PT-b12"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Szymanski-PT-b12, 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 r536-tall-171690533400897"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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