Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446800297.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBLF-PT-S04J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446800297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.5M
-rw-r--r-- 1 mcc users 22K Apr 11 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 11 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 11 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 570K Apr 11 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 11 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 205K Apr 11 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 138K Apr 11 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 670K Apr 11 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.5M 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 PolyORBLF-PT-S04J06T08-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716918544576

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-28 17:49:06] [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 17:49:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 17:49:06] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2024-05-28 17:49:06] [INFO ] Transformed 792 places.
[2024-05-28 17:49:06] [INFO ] Transformed 4268 transitions.
[2024-05-28 17:49:06] [INFO ] Parsed PT model containing 792 places and 4268 transitions and 28832 arcs in 389 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Support contains 515 out of 792 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 792/792 places, 2100/2100 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 788 transition count 2100
Applied a total of 4 rules in 62 ms. Remains 788 /792 variables (removed 4) and now considering 2100/2100 (removed 0) transitions.
Running 2096 sub problems to find dead transitions.
[2024-05-28 17:49:06] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
// Phase 1: matrix 2068 rows 788 cols
[2024-05-28 17:49:07] [INFO ] Computed 54 invariants in 131 ms
[2024-05-28 17:49:07] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
SMT process timed out in 27870ms, After SMT, problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 27927ms
[2024-05-28 17:49:34] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 17:49:34] [INFO ] Invariant cache hit.
[2024-05-28 17:49:35] [INFO ] Implicit Places using invariants in 461 ms returned []
[2024-05-28 17:49:35] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 17:49:35] [INFO ] Invariant cache hit.
[2024-05-28 17:49:36] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:49:53] [INFO ] Implicit Places using invariants and state equation in 18050 ms returned []
Implicit Place search using SMT with State Equation took 18538 ms to find 0 implicit places.
Running 2096 sub problems to find dead transitions.
[2024-05-28 17:49:53] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 17:49:53] [INFO ] Invariant cache hit.
[2024-05-28 17:49:53] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 16 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 1 ms to minimize.
[2024-05-28 17:50:22] [INFO ] Deduced a trap composed of 84 places in 103 ms of which 1 ms to minimize.
[2024-05-28 17:50:23] [INFO ] Deduced a trap composed of 84 places in 84 ms of which 0 ms to minimize.
[2024-05-28 17:50:23] [INFO ] Deduced a trap composed of 375 places in 587 ms of which 7 ms to minimize.
[2024-05-28 17:50:24] [INFO ] Deduced a trap composed of 432 places in 719 ms of which 5 ms to minimize.
[2024-05-28 17:50:25] [INFO ] Deduced a trap composed of 437 places in 675 ms of which 7 ms to minimize.
[2024-05-28 17:50:26] [INFO ] Deduced a trap composed of 146 places in 592 ms of which 4 ms to minimize.
[2024-05-28 17:50:26] [INFO ] Deduced a trap composed of 334 places in 492 ms of which 4 ms to minimize.
[2024-05-28 17:50:27] [INFO ] Deduced a trap composed of 203 places in 342 ms of which 4 ms to minimize.
[2024-05-28 17:50:28] [INFO ] Deduced a trap composed of 83 places in 349 ms of which 4 ms to minimize.
[2024-05-28 17:50:28] [INFO ] Deduced a trap composed of 434 places in 354 ms of which 3 ms to minimize.
[2024-05-28 17:50:29] [INFO ] Deduced a trap composed of 81 places in 222 ms of which 2 ms to minimize.
[2024-05-28 17:50:32] [INFO ] Deduced a trap composed of 19 places in 185 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 784/2856 variables, and 67 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2096/2096 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2096 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/784 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/784 variables, 31/50 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 2096 unsolved
[2024-05-28 17:50:52] [INFO ] Deduced a trap composed of 432 places in 501 ms of which 5 ms to minimize.
[2024-05-28 17:50:52] [INFO ] Deduced a trap composed of 400 places in 492 ms of which 3 ms to minimize.
[2024-05-28 17:50:57] [INFO ] Deduced a trap composed of 462 places in 426 ms of which 4 ms to minimize.
[2024-05-28 17:50:58] [INFO ] Deduced a trap composed of 433 places in 382 ms of which 4 ms to minimize.
[2024-05-28 17:50:58] [INFO ] Deduced a trap composed of 418 places in 380 ms of which 4 ms to minimize.
[2024-05-28 17:51:00] [INFO ] Deduced a trap composed of 442 places in 387 ms of which 4 ms to minimize.
[2024-05-28 17:51:01] [INFO ] Deduced a trap composed of 400 places in 385 ms of which 4 ms to minimize.
[2024-05-28 17:51:01] [INFO ] Deduced a trap composed of 390 places in 385 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/2856 variables, and 75 constraints, problems are : Problem set: 0 solved, 2096 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/788 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2096 constraints, Known Traps: 25/25 constraints]
After SMT, in 69667ms problems are : Problem set: 0 solved, 2096 unsolved
Search for dead transitions found 0 dead transitions in 69699ms
Starting structural reductions in LTL mode, iteration 1 : 788/792 places, 2100/2100 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116294 ms. Remains : 788/792 places, 2100/2100 transitions.
Support contains 515 out of 788 places after structural reductions.
[2024-05-28 17:51:03] [INFO ] Flatten gal took : 273 ms
[2024-05-28 17:51:03] [INFO ] Flatten gal took : 245 ms
[2024-05-28 17:51:04] [INFO ] Input system was already deterministic with 2100 transitions.
RANDOM walk for 40000 steps (9 resets) in 3676 ms. (10 steps per ms) remains 65/92 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 65/65 properties
[2024-05-28 17:51:06] [INFO ] Flow matrix only has 2068 transitions (discarded 32 similar events)
[2024-05-28 17:51:06] [INFO ] Invariant cache hit.
[2024-05-28 17:51:06] [INFO ] State equation strengthened by 160 read => feed constraints.
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/364 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 63 unsolved
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/364 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 61 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 3 (OVERLAPS) 174/538 variables, 13/18 constraints. Problems are: Problem set: 20 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/538 variables, 0/18 constraints. Problems are: Problem set: 20 solved, 45 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp89 is UNSAT
At refinement iteration 5 (OVERLAPS) 240/778 variables, 33/51 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/778 variables, 0/51 constraints. Problems are: Problem set: 61 solved, 4 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 7 (OVERLAPS) 10/788 variables, 3/54 constraints. Problems are: Problem set: 64 solved, 1 unsolved
[2024-05-28 17:51:08] [INFO ] Deduced a trap composed of 84 places in 451 ms of which 4 ms to minimize.
[2024-05-28 17:51:09] [INFO ] Deduced a trap composed of 83 places in 627 ms of which 4 ms to minimize.
[2024-05-28 17:51:10] [INFO ] Deduced a trap composed of 83 places in 608 ms of which 7 ms to minimize.
[2024-05-28 17:51:10] [INFO ] Deduced a trap composed of 84 places in 543 ms of which 4 ms to minimize.
[2024-05-28 17:51:11] [INFO ] Deduced a trap composed of 83 places in 413 ms of which 4 ms to minimize.
[2024-05-28 17:51:11] [INFO ] Deduced a trap composed of 85 places in 496 ms of which 4 ms to minimize.
[2024-05-28 17:51:12] [INFO ] Deduced a trap composed of 83 places in 656 ms of which 7 ms to minimize.
SMT process timed out in 5442ms, After SMT, problems are : Problem set: 64 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 788 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 788 transition count 2028
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 716 transition count 2028
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 144 place count 716 transition count 1932
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 336 place count 620 transition count 1932
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 494 place count 541 transition count 1853
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 510 place count 541 transition count 1837
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 526 place count 525 transition count 1837
Applied a total of 526 rules in 355 ms. Remains 525 /788 variables (removed 263) and now considering 1837/2100 (removed 263) transitions.
Running 1833 sub problems to find dead transitions.
[2024-05-28 17:51:12] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
// Phase 1: matrix 1805 rows 525 cols
[2024-05-28 17:51:12] [INFO ] Computed 54 invariants in 47 ms
[2024-05-28 17:51:12] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-05-28 17:51:37] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-05-28 17:51:38] [INFO ] Deduced a trap composed of 34 places in 732 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 521/2330 variables, and 47 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1833/1833 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1833 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/521 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/521 variables, 28/45 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
[2024-05-28 17:51:46] [INFO ] Deduced a trap composed of 51 places in 322 ms of which 6 ms to minimize.
[2024-05-28 17:51:47] [INFO ] Deduced a trap composed of 50 places in 336 ms of which 2 ms to minimize.
[2024-05-28 17:51:47] [INFO ] Deduced a trap composed of 33 places in 267 ms of which 2 ms to minimize.
[2024-05-28 17:51:47] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-28 17:51:47] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 3 ms to minimize.
[2024-05-28 17:51:47] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 ms to minimize.
[2024-05-28 17:51:49] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-05-28 17:51:49] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:51:49] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2024-05-28 17:51:53] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1833 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 521/2330 variables, and 57 constraints, problems are : Problem set: 0 solved, 1833 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 28/37 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1833 constraints, Known Traps: 12/12 constraints]
After SMT, in 52146ms problems are : Problem set: 0 solved, 1833 unsolved
Search for dead transitions found 0 dead transitions in 52169ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52529 ms. Remains : 525/788 places, 1837/2100 transitions.
RANDOM walk for 40000 steps (10 resets) in 675 ms. (59 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 158996 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 1
Probabilistic random walk after 158996 steps, saw 118454 distinct states, run finished after 3008 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-28 17:52:08] [INFO ] Flow matrix only has 1805 transitions (discarded 32 similar events)
[2024-05-28 17:52:08] [INFO ] Invariant cache hit.
[2024-05-28 17:52:08] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 440/450 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 24/474 variables, 15/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 49/523 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:52:08] [INFO ] Deduced a trap composed of 50 places in 407 ms of which 4 ms to minimize.
[2024-05-28 17:52:09] [INFO ] Deduced a trap composed of 50 places in 510 ms of which 3 ms to minimize.
[2024-05-28 17:52:09] [INFO ] Deduced a trap composed of 50 places in 478 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2328/2330 variables, and 579 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6530 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 523/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 440/450 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 120 places in 260 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 24/474 variables, 15/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 49/523 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 3 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 4 ms to minimize.
[2024-05-28 17:52:15] [INFO ] Deduced a trap composed of 51 places in 45 ms of which 0 ms to minimize.
Problem AtomicPropp46 is UNSAT
After SMT solving in domain Int declared 523/2330 variables, and 61 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 0/525 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 7593ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 65 atomic propositions for a total of 16 simplifications.
[2024-05-28 17:52:15] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 17:52:15] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:52:15] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T08-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 17:52:15] [INFO ] Flatten gal took : 71 ms
[2024-05-28 17:52:16] [INFO ] Input system was already deterministic with 2100 transitions.
Support contains 65 out of 788 places (down from 185) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 780 transition count 2092
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 780 transition count 2092
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 772 transition count 2084
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 772 transition count 2084
Applied a total of 32 rules in 87 ms. Remains 772 /788 variables (removed 16) and now considering 2084/2100 (removed 16) transitions.
Running 2080 sub problems to find dead transitions.
[2024-05-28 17:52:16] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
// Phase 1: matrix 2052 rows 772 cols
[2024-05-28 17:52:16] [INFO ] Computed 54 invariants in 31 ms
[2024-05-28 17:52:16] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:52:42] [INFO ] Deduced a trap composed of 384 places in 282 ms of which 3 ms to minimize.
[2024-05-28 17:52:42] [INFO ] Deduced a trap composed of 374 places in 270 ms of which 4 ms to minimize.
[2024-05-28 17:52:42] [INFO ] Deduced a trap composed of 131 places in 285 ms of which 4 ms to minimize.
[2024-05-28 17:52:43] [INFO ] Deduced a trap composed of 175 places in 265 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/2824 variables, and 53 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 2080/2080 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/768 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/768 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/768 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2080 unsolved
[2024-05-28 17:52:54] [INFO ] Deduced a trap composed of 339 places in 322 ms of which 3 ms to minimize.
[2024-05-28 17:52:55] [INFO ] Deduced a trap composed of 333 places in 388 ms of which 4 ms to minimize.
[2024-05-28 17:52:56] [INFO ] Deduced a trap composed of 367 places in 413 ms of which 5 ms to minimize.
[2024-05-28 17:52:56] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 4 ms to minimize.
[2024-05-28 17:53:01] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 1 ms to minimize.
[2024-05-28 17:53:01] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 1 ms to minimize.
[2024-05-28 17:53:01] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-05-28 17:53:02] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-28 17:53:02] [INFO ] Deduced a trap composed of 81 places in 77 ms of which 1 ms to minimize.
[2024-05-28 17:53:02] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/2824 variables, and 63 constraints, problems are : Problem set: 0 solved, 2080 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 29/33 constraints, State Equation: 0/772 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/2080 constraints, Known Traps: 14/14 constraints]
After SMT, in 47748ms problems are : Problem set: 0 solved, 2080 unsolved
Search for dead transitions found 0 dead transitions in 47766ms
[2024-05-28 17:53:04] [INFO ] Flow matrix only has 2052 transitions (discarded 32 similar events)
[2024-05-28 17:53:04] [INFO ] Invariant cache hit.
[2024-05-28 17:53:04] [INFO ] Implicit Places using invariants in 721 ms returned [2, 134, 146, 217, 293, 348, 386, 570]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 730 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 764/788 places, 2084/2100 transitions.
Applied a total of 0 rules in 14 ms. Remains 764 /764 variables (removed 0) and now considering 2084/2084 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48603 ms. Remains : 764/788 places, 2084/2100 transitions.
[2024-05-28 17:53:04] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:53:04] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:53:05] [INFO ] Input system was already deterministic with 2084 transitions.
[2024-05-28 17:53:05] [INFO ] Flatten gal took : 85 ms
[2024-05-28 17:53:05] [INFO ] Flatten gal took : 67 ms
[2024-05-28 17:53:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality1289896133237493958.gal : 69 ms
[2024-05-28 17:53:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3224552069902691157.ctl : 2 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/CTLCardinality1289896133237493958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3224552069902691157.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.
Detected timeout of ITS tools.
[2024-05-28 17:53:35] [INFO ] Flatten gal took : 139 ms
[2024-05-28 17:53:35] [INFO ] Applying decomposition
[2024-05-28 17:53:35] [INFO ] Flatten gal took : 91 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/graph9306491225162842137.txt' '-o' '/tmp/graph9306491225162842137.bin' '-w' '/tmp/graph9306491225162842137.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9306491225162842137.bin' '-l' '-1' '-v' '-w' '/tmp/graph9306491225162842137.weights' '-q' '0' '-e' '0.001'
[2024-05-28 17:53:36] [INFO ] Decomposing Gal with order
[2024-05-28 17:53:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 17:53:36] [INFO ] Removed a total of 1741 redundant transitions.
[2024-05-28 17:53:36] [INFO ] Flatten gal took : 278 ms
[2024-05-28 17:53:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 247 labels/synchronizations in 93 ms.
[2024-05-28 17:53:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality1581298318464644934.gal : 64 ms
[2024-05-28 17:53:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality357711075784643708.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/CTLCardinality1581298318464644934.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality357711075784643708.ctl'

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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 788/788 places, 2100/2100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 788 transition count 2044
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 732 transition count 2036
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 128 place count 724 transition count 2036
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 128 place count 724 transition count 1940
Deduced a syphon composed of 96 places in 1 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 320 place count 628 transition count 1940
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 480 place count 548 transition count 1860
Applied a total of 480 rules in 110 ms. Remains 548 /788 variables (removed 240) and now considering 1860/2100 (removed 240) transitions.
Running 1856 sub problems to find dead transitions.
[2024-05-28 17:54:07] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
// Phase 1: matrix 1828 rows 548 cols
[2024-05-28 17:54:07] [INFO ] Computed 54 invariants in 35 ms
[2024-05-28 17:54:07] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 4 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 2 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2024-05-28 17:54:27] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-28 17:54:28] [INFO ] Deduced a trap composed of 251 places in 277 ms of which 3 ms to minimize.
[2024-05-28 17:54:28] [INFO ] Deduced a trap composed of 174 places in 286 ms of which 3 ms to minimize.
[2024-05-28 17:54:28] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:54:29] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 0 ms to minimize.
[2024-05-28 17:54:29] [INFO ] Deduced a trap composed of 33 places in 211 ms of which 2 ms to minimize.
[2024-05-28 17:54:30] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-28 17:54:31] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/2376 variables, and 63 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 1856/1856 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1856 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/544 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/544 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/544 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 1856 unsolved
[2024-05-28 17:54:51] [INFO ] Deduced a trap composed of 321 places in 305 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/2376 variables, and 64 constraints, problems are : Problem set: 0 solved, 1856 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 34/37 constraints, State Equation: 0/548 constraints, ReadFeed: 0/160 constraints, PredecessorRefiner: 0/1856 constraints, Known Traps: 14/14 constraints]
After SMT, in 47826ms problems are : Problem set: 0 solved, 1856 unsolved
Search for dead transitions found 0 dead transitions in 47841ms
[2024-05-28 17:54:54] [INFO ] Flow matrix only has 1828 transitions (discarded 32 similar events)
[2024-05-28 17:54:54] [INFO ] Invariant cache hit.
[2024-05-28 17:54:55] [INFO ] Implicit Places using invariants in 576 ms returned [2, 93, 104, 152, 205, 242, 270, 405]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 594 ms to find 8 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 540/788 places, 1860/2100 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 533 transition count 1853
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 533 transition count 1853
Applied a total of 14 rules in 47 ms. Remains 533 /540 variables (removed 7) and now considering 1853/1860 (removed 7) transitions.
[2024-05-28 17:54:55] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
// Phase 1: matrix 1821 rows 533 cols
[2024-05-28 17:54:55] [INFO ] Computed 46 invariants in 29 ms
[2024-05-28 17:54:56] [INFO ] Implicit Places using invariants in 642 ms returned []
[2024-05-28 17:54:56] [INFO ] Flow matrix only has 1821 transitions (discarded 32 similar events)
[2024-05-28 17:54:56] [INFO ] Invariant cache hit.
[2024-05-28 17:54:59] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-05-28 17:55:13] [INFO ] Implicit Places using invariants and state equation in 17613 ms returned []
Implicit Place search using SMT with State Equation took 18266 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 533/788 places, 1853/2100 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 66861 ms. Remains : 533/788 places, 1853/2100 transitions.
[2024-05-28 17:55:13] [INFO ] Flatten gal took : 57 ms
[2024-05-28 17:55:13] [INFO ] Flatten gal took : 69 ms
[2024-05-28 17:55:14] [INFO ] Input system was already deterministic with 1853 transitions.
[2024-05-28 17:55:14] [INFO ] Flatten gal took : 55 ms
[2024-05-28 17:55:14] [INFO ] Flatten gal took : 55 ms
[2024-05-28 17:55:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8015677523639514994.gal : 9 ms
[2024-05-28 17:55:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality14744787992930416809.ctl : 14 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/CTLCardinality8015677523639514994.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14744787992930416809.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.

BK_STOP 1716918923189

--------------------
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="PolyORBLF-PT-S04J06T08"
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 PolyORBLF-PT-S04J06T08, 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 r290-tajo-171654446800297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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