MCC'2024- Execution of r290-tajo-171654446900338

About the Execution of ITS-Tools for PolyORBLF-PT-S06J06T04

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

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446900338.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-S06J06T04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446900338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 16K Apr 11 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 221K Apr 11 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 855K Apr 11 17:23 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 9.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 341K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Apr 11 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 11 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 483K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.1M Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K 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 6.9M 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-S06J06T04-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716920427858

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 18:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 18:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 18:20:29] [INFO ] Load time of PNML (sax parser for PT used): 437 ms
[2024-05-28 18:20:29] [INFO ] Transformed 506 places.
[2024-05-28 18:20:29] [INFO ] Transformed 7154 transitions.
[2024-05-28 18:20:29] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 54 ms.
[2024-05-28 18:20:29] [INFO ] Reduced 4680 identical enabling conditions.
[2024-05-28 18:20:29] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 316 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Applied a total of 0 rules in 57 ms. Remains 506 /506 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Running 1768 sub problems to find dead transitions.
[2024-05-28 18:20:30] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
// Phase 1: matrix 1750 rows 506 cols
[2024-05-28 18:20:30] [INFO ] Computed 54 invariants in 78 ms
[2024-05-28 18:20:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 18:20:57] [INFO ] Deduced a trap composed of 30 places in 433 ms of which 31 ms to minimize.
[2024-05-28 18:20:58] [INFO ] Deduced a trap composed of 226 places in 397 ms of which 4 ms to minimize.
[2024-05-28 18:20:59] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 4 ms to minimize.
[2024-05-28 18:20:59] [INFO ] Deduced a trap composed of 82 places in 239 ms of which 2 ms to minimize.
[2024-05-28 18:20:59] [INFO ] Deduced a trap composed of 107 places in 221 ms of which 2 ms to minimize.
[2024-05-28 18:21:00] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 2 ms to minimize.
[2024-05-28 18:21:01] [INFO ] Deduced a trap composed of 207 places in 369 ms of which 3 ms to minimize.
[2024-05-28 18:21:02] [INFO ] Deduced a trap composed of 219 places in 343 ms of which 3 ms to minimize.
[2024-05-28 18:21:02] [INFO ] Deduced a trap composed of 215 places in 303 ms of which 2 ms to minimize.
[2024-05-28 18:21:04] [INFO ] Deduced a trap composed of 47 places in 207 ms of which 2 ms to minimize.
SMT process timed out in 34053ms, After SMT, problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 34107ms
[2024-05-28 18:21:04] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 18:21:04] [INFO ] Invariant cache hit.
[2024-05-28 18:21:04] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-28 18:21:04] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 18:21:04] [INFO ] Invariant cache hit.
[2024-05-28 18:21:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:21:10] [INFO ] Implicit Places using invariants and state equation in 6211 ms returned []
Implicit Place search using SMT with State Equation took 6427 ms to find 0 implicit places.
Running 1768 sub problems to find dead transitions.
[2024-05-28 18:21:10] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 18:21:10] [INFO ] Invariant cache hit.
[2024-05-28 18:21:10] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
[2024-05-28 18:21:39] [INFO ] Deduced a trap composed of 30 places in 360 ms of which 3 ms to minimize.
[2024-05-28 18:21:40] [INFO ] Deduced a trap composed of 215 places in 389 ms of which 3 ms to minimize.
[2024-05-28 18:21:40] [INFO ] Deduced a trap composed of 223 places in 381 ms of which 5 ms to minimize.
[2024-05-28 18:21:41] [INFO ] Deduced a trap composed of 82 places in 304 ms of which 2 ms to minimize.
[2024-05-28 18:21:41] [INFO ] Deduced a trap composed of 107 places in 263 ms of which 3 ms to minimize.
[2024-05-28 18:21:42] [INFO ] Deduced a trap composed of 208 places in 360 ms of which 3 ms to minimize.
[2024-05-28 18:21:43] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2024-05-28 18:21:44] [INFO ] Deduced a trap composed of 222 places in 309 ms of which 3 ms to minimize.
[2024-05-28 18:21:45] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 494/2256 variables, and 50 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1768/1768 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/494 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/494 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/494 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1768 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 494/2256 variables, and 50 constraints, problems are : Problem set: 0 solved, 1768 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 20/23 constraints, Generalized P Invariants (flows): 21/31 constraints, State Equation: 0/506 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1768 constraints, Known Traps: 9/9 constraints]
After SMT, in 76506ms problems are : Problem set: 0 solved, 1768 unsolved
Search for dead transitions found 0 dead transitions in 76540ms
Finished structural reductions in LTL mode , in 1 iterations and 117199 ms. Remains : 506/506 places, 1774/1774 transitions.
Support contains 316 out of 506 places after structural reductions.
[2024-05-28 18:22:27] [INFO ] Flatten gal took : 238 ms
[2024-05-28 18:22:28] [INFO ] Flatten gal took : 160 ms
[2024-05-28 18:22:28] [INFO ] Input system was already deterministic with 1774 transitions.
Reduction of identical properties reduced properties to check from 91 to 90
RANDOM walk for 40000 steps (187 resets) in 2662 ms. (15 steps per ms) remains 47/90 properties
BEST_FIRST walk for 4003 steps (20 resets) in 197 ms. (20 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (10 resets) in 77 ms. (51 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (12 resets) in 210 ms. (18 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (12 resets) in 57 ms. (69 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
[2024-05-28 18:22:30] [INFO ] Flow matrix only has 1750 transitions (discarded 24 similar events)
[2024-05-28 18:22:30] [INFO ] Invariant cache hit.
[2024-05-28 18:22:30] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/293 variables, 17/17 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 24 solved, 22 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 15/308 variables, 4/21 constraints. Problems are: Problem set: 24 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 0/21 constraints. Problems are: Problem set: 24 solved, 22 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
At refinement iteration 5 (OVERLAPS) 183/491 variables, 22/43 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/491 variables, 0/43 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 5/496 variables, 2/45 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/45 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 10/506 variables, 9/54 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/506 variables, 0/54 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1750/2256 variables, 506/560 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2256 variables, 112/672 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2256 variables, 0/672 constraints. Problems are: Problem set: 43 solved, 3 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 (/ 55.0 56.0))
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 (/ 1.0 14.0))
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 (/ 1.0 56.0))
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 (/ 55.0 14.0))
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 (/ 1.0 56.0))
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 (/ 1.0 21.0))
(s219 (/ 1.0 56.0))
(s220 0.0)
(s221 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 (/ 13.0 14.0))
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 (/ 1.0 14.0))
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 (/ 5.0 14.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 (/ 1.0 42.0))
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 9.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 672 constraints, problems are : Problem set: 43 solved, 3 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 506/506 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 43 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 117/127 variables, 5/5 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/5 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/147 variables, 5/10 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/10 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 47/194 variables, 4/14 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/14 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 288/482 variables, 21/35 constraints. Problems are: Problem set: 43 solved, 3 unsolved
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 94 places in 314 ms of which 3 ms to minimize.
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 93 places in 151 ms of which 2 ms to minimize.
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 3/38 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 0/38 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 11/493 variables, 8/46 constraints. Problems are: Problem set: 43 solved, 3 unsolved
[2024-05-28 18:22:37] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/493 variables, 1/47 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/47 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 11/504 variables, 10/57 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/504 variables, 0/57 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1750/2254 variables, 504/561 constraints. Problems are: Problem set: 43 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2254 variables, 112/673 constraints. Problems are: Problem set: 43 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2254/2256 variables, and 676 constraints, problems are : Problem set: 43 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 22/23 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 504/506 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 3/46 constraints, Known Traps: 4/4 constraints]
After SMT, in 11201ms problems are : Problem set: 43 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 500 transition count 1742
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 468 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 70 place count 468 transition count 1686
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 182 place count 412 transition count 1686
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 278 place count 364 transition count 1638
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 287 place count 364 transition count 1629
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 296 place count 355 transition count 1629
Applied a total of 296 rules in 345 ms. Remains 355 /506 variables (removed 151) and now considering 1629/1774 (removed 145) transitions.
Running 1623 sub problems to find dead transitions.
[2024-05-28 18:22:42] [INFO ] Flow matrix only has 1605 transitions (discarded 24 similar events)
// Phase 1: matrix 1605 rows 355 cols
[2024-05-28 18:22:42] [INFO ] Computed 48 invariants in 84 ms
[2024-05-28 18:22:42] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
[2024-05-28 18:23:07] [INFO ] Deduced a trap composed of 11 places in 220 ms of which 2 ms to minimize.
[2024-05-28 18:23:13] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 2 ms to minimize.
[2024-05-28 18:23:17] [INFO ] Deduced a trap composed of 97 places in 277 ms of which 3 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 349/1960 variables, and 44 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/355 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1623/1623 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1623 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/349 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
[2024-05-28 18:23:20] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 0 ms to minimize.
[2024-05-28 18:23:29] [INFO ] Deduced a trap composed of 81 places in 241 ms of which 2 ms to minimize.
[2024-05-28 18:23:30] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 1 ms to minimize.
[2024-05-28 18:23:33] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:23:33] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 1623 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 349/1960 variables, and 49 constraints, problems are : Problem set: 0 solved, 1623 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/22 constraints, Generalized P Invariants (flows): 20/26 constraints, State Equation: 0/355 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1623 constraints, Known Traps: 8/8 constraints]
After SMT, in 56308ms problems are : Problem set: 0 solved, 1623 unsolved
Search for dead transitions found 0 dead transitions in 56328ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56678 ms. Remains : 355/506 places, 1629/1774 transitions.
RANDOM walk for 40000 steps (382 resets) in 598 ms. (66 steps per ms) remains 1/3 properties
BEST_FIRST walk for 34270 steps (59 resets) in 271 ms. (125 steps per ms) remains 0/1 properties
Successfully simplified 43 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S06J06T04-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 18:23:39] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-28 18:23:39] [INFO ] Flatten gal took : 151 ms
FORMULA PolyORBLF-PT-S06J06T04-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T04-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 18:23:39] [INFO ] Flatten gal took : 136 ms
[2024-05-28 18:23:39] [INFO ] Input system was already deterministic with 1774 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 500 transition count 1758
Reduce places removed 16 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 24 rules applied. Total rules applied 40 place count 484 transition count 1750
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 48 place count 476 transition count 1750
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 48 place count 476 transition count 1690
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 168 place count 416 transition count 1690
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 240 place count 380 transition count 1654
Applied a total of 240 rules in 129 ms. Remains 380 /506 variables (removed 126) and now considering 1654/1774 (removed 120) transitions.
Running 1648 sub problems to find dead transitions.
[2024-05-28 18:23:39] [INFO ] Flow matrix only has 1630 transitions (discarded 24 similar events)
// Phase 1: matrix 1630 rows 380 cols
[2024-05-28 18:23:39] [INFO ] Computed 48 invariants in 28 ms
[2024-05-28 18:23:39] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
[2024-05-28 18:24:08] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-28 18:24:09] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-28 18:24:09] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 3 ms to minimize.
[2024-05-28 18:24:13] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 374/2010 variables, and 41 constraints, problems are : Problem set: 0 solved, 1648 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/380 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1648/1648 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1648 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/374 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/374 variables, 20/37 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/374 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/374 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1648 unsolved
Problem TDEAD34 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD641 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD676 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD683 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD705 is UNSAT
Problem TDEAD706 is UNSAT
Problem TDEAD708 is UNSAT
Problem TDEAD709 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD751 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD755 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD758 is UNSAT
Problem TDEAD759 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD882 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD925 is UNSAT
Problem TDEAD934 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1134 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1257 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/377 variables, 3/44 constraints. Problems are: Problem set: 324 solved, 1324 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 377/2010 variables, and 44 constraints, problems are : Problem set: 324 solved, 1324 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 20/28 constraints, State Equation: 0/380 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1648 constraints, Known Traps: 4/4 constraints]
After SMT, in 60598ms problems are : Problem set: 324 solved, 1324 unsolved
Search for dead transitions found 324 dead transitions in 60623ms
Found 324 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 324 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 324 transitions.
[2024-05-28 18:24:40] [INFO ] Flow matrix only has 1306 transitions (discarded 24 similar events)
// Phase 1: matrix 1306 rows 380 cols
[2024-05-28 18:24:40] [INFO ] Computed 48 invariants in 21 ms
[2024-05-28 18:24:41] [INFO ] Implicit Places using invariants in 522 ms returned [18, 76, 156, 313]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 529 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 376/506 places, 1330/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 372 transition count 1326
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 372 transition count 1326
Applied a total of 8 rules in 42 ms. Remains 372 /376 variables (removed 4) and now considering 1326/1330 (removed 4) transitions.
[2024-05-28 18:24:41] [INFO ] Flow matrix only has 1302 transitions (discarded 24 similar events)
// Phase 1: matrix 1302 rows 372 cols
[2024-05-28 18:24:41] [INFO ] Computed 44 invariants in 19 ms
[2024-05-28 18:24:41] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-28 18:24:41] [INFO ] Flow matrix only has 1302 transitions (discarded 24 similar events)
[2024-05-28 18:24:41] [INFO ] Invariant cache hit.
[2024-05-28 18:24:42] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:25:01] [INFO ] Implicit Places using invariants and state equation in 19539 ms returned []
Implicit Place search using SMT with State Equation took 20024 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 372/506 places, 1326/1774 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 81356 ms. Remains : 372/506 places, 1326/1774 transitions.
[2024-05-28 18:25:01] [INFO ] Flatten gal took : 54 ms
[2024-05-28 18:25:01] [INFO ] Flatten gal took : 55 ms
[2024-05-28 18:25:01] [INFO ] Input system was already deterministic with 1326 transitions.
[2024-05-28 18:25:01] [INFO ] Flatten gal took : 56 ms
[2024-05-28 18:25:01] [INFO ] Flatten gal took : 54 ms
[2024-05-28 18:25:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14718084831494694411.gal : 18 ms
[2024-05-28 18:25:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3779593859127916980.ctl : 5 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/CTLFireability14718084831494694411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3779593859127916980.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.
Detected timeout of ITS tools.
[2024-05-28 18:25:31] [INFO ] Flatten gal took : 91 ms
[2024-05-28 18:25:31] [INFO ] Applying decomposition
[2024-05-28 18:25:31] [INFO ] Flatten gal took : 72 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/graph7298917449235044260.txt' '-o' '/tmp/graph7298917449235044260.bin' '-w' '/tmp/graph7298917449235044260.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7298917449235044260.bin' '-l' '-1' '-v' '-w' '/tmp/graph7298917449235044260.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:25:32] [INFO ] Decomposing Gal with order
[2024-05-28 18:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:25:32] [INFO ] Removed a total of 749 redundant transitions.
[2024-05-28 18:25:32] [INFO ] Flatten gal took : 265 ms
[2024-05-28 18:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 131 labels/synchronizations in 36 ms.
[2024-05-28 18:25:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6098174306196152263.gal : 20 ms
[2024-05-28 18:25:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16146018036205660543.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6098174306196152263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16146018036205660543.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 496 transition count 1770
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 492 transition count 1766
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 492 transition count 1766
Applied a total of 22 rules in 73 ms. Remains 492 /506 variables (removed 14) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 18:26:02] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 18:26:02] [INFO ] Computed 48 invariants in 52 ms
[2024-05-28 18:26:02] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:26:30] [INFO ] Deduced a trap composed of 123 places in 408 ms of which 3 ms to minimize.
[2024-05-28 18:26:31] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 1 ms to minimize.
[2024-05-28 18:26:31] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 2 ms to minimize.
[2024-05-28 18:26:31] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 2 ms to minimize.
[2024-05-28 18:26:31] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2024-05-28 18:26:33] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 3 ms to minimize.
[2024-05-28 18:26:34] [INFO ] Deduced a trap composed of 192 places in 440 ms of which 4 ms to minimize.
[2024-05-28 18:26:36] [INFO ] Deduced a trap composed of 74 places in 378 ms of which 3 ms to minimize.
[2024-05-28 18:26:36] [INFO ] Deduced a trap composed of 102 places in 424 ms of which 4 ms to minimize.
[2024-05-28 18:26:37] [INFO ] Deduced a trap composed of 233 places in 379 ms of which 4 ms to minimize.
[2024-05-28 18:26:38] [INFO ] Deduced a trap composed of 214 places in 355 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2234 variables, and 53 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:26:49] [INFO ] Deduced a trap composed of 30 places in 537 ms of which 4 ms to minimize.
[2024-05-28 18:26:52] [INFO ] Deduced a trap composed of 221 places in 360 ms of which 4 ms to minimize.
[2024-05-28 18:26:55] [INFO ] Deduced a trap composed of 285 places in 485 ms of which 3 ms to minimize.
[2024-05-28 18:26:56] [INFO ] Deduced a trap composed of 218 places in 324 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 57 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 15/15 constraints]
After SMT, in 56253ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 56281ms
[2024-05-28 18:26:59] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:26:59] [INFO ] Invariant cache hit.
[2024-05-28 18:26:59] [INFO ] Implicit Places using invariants in 482 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 488 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/506 places, 1766/1774 transitions.
Applied a total of 0 rules in 21 ms. Remains 488 /488 variables (removed 0) and now considering 1766/1766 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56871 ms. Remains : 488/506 places, 1766/1774 transitions.
[2024-05-28 18:26:59] [INFO ] Flatten gal took : 72 ms
[2024-05-28 18:26:59] [INFO ] Flatten gal took : 78 ms
[2024-05-28 18:26:59] [INFO ] Input system was already deterministic with 1766 transitions.
[2024-05-28 18:26:59] [INFO ] Flatten gal took : 80 ms
[2024-05-28 18:27:00] [INFO ] Flatten gal took : 78 ms
[2024-05-28 18:27:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18289845796226607880.gal : 12 ms
[2024-05-28 18:27:00] [INFO ] Time to serialize properties into /tmp/CTLFireability118673685398578064.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18289845796226607880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability118673685398578064.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 18:27:30] [INFO ] Flatten gal took : 106 ms
[2024-05-28 18:27:30] [INFO ] Applying decomposition
[2024-05-28 18:27:30] [INFO ] Flatten gal took : 81 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/graph18161046188958276370.txt' '-o' '/tmp/graph18161046188958276370.bin' '-w' '/tmp/graph18161046188958276370.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18161046188958276370.bin' '-l' '-1' '-v' '-w' '/tmp/graph18161046188958276370.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:27:30] [INFO ] Decomposing Gal with order
[2024-05-28 18:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:27:30] [INFO ] Removed a total of 729 redundant transitions.
[2024-05-28 18:27:30] [INFO ] Flatten gal took : 155 ms
[2024-05-28 18:27:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 35 ms.
[2024-05-28 18:27:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11753830707022255520.gal : 21 ms
[2024-05-28 18:27:30] [INFO ] Time to serialize properties into /tmp/CTLFireability7273998161991456245.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11753830707022255520.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7273998161991456245.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 -...263
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 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 500 transition count 1746
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 472 transition count 1746
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 56 place count 472 transition count 1686
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 176 place count 412 transition count 1686
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 256 place count 372 transition count 1646
Applied a total of 256 rules in 115 ms. Remains 372 /506 variables (removed 134) and now considering 1646/1774 (removed 128) transitions.
Running 1640 sub problems to find dead transitions.
[2024-05-28 18:28:01] [INFO ] Flow matrix only has 1622 transitions (discarded 24 similar events)
// Phase 1: matrix 1622 rows 372 cols
[2024-05-28 18:28:01] [INFO ] Computed 48 invariants in 34 ms
[2024-05-28 18:28:01] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/366 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 1640 unsolved
[2024-05-28 18:28:31] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 2 ms to minimize.
[2024-05-28 18:28:33] [INFO ] Deduced a trap composed of 106 places in 233 ms of which 2 ms to minimize.
[2024-05-28 18:28:39] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 2 ms to minimize.
[2024-05-28 18:28:39] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 2 ms to minimize.
[2024-05-28 18:28:39] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 6 ms to minimize.
[2024-05-28 18:28:41] [INFO ] Deduced a trap composed of 107 places in 285 ms of which 3 ms to minimize.
SMT process timed out in 40567ms, After SMT, problems are : Problem set: 0 solved, 1640 unsolved
Search for dead transitions found 0 dead transitions in 40588ms
[2024-05-28 18:28:41] [INFO ] Flow matrix only has 1622 transitions (discarded 24 similar events)
[2024-05-28 18:28:41] [INFO ] Invariant cache hit.
[2024-05-28 18:28:42] [INFO ] Implicit Places using invariants in 463 ms returned [19, 76, 157, 311]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 472 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 368/506 places, 1646/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 364 transition count 1642
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 364 transition count 1642
Applied a total of 8 rules in 48 ms. Remains 364 /368 variables (removed 4) and now considering 1642/1646 (removed 4) transitions.
[2024-05-28 18:28:42] [INFO ] Flow matrix only has 1618 transitions (discarded 24 similar events)
// Phase 1: matrix 1618 rows 364 cols
[2024-05-28 18:28:42] [INFO ] Computed 44 invariants in 40 ms
[2024-05-28 18:28:42] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 18:28:42] [INFO ] Flow matrix only has 1618 transitions (discarded 24 similar events)
[2024-05-28 18:28:42] [INFO ] Invariant cache hit.
[2024-05-28 18:28:44] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:28:55] [INFO ] Implicit Places using invariants and state equation in 13163 ms returned []
Implicit Place search using SMT with State Equation took 13757 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 364/506 places, 1642/1774 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 54985 ms. Remains : 364/506 places, 1642/1774 transitions.
[2024-05-28 18:28:56] [INFO ] Flatten gal took : 56 ms
[2024-05-28 18:28:56] [INFO ] Flatten gal took : 60 ms
[2024-05-28 18:28:56] [INFO ] Input system was already deterministic with 1642 transitions.
[2024-05-28 18:28:56] [INFO ] Flatten gal took : 62 ms
[2024-05-28 18:28:56] [INFO ] Flatten gal took : 63 ms
[2024-05-28 18:28:56] [INFO ] Time to serialize gal into /tmp/CTLFireability50343631896943813.gal : 11 ms
[2024-05-28 18:28:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11182519432201237488.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability50343631896943813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11182519432201237488.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 18:29:26] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:29:26] [INFO ] Applying decomposition
[2024-05-28 18:29:26] [INFO ] Flatten gal took : 65 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/graph9165579959295145359.txt' '-o' '/tmp/graph9165579959295145359.bin' '-w' '/tmp/graph9165579959295145359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9165579959295145359.bin' '-l' '-1' '-v' '-w' '/tmp/graph9165579959295145359.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:29:26] [INFO ] Decomposing Gal with order
[2024-05-28 18:29:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:29:26] [INFO ] Removed a total of 726 redundant transitions.
[2024-05-28 18:29:26] [INFO ] Flatten gal took : 107 ms
[2024-05-28 18:29:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 10 ms.
[2024-05-28 18:29:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12878718703903841450.gal : 14 ms
[2024-05-28 18:29:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3991114225679763214.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/CTLFireability12878718703903841450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3991114225679763214.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 -...263
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 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 500 transition count 1742
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 468 transition count 1742
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 64 place count 468 transition count 1686
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 176 place count 412 transition count 1686
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 272 place count 364 transition count 1638
Applied a total of 272 rules in 148 ms. Remains 364 /506 variables (removed 142) and now considering 1638/1774 (removed 136) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 18:29:57] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 364 cols
[2024-05-28 18:29:57] [INFO ] Computed 48 invariants in 52 ms
[2024-05-28 18:29:57] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 18:30:25] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 5 ms to minimize.
[2024-05-28 18:30:31] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1978 variables, and 43 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20090 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 23/29 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 23/41 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 18:30:37] [INFO ] Deduced a trap composed of 102 places in 293 ms of which 2 ms to minimize.
[2024-05-28 18:30:51] [INFO ] Deduced a trap composed of 43 places in 269 ms of which 2 ms to minimize.
[2024-05-28 18:30:52] [INFO ] Deduced a trap composed of 83 places in 285 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 3/46 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1978 variables, and 46 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 23/29 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 5/5 constraints]
After SMT, in 58352ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 58374ms
[2024-05-28 18:30:55] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
[2024-05-28 18:30:55] [INFO ] Invariant cache hit.
[2024-05-28 18:30:55] [INFO ] Implicit Places using invariants in 409 ms returned [18, 74, 152, 302]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 415 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 360/506 places, 1638/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1634
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1634
Applied a total of 8 rules in 41 ms. Remains 356 /360 variables (removed 4) and now considering 1634/1638 (removed 4) transitions.
[2024-05-28 18:30:56] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
// Phase 1: matrix 1610 rows 356 cols
[2024-05-28 18:30:56] [INFO ] Computed 44 invariants in 58 ms
[2024-05-28 18:30:56] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-28 18:30:56] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 18:30:56] [INFO ] Invariant cache hit.
[2024-05-28 18:30:57] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:31:08] [INFO ] Implicit Places using invariants and state equation in 11644 ms returned []
Implicit Place search using SMT with State Equation took 12194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 356/506 places, 1634/1774 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 71178 ms. Remains : 356/506 places, 1634/1774 transitions.
[2024-05-28 18:31:08] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:31:08] [INFO ] Flatten gal took : 76 ms
[2024-05-28 18:31:08] [INFO ] Input system was already deterministic with 1634 transitions.
[2024-05-28 18:31:08] [INFO ] Flatten gal took : 69 ms
[2024-05-28 18:31:08] [INFO ] Flatten gal took : 72 ms
[2024-05-28 18:31:08] [INFO ] Time to serialize gal into /tmp/CTLFireability14730950436531374019.gal : 10 ms
[2024-05-28 18:31:08] [INFO ] Time to serialize properties into /tmp/CTLFireability3888271402710179170.ctl : 6 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/CTLFireability14730950436531374019.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3888271402710179170.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.
Detected timeout of ITS tools.
[2024-05-28 18:31:38] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:31:38] [INFO ] Applying decomposition
[2024-05-28 18:31:38] [INFO ] Flatten gal took : 69 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/graph11897747422213675299.txt' '-o' '/tmp/graph11897747422213675299.bin' '-w' '/tmp/graph11897747422213675299.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11897747422213675299.bin' '-l' '-1' '-v' '-w' '/tmp/graph11897747422213675299.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:31:39] [INFO ] Decomposing Gal with order
[2024-05-28 18:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:31:39] [INFO ] Removed a total of 844 redundant transitions.
[2024-05-28 18:31:39] [INFO ] Flatten gal took : 246 ms
[2024-05-28 18:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 12 ms.
[2024-05-28 18:31:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3786536717074010207.gal : 16 ms
[2024-05-28 18:31:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11968496044444894433.ctl : 12 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/CTLFireability3786536717074010207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11968496044444894433.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 496 transition count 1770
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 496 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 492 transition count 1766
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 492 transition count 1766
Applied a total of 22 rules in 60 ms. Remains 492 /506 variables (removed 14) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 18:32:09] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 492 cols
[2024-05-28 18:32:09] [INFO ] Computed 48 invariants in 44 ms
[2024-05-28 18:32:09] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:32:38] [INFO ] Deduced a trap composed of 123 places in 263 ms of which 3 ms to minimize.
[2024-05-28 18:32:38] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:32:39] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 1 ms to minimize.
[2024-05-28 18:32:39] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 1 ms to minimize.
[2024-05-28 18:32:39] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2024-05-28 18:32:40] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 1 ms to minimize.
[2024-05-28 18:32:41] [INFO ] Deduced a trap composed of 192 places in 339 ms of which 3 ms to minimize.
[2024-05-28 18:32:43] [INFO ] Deduced a trap composed of 74 places in 297 ms of which 3 ms to minimize.
[2024-05-28 18:32:43] [INFO ] Deduced a trap composed of 102 places in 308 ms of which 2 ms to minimize.
[2024-05-28 18:32:44] [INFO ] Deduced a trap composed of 233 places in 320 ms of which 3 ms to minimize.
[2024-05-28 18:32:44] [INFO ] Deduced a trap composed of 214 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2234 variables, and 53 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 11/53 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:32:56] [INFO ] Deduced a trap composed of 30 places in 475 ms of which 4 ms to minimize.
[2024-05-28 18:32:59] [INFO ] Deduced a trap composed of 221 places in 417 ms of which 4 ms to minimize.
[2024-05-28 18:33:02] [INFO ] Deduced a trap composed of 285 places in 440 ms of which 3 ms to minimize.
[2024-05-28 18:33:04] [INFO ] Deduced a trap composed of 218 places in 398 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 57 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 15/15 constraints]
After SMT, in 57290ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 57317ms
[2024-05-28 18:33:07] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:33:07] [INFO ] Invariant cache hit.
[2024-05-28 18:33:07] [INFO ] Implicit Places using invariants in 478 ms returned []
[2024-05-28 18:33:07] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:33:07] [INFO ] Invariant cache hit.
[2024-05-28 18:33:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:33:25] [INFO ] Implicit Places using invariants and state equation in 17986 ms returned []
Implicit Place search using SMT with State Equation took 18478 ms to find 0 implicit places.
Running 1760 sub problems to find dead transitions.
[2024-05-28 18:33:25] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:33:25] [INFO ] Invariant cache hit.
[2024-05-28 18:33:25] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:33:56] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 1 ms to minimize.
[2024-05-28 18:33:56] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-28 18:33:56] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2024-05-28 18:33:56] [INFO ] Deduced a trap composed of 91 places in 369 ms of which 6 ms to minimize.
[2024-05-28 18:33:57] [INFO ] Deduced a trap composed of 30 places in 406 ms of which 2 ms to minimize.
[2024-05-28 18:33:59] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 2 ms to minimize.
[2024-05-28 18:33:59] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 3 ms to minimize.
[2024-05-28 18:34:00] [INFO ] Deduced a trap composed of 192 places in 305 ms of which 3 ms to minimize.
[2024-05-28 18:34:00] [INFO ] Deduced a trap composed of 214 places in 307 ms of which 2 ms to minimize.
[2024-05-28 18:34:01] [INFO ] Deduced a trap composed of 306 places in 353 ms of which 2 ms to minimize.
[2024-05-28 18:34:02] [INFO ] Deduced a trap composed of 92 places in 303 ms of which 3 ms to minimize.
[2024-05-28 18:34:02] [INFO ] Deduced a trap composed of 99 places in 310 ms of which 3 ms to minimize.
[2024-05-28 18:34:03] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 3 ms to minimize.
[2024-05-28 18:34:03] [INFO ] Deduced a trap composed of 233 places in 305 ms of which 3 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 486/2234 variables, and 56 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 23/42 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:34:29] [INFO ] Deduced a trap composed of 266 places in 384 ms of which 3 ms to minimize.
[2024-05-28 18:34:32] [INFO ] Deduced a trap composed of 214 places in 288 ms of which 3 ms to minimize.
[2024-05-28 18:34:42] [INFO ] Deduced a trap composed of 272 places in 418 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2234 variables, and 59 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 23/28 constraints, State Equation: 0/492 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 17/17 constraints]
After SMT, in 78938ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 78956ms
Starting structural reductions in LTL mode, iteration 1 : 492/506 places, 1766/1774 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154822 ms. Remains : 492/506 places, 1766/1774 transitions.
[2024-05-28 18:34:44] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:34:44] [INFO ] Flatten gal took : 70 ms
[2024-05-28 18:34:44] [INFO ] Input system was already deterministic with 1766 transitions.
[2024-05-28 18:34:44] [INFO ] Flatten gal took : 70 ms
[2024-05-28 18:34:44] [INFO ] Flatten gal took : 88 ms
[2024-05-28 18:34:44] [INFO ] Time to serialize gal into /tmp/CTLFireability14467984842742861915.gal : 9 ms
[2024-05-28 18:34:44] [INFO ] Time to serialize properties into /tmp/CTLFireability14559564109095370784.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14467984842742861915.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14559564109095370784.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-28 18:35:15] [INFO ] Flatten gal took : 112 ms
[2024-05-28 18:35:15] [INFO ] Applying decomposition
[2024-05-28 18:35:15] [INFO ] Flatten gal took : 84 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/graph17998116077621670653.txt' '-o' '/tmp/graph17998116077621670653.bin' '-w' '/tmp/graph17998116077621670653.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17998116077621670653.bin' '-l' '-1' '-v' '-w' '/tmp/graph17998116077621670653.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:35:15] [INFO ] Decomposing Gal with order
[2024-05-28 18:35:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:35:15] [INFO ] Removed a total of 735 redundant transitions.
[2024-05-28 18:35:15] [INFO ] Flatten gal took : 145 ms
[2024-05-28 18:35:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 148 labels/synchronizations in 15 ms.
[2024-05-28 18:35:15] [INFO ] Time to serialize gal into /tmp/CTLFireability910689163345094067.gal : 20 ms
[2024-05-28 18:35:15] [INFO ] Time to serialize properties into /tmp/CTLFireability6886031510172057558.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/CTLFireability910689163345094067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6886031510172057558.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 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 500 transition count 1738
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 464 transition count 1738
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 72 place count 464 transition count 1682
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 184 place count 408 transition count 1682
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 272 place count 364 transition count 1638
Applied a total of 272 rules in 79 ms. Remains 364 /506 variables (removed 142) and now considering 1638/1774 (removed 136) transitions.
Running 1632 sub problems to find dead transitions.
[2024-05-28 18:35:45] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
// Phase 1: matrix 1614 rows 364 cols
[2024-05-28 18:35:45] [INFO ] Computed 48 invariants in 30 ms
[2024-05-28 18:35:45] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 18:36:17] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
[2024-05-28 18:36:17] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2024-05-28 18:36:18] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 1 ms to minimize.
[2024-05-28 18:36:19] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2024-05-28 18:36:19] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 2 ms to minimize.
[2024-05-28 18:36:19] [INFO ] Deduced a trap composed of 39 places in 201 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/1978 variables, and 47 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20062 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 21/27 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1632/1632 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1632 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
[2024-05-28 18:36:26] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2024-05-28 18:36:26] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-28 18:36:28] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-05-28 18:36:30] [INFO ] Deduced a trap composed of 98 places in 215 ms of which 1 ms to minimize.
[2024-05-28 18:36:37] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1632 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 358/1978 variables, and 52 constraints, problems are : Problem set: 0 solved, 1632 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 20/21 constraints, Generalized P Invariants (flows): 21/27 constraints, State Equation: 0/364 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1632 constraints, Known Traps: 11/11 constraints]
After SMT, in 58289ms problems are : Problem set: 0 solved, 1632 unsolved
Search for dead transitions found 0 dead transitions in 58305ms
[2024-05-28 18:36:44] [INFO ] Flow matrix only has 1614 transitions (discarded 24 similar events)
[2024-05-28 18:36:44] [INFO ] Invariant cache hit.
[2024-05-28 18:36:44] [INFO ] Implicit Places using invariants in 348 ms returned [18, 72, 150, 303]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 357 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 360/506 places, 1638/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1634
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1634
Applied a total of 8 rules in 34 ms. Remains 356 /360 variables (removed 4) and now considering 1634/1638 (removed 4) transitions.
[2024-05-28 18:36:44] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
// Phase 1: matrix 1610 rows 356 cols
[2024-05-28 18:36:44] [INFO ] Computed 44 invariants in 17 ms
[2024-05-28 18:36:45] [INFO ] Implicit Places using invariants in 450 ms returned []
[2024-05-28 18:36:45] [INFO ] Flow matrix only has 1610 transitions (discarded 24 similar events)
[2024-05-28 18:36:45] [INFO ] Invariant cache hit.
[2024-05-28 18:36:45] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:36:58] [INFO ] Implicit Places using invariants and state equation in 13422 ms returned []
Implicit Place search using SMT with State Equation took 13874 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 356/506 places, 1634/1774 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 72652 ms. Remains : 356/506 places, 1634/1774 transitions.
[2024-05-28 18:36:58] [INFO ] Flatten gal took : 104 ms
[2024-05-28 18:36:58] [INFO ] Flatten gal took : 85 ms
[2024-05-28 18:36:58] [INFO ] Input system was already deterministic with 1634 transitions.
[2024-05-28 18:36:59] [INFO ] Flatten gal took : 91 ms
[2024-05-28 18:36:59] [INFO ] Flatten gal took : 77 ms
[2024-05-28 18:36:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2514865621651572983.gal : 9 ms
[2024-05-28 18:36:59] [INFO ] Time to serialize properties into /tmp/CTLFireability2035573491770534923.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2514865621651572983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2035573491770534923.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 18:37:29] [INFO ] Flatten gal took : 117 ms
[2024-05-28 18:37:29] [INFO ] Applying decomposition
[2024-05-28 18:37:29] [INFO ] Flatten gal took : 87 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/graph14814908358082774274.txt' '-o' '/tmp/graph14814908358082774274.bin' '-w' '/tmp/graph14814908358082774274.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14814908358082774274.bin' '-l' '-1' '-v' '-w' '/tmp/graph14814908358082774274.weights' '-q' '0' '-e' '0.001'
[2024-05-28 18:37:29] [INFO ] Decomposing Gal with order
[2024-05-28 18:37:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 18:37:29] [INFO ] Removed a total of 895 redundant transitions.
[2024-05-28 18:37:29] [INFO ] Flatten gal took : 137 ms
[2024-05-28 18:37:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 441 labels/synchronizations in 13 ms.
[2024-05-28 18:37:29] [INFO ] Time to serialize gal into /tmp/CTLFireability13374967254465928366.gal : 15 ms
[2024-05-28 18:37:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16675977963953121021.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13374967254465928366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16675977963953121021.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 -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 502 transition count 1770
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 502 transition count 1770
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 498 transition count 1766
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 498 transition count 1766
Applied a total of 16 rules in 65 ms. Remains 498 /506 variables (removed 8) and now considering 1766/1774 (removed 8) transitions.
Running 1760 sub problems to find dead transitions.
[2024-05-28 18:38:00] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
// Phase 1: matrix 1742 rows 498 cols
[2024-05-28 18:38:00] [INFO ] Computed 54 invariants in 35 ms
[2024-05-28 18:38:00] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:38:28] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-28 18:38:28] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 3 ms to minimize.
[2024-05-28 18:38:31] [INFO ] Deduced a trap composed of 190 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2240 variables, and 40 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/498 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:38:44] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 3 ms to minimize.
[2024-05-28 18:38:44] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 1 ms to minimize.
[2024-05-28 18:38:44] [INFO ] Deduced a trap composed of 91 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2240 variables, and 43 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/498 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 6/6 constraints]
After SMT, in 57546ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 57570ms
[2024-05-28 18:38:57] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:38:57] [INFO ] Invariant cache hit.
[2024-05-28 18:38:58] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-28 18:38:58] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:38:58] [INFO ] Invariant cache hit.
[2024-05-28 18:38:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 18:39:18] [INFO ] Implicit Places using invariants and state equation in 20119 ms returned []
Implicit Place search using SMT with State Equation took 20709 ms to find 0 implicit places.
Running 1760 sub problems to find dead transitions.
[2024-05-28 18:39:18] [INFO ] Flow matrix only has 1742 transitions (discarded 24 similar events)
[2024-05-28 18:39:18] [INFO ] Invariant cache hit.
[2024-05-28 18:39:18] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:39:49] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-28 18:39:51] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 3 ms to minimize.
[2024-05-28 18:39:59] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 3.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 4.0)
(s39 1.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s68 2.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 2.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 2.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 2.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 4.0)
(s174 1.0)
(s175 4.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 4.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 2.0)
(s187 0.0)
(s188 1.0)
(s189 1.0)
(s190 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 2.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 4.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 4.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 2.0)
(s260 4.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 10.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 2.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 4.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s324 0.0)
(s325 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 1.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 1.0)
(s352 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/2240 variables, and 40 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/498 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1760/1760 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1760 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:40:15] [INFO ] Deduced a trap composed of 91 places in 375 ms of which 3 ms to minimize.
[2024-05-28 18:40:15] [INFO ] Deduced a trap composed of 27 places in 494 ms of which 3 ms to minimize.
[2024-05-28 18:40:15] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-28 18:40:16] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 2 ms to minimize.
[2024-05-28 18:40:17] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 3 ms to minimize.
[2024-05-28 18:40:17] [INFO ] Deduced a trap composed of 30 places in 353 ms of which 3 ms to minimize.
[2024-05-28 18:40:17] [INFO ] Deduced a trap composed of 92 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1760 unsolved
[2024-05-28 18:40:29] [INFO ] Deduced a trap composed of 92 places in 90 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 1)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 4)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s68 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 1)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 5)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 1)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/2240 variables, and 48 constraints, problems are : Problem set: 0 solved, 1760 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 19/32 constraints, State Equation: 0/498 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1760 constraints, Known Traps: 11/11 constraints]
After SMT, in 78462ms problems are : Problem set: 0 solved, 1760 unsolved
Search for dead transitions found 0 dead transitions in 78485ms
Starting structural reductions in LTL mode, iteration 1 : 498/506 places, 1766/1774 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156842 ms. Remains : 498/506 places, 1766/1774 transitions.
[2024-05-28 18:40:36] [INFO ] Flatten gal took : 62 ms
[2024-05-28 18:40:36] [INFO ] Flatten gal took : 68 ms
[2024-05-28 18:40:37] [INFO ] Input system was already deterministic with 1766 transitions.
[2024-05-28 18:40:37] [INFO ] Flatten gal took : 62 ms
[2024-05-28 18:40:37] [INFO ] Flatten gal took : 64 ms
[2024-05-28 18:40:37] [INFO ] Time to serialize gal into /tmp/CTLFireability3202434014503020692.gal : 12 ms
[2024-05-28 18:40:37] [INFO ] Time to serialize properties into /tmp/CTLFireability14012342283875499262.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/CTLFireability3202434014503020692.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14012342283875499262.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 1716921653294

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

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