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

About the Execution of ITS-Tools for Szymanski-PT-b06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 280907.00 0.00 0.00 ??F????TT?TT?FFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690533300873.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 Szymanski-PT-b06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533300873
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 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-b06-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-b06-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717090415201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 17:33:36] [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-30 17:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:33:36] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-30 17:33:36] [INFO ] Transformed 568 places.
[2024-05-30 17:33:36] [INFO ] Transformed 8320 transitions.
[2024-05-30 17:33:36] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 213 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2024-05-30 17:33:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:33:37] [INFO ] Computed 1 invariants in 51 ms
[2024-05-30 17:33:37] [INFO ] Implicit Places using invariants in 643 ms returned []
[2024-05-30 17:33:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:33:37] [INFO ] Invariant cache hit.
[2024-05-30 17:33:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:34:06] [INFO ] Implicit Places using invariants and state equation in 28524 ms returned []
Implicit Place search using SMT with State Equation took 29210 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:34:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:34:06] [INFO ] Invariant cache hit.
[2024-05-30 17:34:06] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30169 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7934/7934 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7934 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7934 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)timeout

(s99 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/3037 variables, and 1 constraints, problems are : Problem set: 0 solved, 7934 unsolved in 30094 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 0/7934 constraints, Known Traps: 0/0 constraints]
After SMT, in 87014ms problems are : Problem set: 0 solved, 7934 unsolved
Search for dead transitions found 0 dead transitions in 87108ms
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116592 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 43 out of 305 places after structural reductions.
[2024-05-30 17:35:34] [INFO ] Flatten gal took : 577 ms
[2024-05-30 17:35:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-b06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 17:35:34] [INFO ] Flatten gal took : 291 ms
[2024-05-30 17:35:35] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 33 out of 305 places (down from 43) after GAL structural reductions.
RANDOM walk for 40009 steps (9 resets) in 1315 ms. (30 steps per ms) remains 16/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
[2024-05-30 17:35:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:35:36] [INFO ] Invariant cache hit.
[2024-05-30 17:35:36] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 286/305 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/3037 variables, 0/453 constraints. Problems are: Problem set: 10 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3037/3037 variables, and 453 constraints, problems are : Problem set: 10 solved, 4 unsolved in 2475 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 300/305 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2732/3037 variables, 305/306 constraints. Problems are: Problem set: 10 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3037 variables, 147/453 constraints. Problems are: Problem set: 10 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3037/3037 variables, and 457 constraints, problems are : Problem set: 10 solved, 4 unsolved in 4591 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 7119ms problems are : Problem set: 10 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 716 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 402 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 305/305 places, 7808/7936 transitions.
RANDOM walk for 40010 steps (8 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 156203 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 4
Probabilistic random walk after 156203 steps, saw 79205 distinct states, run finished after 3017 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-30 17:35:47] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-05-30 17:35:47] [INFO ] Computed 3 invariants in 28 ms
[2024-05-30 17:35:47] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 281/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/305 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2604/2909 variables, 305/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2909 variables, 147/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/2909 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 455 constraints, problems are : Problem set: 0 solved, 4 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 281/286 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:35:48] [INFO ] Deduced a trap composed of 75 places in 442 ms of which 27 ms to minimize.
[2024-05-30 17:35:49] [INFO ] Deduced a trap composed of 129 places in 426 ms of which 3 ms to minimize.
[2024-05-30 17:35:49] [INFO ] Deduced a trap composed of 129 places in 399 ms of which 2 ms to minimize.
[2024-05-30 17:35:50] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 2 ms to minimize.
[2024-05-30 17:35:50] [INFO ] Deduced a trap composed of 89 places in 384 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:35:51] [INFO ] Deduced a trap composed of 138 places in 346 ms of which 1 ms to minimize.
[2024-05-30 17:35:51] [INFO ] Deduced a trap composed of 58 places in 331 ms of which 2 ms to minimize.
[2024-05-30 17:35:51] [INFO ] Deduced a trap composed of 103 places in 321 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 19/305 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2604/2909 variables, 305/316 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2909 variables, 147/463 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 4/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 17:36:00] [INFO ] Deduced a trap composed of 192 places in 421 ms of which 2 ms to minimize.
[2024-05-30 17:36:00] [INFO ] Deduced a trap composed of 132 places in 337 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2909 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 469 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13091 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 14025ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 5 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 199 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 199 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 290 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-05-30 17:36:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:36:02] [INFO ] Invariant cache hit.
[2024-05-30 17:36:02] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-30 17:36:02] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:36:02] [INFO ] Invariant cache hit.
[2024-05-30 17:36:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:36:16] [INFO ] Implicit Places using invariants and state equation in 14211 ms returned []
Implicit Place search using SMT with State Equation took 14813 ms to find 0 implicit places.
[2024-05-30 17:36:17] [INFO ] Redundant transitions in 832 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-05-30 17:36:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-05-30 17:36:17] [INFO ] Invariant cache hit.
[2024-05-30 17:36:17] [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 30113 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
[2024-05-30 17:37:20] [INFO ] Deduced a trap composed of 138 places in 502 ms of which 2 ms to minimize.
[2024-05-30 17:37:21] [INFO ] Deduced a trap composed of 36 places in 368 ms of which 2 ms to minimize.
[2024-05-30 17:37:21] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 2 ms to minimize.
[2024-05-30 17:37:22] [INFO ] Deduced a trap composed of 42 places in 292 ms of which 2 ms to minimize.
[2024-05-30 17:37:22] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 1 ms to minimize.
[2024-05-30 17:37:22] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 2 ms to minimize.
[2024-05-30 17:37:23] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 2 ms to minimize.
[2024-05-30 17:37:23] [INFO ] Deduced a trap composed of 57 places in 393 ms of which 2 ms to minimize.
[2024-05-30 17:37:24] [INFO ] Deduced a trap composed of 57 places in 386 ms of which 2 ms to minimize.
[2024-05-30 17:37:24] [INFO ] Deduced a trap composed of 62 places in 411 ms of which 2 ms to minimize.
[2024-05-30 17:37:24] [INFO ] Deduced a trap composed of 70 places in 378 ms of which 2 ms to minimize.
[2024-05-30 17:37:25] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 2 ms to minimize.
[2024-05-30 17:37:25] [INFO ] Deduced a trap composed of 102 places in 389 ms of which 2 ms to minimize.
[2024-05-30 17:37:26] [INFO ] Deduced a trap composed of 72 places in 256 ms of which 2 ms to minimize.
[2024-05-30 17:37:26] [INFO ] Deduced a trap composed of 101 places in 379 ms of which 2 ms to minimize.
[2024-05-30 17:37:26] [INFO ] Deduced a trap composed of 114 places in 353 ms of which 2 ms to minimize.
[2024-05-30 17:37:27] [INFO ] Deduced a trap composed of 78 places in 292 ms of which 2 ms to minimize.
[2024-05-30 17:37:27] [INFO ] Deduced a trap composed of 134 places in 236 ms of which 1 ms to minimize.
[2024-05-30 17:37:27] [INFO ] Deduced a trap composed of 137 places in 275 ms of which 2 ms to minimize.
[2024-05-30 17:37:28] [INFO ] Deduced a trap composed of 195 places in 220 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-05-30 17:37:32] [INFO ] Deduced a trap composed of 111 places in 334 ms of which 4 ms to minimize.
[2024-05-30 17:37:35] [INFO ] Deduced a trap composed of 195 places in 428 ms of which 3 ms to minimize.
[2024-05-30 17:37:36] [INFO ] Deduced a trap composed of 204 places in 419 ms of which 2 ms to minimize.
[2024-05-30 17:37:36] [INFO ] Deduced a trap composed of 209 places in 446 ms of which 3 ms to minimize.
[2024-05-30 17:37:37] [INFO ] Deduced a trap composed of 116 places in 435 ms of which 4 ms to minimize.
[2024-05-30 17:37:37] [INFO ] Deduced a trap composed of 136 places in 411 ms of which 2 ms to minimize.
[2024-05-30 17:37:38] [INFO ] Deduced a trap composed of 139 places in 418 ms of which 2 ms to minimize.
[2024-05-30 17:37:38] [INFO ] Deduced a trap composed of 208 places in 355 ms of which 1 ms to minimize.
[2024-05-30 17:37:39] [INFO ] Deduced a trap composed of 116 places in 307 ms of which 2 ms to minimize.
[2024-05-30 17:37:40] [INFO ] Deduced a trap composed of 146 places in 312 ms of which 1 ms to minimize.
[2024-05-30 17:37:41] [INFO ] Deduced a trap composed of 209 places in 301 ms of which 2 ms to minimize.
[2024-05-30 17:37:41] [INFO ] Deduced a trap composed of 208 places in 307 ms of which 1 ms to minimize.
[2024-05-30 17:37:42] [INFO ] Deduced a trap composed of 144 places in 216 ms of which 1 ms to minimize.
[2024-05-30 17:37:43] [INFO ] Deduced a trap composed of 64 places in 309 ms of which 2 ms to minimize.
[2024-05-30 17:37:44] [INFO ] Deduced a trap composed of 77 places in 371 ms of which 2 ms to minimize.
[2024-05-30 17:37:44] [INFO ] Deduced a trap composed of 72 places in 358 ms of which 2 ms to minimize.
[2024-05-30 17:37:44] [INFO ] Deduced a trap composed of 85 places in 357 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 305/2909 variables, and 40 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30111 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: 37/37 constraints]
After SMT, in 88589ms problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104643 ms. Remains : 305/305 places, 7808/7808 transitions.
Successfully simplified 10 atomic propositions for a total of 9 simplifications.
[2024-05-30 17:37:46] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 17:37:46] [INFO ] Flatten gal took : 191 ms
FORMULA Szymanski-PT-b06-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 17:37:46] [INFO ] Flatten gal took : 222 ms
[2024-05-30 17:37:47] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 16 out of 305 places (down from 18) after GAL structural reductions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 39 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2024-05-30 17:37:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2024-05-30 17:37:47] [INFO ] Computed 1 invariants in 17 ms
[2024-05-30 17:37:47] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-30 17:37:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:37:47] [INFO ] Invariant cache hit.
[2024-05-30 17:37:48] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-05-30 17:38:04] [INFO ] Implicit Places using invariants and state equation in 16345 ms returned []
Implicit Place search using SMT with State Equation took 16853 ms to find 0 implicit places.
Running 7934 sub problems to find dead transitions.
[2024-05-30 17:38:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2024-05-30 17:38:04] [INFO ] Invariant cache hit.
[2024-05-30 17:38:04] [INFO ] State equation strengthened by 147 read => feed constraints.

BK_STOP 1717090696108

--------------------
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="Szymanski-PT-b06"
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 Szymanski-PT-b06, 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 r400-tall-171690533300873"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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