About the Execution of ITS-Tools for ShieldIIPt-PT-050B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16246.768 | 3600000.00 | 2636746.00 | 520037.50 | ??????????????TT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r216-tall-162098205200490.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205200490
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 12:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 12:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 18:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 18:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 860K May 5 16:52 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 ShieldIIPt-PT-050B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-050B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621112850473
Running Version 0
[2021-05-15 21:07:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-15 21:07:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 21:07:39] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2021-05-15 21:07:39] [INFO ] Transformed 3503 places.
[2021-05-15 21:07:39] [INFO ] Transformed 3253 transitions.
[2021-05-15 21:07:39] [INFO ] Found NUPN structural information;
[2021-05-15 21:07:39] [INFO ] Parsed PT model containing 3503 places and 3253 transitions in 524 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 848 out of 3503 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Discarding 354 places :
Symmetric choice reduction at 0 with 354 rule applications. Total rules 354 place count 3149 transition count 2899
Iterating global reduction 0 with 354 rules applied. Total rules applied 708 place count 3149 transition count 2899
Applied a total of 708 rules in 686 ms. Remains 3149 /3503 variables (removed 354) and now considering 2899/3253 (removed 354) transitions.
// Phase 1: matrix 2899 rows 3149 cols
[2021-05-15 21:07:40] [INFO ] Computed 451 place invariants in 49 ms
[2021-05-15 21:07:41] [INFO ] Implicit Places using invariants in 1048 ms returned []
// Phase 1: matrix 2899 rows 3149 cols
[2021-05-15 21:07:41] [INFO ] Computed 451 place invariants in 15 ms
[2021-05-15 21:07:44] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 3812 ms to find 0 implicit places.
// Phase 1: matrix 2899 rows 3149 cols
[2021-05-15 21:07:44] [INFO ] Computed 451 place invariants in 11 ms
[2021-05-15 21:07:46] [INFO ] Dead Transitions using invariants and state equation in 1891 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3149/3503 places, 2899/3253 transitions.
[2021-05-15 21:07:46] [INFO ] Flatten gal took : 214 ms
[2021-05-15 21:07:47] [INFO ] Flatten gal took : 133 ms
[2021-05-15 21:07:47] [INFO ] Input system was already deterministic with 2899 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1398 ms. (steps per millisecond=71 ) properties (out of 105) seen :94
Running SMT prover for 11 properties.
// Phase 1: matrix 2899 rows 3149 cols
[2021-05-15 21:07:48] [INFO ] Computed 451 place invariants in 10 ms
[2021-05-15 21:07:49] [INFO ] [Real]Absence check using 451 positive place invariants in 181 ms returned sat
[2021-05-15 21:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:07:53] [INFO ] [Real]Absence check using state equation in 3679 ms returned sat
[2021-05-15 21:07:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:07:53] [INFO ] [Nat]Absence check using 451 positive place invariants in 174 ms returned sat
[2021-05-15 21:07:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:07:55] [INFO ] [Nat]Absence check using state equation in 2226 ms returned sat
[2021-05-15 21:07:56] [INFO ] Deduced a trap composed of 41 places in 893 ms of which 31 ms to minimize.
[2021-05-15 21:07:58] [INFO ] Deduced a trap composed of 14 places in 903 ms of which 8 ms to minimize.
[2021-05-15 21:07:58] [INFO ] Deduced a trap composed of 19 places in 748 ms of which 4 ms to minimize.
[2021-05-15 21:07:59] [INFO ] Deduced a trap composed of 18 places in 780 ms of which 11 ms to minimize.
[2021-05-15 21:08:00] [INFO ] Deduced a trap composed of 18 places in 755 ms of which 2 ms to minimize.
[2021-05-15 21:08:01] [INFO ] Deduced a trap composed of 15 places in 766 ms of which 14 ms to minimize.
[2021-05-15 21:08:02] [INFO ] Deduced a trap composed of 17 places in 753 ms of which 2 ms to minimize.
[2021-05-15 21:08:05] [INFO ] Deduced a trap composed of 18 places in 2643 ms of which 2 ms to minimize.
[2021-05-15 21:08:05] [INFO ] Deduced a trap composed of 25 places in 700 ms of which 1 ms to minimize.
[2021-05-15 21:08:06] [INFO ] Deduced a trap composed of 25 places in 682 ms of which 2 ms to minimize.
[2021-05-15 21:08:07] [INFO ] Deduced a trap composed of 24 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:08:08] [INFO ] Deduced a trap composed of 29 places in 683 ms of which 2 ms to minimize.
[2021-05-15 21:08:09] [INFO ] Deduced a trap composed of 30 places in 670 ms of which 2 ms to minimize.
[2021-05-15 21:08:09] [INFO ] Deduced a trap composed of 23 places in 662 ms of which 2 ms to minimize.
[2021-05-15 21:08:10] [INFO ] Deduced a trap composed of 20 places in 700 ms of which 1 ms to minimize.
[2021-05-15 21:08:11] [INFO ] Deduced a trap composed of 22 places in 652 ms of which 1 ms to minimize.
[2021-05-15 21:08:12] [INFO ] Deduced a trap composed of 30 places in 637 ms of which 1 ms to minimize.
[2021-05-15 21:08:12] [INFO ] Deduced a trap composed of 17 places in 646 ms of which 1 ms to minimize.
[2021-05-15 21:08:13] [INFO ] Deduced a trap composed of 22 places in 646 ms of which 1 ms to minimize.
[2021-05-15 21:08:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2021-05-15 21:08:14] [INFO ] [Real]Absence check using 451 positive place invariants in 166 ms returned sat
[2021-05-15 21:08:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:08:15] [INFO ] [Real]Absence check using state equation in 1296 ms returned sat
[2021-05-15 21:08:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:08:19] [INFO ] [Real]Absence check using 451 positive place invariants in 191 ms returned sat
[2021-05-15 21:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:08:21] [INFO ] [Real]Absence check using state equation in 1329 ms returned sat
[2021-05-15 21:08:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:08:21] [INFO ] [Nat]Absence check using 451 positive place invariants in 159 ms returned sat
[2021-05-15 21:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:08:22] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2021-05-15 21:08:23] [INFO ] Deduced a trap composed of 30 places in 770 ms of which 2 ms to minimize.
[2021-05-15 21:08:24] [INFO ] Deduced a trap composed of 23 places in 765 ms of which 2 ms to minimize.
[2021-05-15 21:08:25] [INFO ] Deduced a trap composed of 19 places in 728 ms of which 2 ms to minimize.
[2021-05-15 21:08:26] [INFO ] Deduced a trap composed of 19 places in 732 ms of which 2 ms to minimize.
[2021-05-15 21:08:27] [INFO ] Deduced a trap composed of 23 places in 731 ms of which 2 ms to minimize.
[2021-05-15 21:08:28] [INFO ] Deduced a trap composed of 27 places in 752 ms of which 2 ms to minimize.
[2021-05-15 21:08:28] [INFO ] Deduced a trap composed of 22 places in 720 ms of which 2 ms to minimize.
[2021-05-15 21:08:29] [INFO ] Deduced a trap composed of 31 places in 711 ms of which 2 ms to minimize.
[2021-05-15 21:08:30] [INFO ] Deduced a trap composed of 17 places in 710 ms of which 1 ms to minimize.
[2021-05-15 21:08:31] [INFO ] Deduced a trap composed of 25 places in 739 ms of which 2 ms to minimize.
[2021-05-15 21:08:32] [INFO ] Deduced a trap composed of 29 places in 709 ms of which 2 ms to minimize.
[2021-05-15 21:08:32] [INFO ] Deduced a trap composed of 30 places in 683 ms of which 1 ms to minimize.
[2021-05-15 21:08:33] [INFO ] Deduced a trap composed of 22 places in 687 ms of which 1 ms to minimize.
[2021-05-15 21:08:34] [INFO ] Deduced a trap composed of 29 places in 707 ms of which 2 ms to minimize.
[2021-05-15 21:08:35] [INFO ] Deduced a trap composed of 30 places in 663 ms of which 5 ms to minimize.
[2021-05-15 21:08:35] [INFO ] Deduced a trap composed of 24 places in 645 ms of which 2 ms to minimize.
[2021-05-15 21:08:36] [INFO ] Deduced a trap composed of 28 places in 622 ms of which 2 ms to minimize.
[2021-05-15 21:08:37] [INFO ] Deduced a trap composed of 33 places in 659 ms of which 2 ms to minimize.
[2021-05-15 21:08:38] [INFO ] Deduced a trap composed of 40 places in 641 ms of which 2 ms to minimize.
[2021-05-15 21:08:38] [INFO ] Deduced a trap composed of 27 places in 629 ms of which 2 ms to minimize.
[2021-05-15 21:08:39] [INFO ] Deduced a trap composed of 40 places in 617 ms of which 1 ms to minimize.
[2021-05-15 21:08:40] [INFO ] Deduced a trap composed of 31 places in 612 ms of which 2 ms to minimize.
[2021-05-15 21:08:40] [INFO ] Deduced a trap composed of 22 places in 609 ms of which 1 ms to minimize.
[2021-05-15 21:08:41] [INFO ] Deduced a trap composed of 18 places in 602 ms of which 2 ms to minimize.
[2021-05-15 21:08:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 21:08:42] [INFO ] [Real]Absence check using 451 positive place invariants in 155 ms returned sat
[2021-05-15 21:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:08:43] [INFO ] [Real]Absence check using state equation in 1305 ms returned sat
[2021-05-15 21:08:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:08:44] [INFO ] [Nat]Absence check using 451 positive place invariants in 154 ms returned sat
[2021-05-15 21:08:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:08:45] [INFO ] [Nat]Absence check using state equation in 1326 ms returned sat
[2021-05-15 21:08:46] [INFO ] Deduced a trap composed of 21 places in 762 ms of which 2 ms to minimize.
[2021-05-15 21:08:47] [INFO ] Deduced a trap composed of 17 places in 769 ms of which 1 ms to minimize.
[2021-05-15 21:08:47] [INFO ] Deduced a trap composed of 19 places in 753 ms of which 1 ms to minimize.
[2021-05-15 21:08:48] [INFO ] Deduced a trap composed of 14 places in 760 ms of which 1 ms to minimize.
[2021-05-15 21:08:49] [INFO ] Deduced a trap composed of 20 places in 751 ms of which 1 ms to minimize.
[2021-05-15 21:08:50] [INFO ] Deduced a trap composed of 25 places in 734 ms of which 2 ms to minimize.
[2021-05-15 21:08:51] [INFO ] Deduced a trap composed of 24 places in 741 ms of which 2 ms to minimize.
[2021-05-15 21:08:52] [INFO ] Deduced a trap composed of 26 places in 745 ms of which 2 ms to minimize.
[2021-05-15 21:08:52] [INFO ] Deduced a trap composed of 23 places in 732 ms of which 2 ms to minimize.
[2021-05-15 21:08:53] [INFO ] Deduced a trap composed of 17 places in 723 ms of which 1 ms to minimize.
[2021-05-15 21:08:54] [INFO ] Deduced a trap composed of 24 places in 698 ms of which 1 ms to minimize.
[2021-05-15 21:08:55] [INFO ] Deduced a trap composed of 22 places in 662 ms of which 2 ms to minimize.
[2021-05-15 21:08:56] [INFO ] Deduced a trap composed of 24 places in 684 ms of which 4 ms to minimize.
[2021-05-15 21:08:56] [INFO ] Deduced a trap composed of 30 places in 672 ms of which 2 ms to minimize.
[2021-05-15 21:08:57] [INFO ] Deduced a trap composed of 28 places in 667 ms of which 1 ms to minimize.
[2021-05-15 21:08:58] [INFO ] Deduced a trap composed of 29 places in 618 ms of which 1 ms to minimize.
[2021-05-15 21:08:59] [INFO ] Deduced a trap composed of 26 places in 665 ms of which 2 ms to minimize.
[2021-05-15 21:08:59] [INFO ] Deduced a trap composed of 32 places in 654 ms of which 1 ms to minimize.
[2021-05-15 21:09:00] [INFO ] Deduced a trap composed of 38 places in 639 ms of which 2 ms to minimize.
[2021-05-15 21:09:01] [INFO ] Deduced a trap composed of 35 places in 636 ms of which 1 ms to minimize.
[2021-05-15 21:09:02] [INFO ] Deduced a trap composed of 33 places in 639 ms of which 1 ms to minimize.
[2021-05-15 21:09:02] [INFO ] Deduced a trap composed of 36 places in 628 ms of which 1 ms to minimize.
[2021-05-15 21:09:03] [INFO ] Deduced a trap composed of 40 places in 616 ms of which 1 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-15 21:09:04] [INFO ] Deduced a trap composed of 30 places in 626 ms of which 3 ms to minimize.
[2021-05-15 21:09:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 21:09:04] [INFO ] [Real]Absence check using 451 positive place invariants in 164 ms returned sat
[2021-05-15 21:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:06] [INFO ] [Real]Absence check using state equation in 1479 ms returned sat
[2021-05-15 21:09:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:09:06] [INFO ] [Nat]Absence check using 451 positive place invariants in 166 ms returned sat
[2021-05-15 21:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:08] [INFO ] [Nat]Absence check using state equation in 1449 ms returned sat
[2021-05-15 21:09:09] [INFO ] Deduced a trap composed of 25 places in 723 ms of which 10 ms to minimize.
[2021-05-15 21:09:09] [INFO ] Deduced a trap composed of 29 places in 712 ms of which 2 ms to minimize.
[2021-05-15 21:09:10] [INFO ] Deduced a trap composed of 28 places in 717 ms of which 2 ms to minimize.
[2021-05-15 21:09:11] [INFO ] Deduced a trap composed of 22 places in 702 ms of which 2 ms to minimize.
[2021-05-15 21:09:12] [INFO ] Deduced a trap composed of 42 places in 705 ms of which 2 ms to minimize.
[2021-05-15 21:09:13] [INFO ] Deduced a trap composed of 24 places in 692 ms of which 2 ms to minimize.
[2021-05-15 21:09:13] [INFO ] Deduced a trap composed of 30 places in 709 ms of which 2 ms to minimize.
[2021-05-15 21:09:14] [INFO ] Deduced a trap composed of 20 places in 743 ms of which 2 ms to minimize.
[2021-05-15 21:09:15] [INFO ] Deduced a trap composed of 14 places in 666 ms of which 2 ms to minimize.
[2021-05-15 21:09:16] [INFO ] Deduced a trap composed of 29 places in 758 ms of which 1 ms to minimize.
[2021-05-15 21:09:17] [INFO ] Deduced a trap composed of 26 places in 691 ms of which 1 ms to minimize.
[2021-05-15 21:09:17] [INFO ] Deduced a trap composed of 26 places in 642 ms of which 1 ms to minimize.
[2021-05-15 21:09:18] [INFO ] Deduced a trap composed of 29 places in 637 ms of which 2 ms to minimize.
[2021-05-15 21:09:19] [INFO ] Deduced a trap composed of 30 places in 625 ms of which 1 ms to minimize.
[2021-05-15 21:09:20] [INFO ] Deduced a trap composed of 21 places in 633 ms of which 1 ms to minimize.
[2021-05-15 21:09:20] [INFO ] Deduced a trap composed of 25 places in 625 ms of which 2 ms to minimize.
[2021-05-15 21:09:21] [INFO ] Deduced a trap composed of 25 places in 601 ms of which 1 ms to minimize.
[2021-05-15 21:09:22] [INFO ] Deduced a trap composed of 28 places in 602 ms of which 1 ms to minimize.
[2021-05-15 21:09:22] [INFO ] Deduced a trap composed of 24 places in 588 ms of which 1 ms to minimize.
[2021-05-15 21:09:23] [INFO ] Deduced a trap composed of 35 places in 563 ms of which 1 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 33 places in 560 ms of which 2 ms to minimize.
[2021-05-15 21:09:24] [INFO ] Deduced a trap composed of 46 places in 553 ms of which 2 ms to minimize.
[2021-05-15 21:09:25] [INFO ] Deduced a trap composed of 38 places in 562 ms of which 1 ms to minimize.
[2021-05-15 21:09:26] [INFO ] Deduced a trap composed of 38 places in 542 ms of which 1 ms to minimize.
[2021-05-15 21:09:26] [INFO ] Deduced a trap composed of 40 places in 537 ms of which 1 ms to minimize.
[2021-05-15 21:09:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 21:09:27] [INFO ] [Real]Absence check using 451 positive place invariants in 176 ms returned sat
[2021-05-15 21:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:28] [INFO ] [Real]Absence check using state equation in 1770 ms returned sat
[2021-05-15 21:09:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:09:29] [INFO ] [Nat]Absence check using 451 positive place invariants in 185 ms returned sat
[2021-05-15 21:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:33] [INFO ] [Nat]Absence check using state equation in 3523 ms returned sat
[2021-05-15 21:09:33] [INFO ] Deduced a trap composed of 15 places in 736 ms of which 1 ms to minimize.
[2021-05-15 21:09:34] [INFO ] Deduced a trap composed of 24 places in 728 ms of which 1 ms to minimize.
[2021-05-15 21:09:35] [INFO ] Deduced a trap composed of 32 places in 730 ms of which 1 ms to minimize.
[2021-05-15 21:09:36] [INFO ] Deduced a trap composed of 25 places in 700 ms of which 1 ms to minimize.
[2021-05-15 21:09:37] [INFO ] Deduced a trap composed of 25 places in 704 ms of which 2 ms to minimize.
[2021-05-15 21:09:37] [INFO ] Deduced a trap composed of 19 places in 704 ms of which 1 ms to minimize.
[2021-05-15 21:09:38] [INFO ] Deduced a trap composed of 18 places in 699 ms of which 2 ms to minimize.
[2021-05-15 21:09:39] [INFO ] Deduced a trap composed of 19 places in 679 ms of which 2 ms to minimize.
[2021-05-15 21:09:40] [INFO ] Deduced a trap composed of 19 places in 669 ms of which 1 ms to minimize.
[2021-05-15 21:09:41] [INFO ] Deduced a trap composed of 27 places in 670 ms of which 1 ms to minimize.
[2021-05-15 21:09:41] [INFO ] Deduced a trap composed of 33 places in 720 ms of which 2 ms to minimize.
[2021-05-15 21:09:42] [INFO ] Deduced a trap composed of 23 places in 659 ms of which 2 ms to minimize.
[2021-05-15 21:09:43] [INFO ] Deduced a trap composed of 22 places in 649 ms of which 1 ms to minimize.
[2021-05-15 21:09:44] [INFO ] Deduced a trap composed of 39 places in 644 ms of which 1 ms to minimize.
[2021-05-15 21:09:44] [INFO ] Deduced a trap composed of 33 places in 632 ms of which 3 ms to minimize.
[2021-05-15 21:09:45] [INFO ] Deduced a trap composed of 28 places in 623 ms of which 2 ms to minimize.
[2021-05-15 21:09:46] [INFO ] Deduced a trap composed of 40 places in 611 ms of which 2 ms to minimize.
[2021-05-15 21:09:48] [INFO ] Deduced a trap composed of 38 places in 621 ms of which 3 ms to minimize.
[2021-05-15 21:09:49] [INFO ] Deduced a trap composed of 30 places in 625 ms of which 1 ms to minimize.
[2021-05-15 21:09:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 21:09:50] [INFO ] [Real]Absence check using 451 positive place invariants in 164 ms returned sat
[2021-05-15 21:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:51] [INFO ] [Real]Absence check using state equation in 1420 ms returned sat
[2021-05-15 21:09:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:09:51] [INFO ] [Nat]Absence check using 451 positive place invariants in 162 ms returned sat
[2021-05-15 21:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:09:53] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2021-05-15 21:09:54] [INFO ] Deduced a trap composed of 18 places in 756 ms of which 2 ms to minimize.
[2021-05-15 21:09:55] [INFO ] Deduced a trap composed of 16 places in 726 ms of which 2 ms to minimize.
[2021-05-15 21:09:55] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 1 ms to minimize.
[2021-05-15 21:09:56] [INFO ] Deduced a trap composed of 18 places in 705 ms of which 1 ms to minimize.
[2021-05-15 21:09:57] [INFO ] Deduced a trap composed of 26 places in 698 ms of which 2 ms to minimize.
[2021-05-15 21:09:58] [INFO ] Deduced a trap composed of 27 places in 690 ms of which 1 ms to minimize.
[2021-05-15 21:09:59] [INFO ] Deduced a trap composed of 19 places in 676 ms of which 2 ms to minimize.
[2021-05-15 21:09:59] [INFO ] Deduced a trap composed of 17 places in 672 ms of which 2 ms to minimize.
[2021-05-15 21:10:00] [INFO ] Deduced a trap composed of 23 places in 659 ms of which 2 ms to minimize.
[2021-05-15 21:10:01] [INFO ] Deduced a trap composed of 30 places in 637 ms of which 1 ms to minimize.
[2021-05-15 21:10:02] [INFO ] Deduced a trap composed of 29 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:10:02] [INFO ] Deduced a trap composed of 33 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:10:03] [INFO ] Deduced a trap composed of 22 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:10:04] [INFO ] Deduced a trap composed of 39 places in 666 ms of which 2 ms to minimize.
[2021-05-15 21:10:05] [INFO ] Deduced a trap composed of 36 places in 670 ms of which 2 ms to minimize.
[2021-05-15 21:10:05] [INFO ] Deduced a trap composed of 40 places in 652 ms of which 2 ms to minimize.
[2021-05-15 21:10:06] [INFO ] Deduced a trap composed of 28 places in 656 ms of which 2 ms to minimize.
[2021-05-15 21:10:07] [INFO ] Deduced a trap composed of 32 places in 645 ms of which 1 ms to minimize.
[2021-05-15 21:10:08] [INFO ] Deduced a trap composed of 35 places in 641 ms of which 2 ms to minimize.
[2021-05-15 21:10:08] [INFO ] Deduced a trap composed of 35 places in 653 ms of which 1 ms to minimize.
[2021-05-15 21:10:09] [INFO ] Deduced a trap composed of 28 places in 631 ms of which 1 ms to minimize.
[2021-05-15 21:10:10] [INFO ] Deduced a trap composed of 32 places in 625 ms of which 1 ms to minimize.
[2021-05-15 21:10:10] [INFO ] Deduced a trap composed of 33 places in 577 ms of which 1 ms to minimize.
[2021-05-15 21:10:11] [INFO ] Deduced a trap composed of 41 places in 590 ms of which 1 ms to minimize.
[2021-05-15 21:10:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2021-05-15 21:10:12] [INFO ] [Real]Absence check using 451 positive place invariants in 167 ms returned sat
[2021-05-15 21:10:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:10:13] [INFO ] [Real]Absence check using state equation in 1586 ms returned sat
[2021-05-15 21:10:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:10:14] [INFO ] [Nat]Absence check using 451 positive place invariants in 170 ms returned sat
[2021-05-15 21:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:10:15] [INFO ] [Nat]Absence check using state equation in 1652 ms returned sat
[2021-05-15 21:10:16] [INFO ] Deduced a trap composed of 31 places in 747 ms of which 2 ms to minimize.
[2021-05-15 21:10:17] [INFO ] Deduced a trap composed of 26 places in 737 ms of which 2 ms to minimize.
[2021-05-15 21:10:18] [INFO ] Deduced a trap composed of 23 places in 723 ms of which 1 ms to minimize.
[2021-05-15 21:10:19] [INFO ] Deduced a trap composed of 42 places in 708 ms of which 1 ms to minimize.
[2021-05-15 21:10:20] [INFO ] Deduced a trap composed of 25 places in 710 ms of which 1 ms to minimize.
[2021-05-15 21:10:20] [INFO ] Deduced a trap composed of 14 places in 708 ms of which 1 ms to minimize.
[2021-05-15 21:10:21] [INFO ] Deduced a trap composed of 20 places in 699 ms of which 2 ms to minimize.
[2021-05-15 21:10:22] [INFO ] Deduced a trap composed of 15 places in 700 ms of which 2 ms to minimize.
[2021-05-15 21:10:23] [INFO ] Deduced a trap composed of 22 places in 697 ms of which 2 ms to minimize.
[2021-05-15 21:10:24] [INFO ] Deduced a trap composed of 25 places in 684 ms of which 2 ms to minimize.
[2021-05-15 21:10:24] [INFO ] Deduced a trap composed of 25 places in 676 ms of which 2 ms to minimize.
[2021-05-15 21:10:25] [INFO ] Deduced a trap composed of 22 places in 683 ms of which 1 ms to minimize.
[2021-05-15 21:10:26] [INFO ] Deduced a trap composed of 18 places in 666 ms of which 2 ms to minimize.
[2021-05-15 21:10:27] [INFO ] Deduced a trap composed of 22 places in 652 ms of which 1 ms to minimize.
[2021-05-15 21:10:27] [INFO ] Deduced a trap composed of 26 places in 635 ms of which 1 ms to minimize.
[2021-05-15 21:10:28] [INFO ] Deduced a trap composed of 24 places in 632 ms of which 1 ms to minimize.
[2021-05-15 21:10:29] [INFO ] Deduced a trap composed of 30 places in 617 ms of which 2 ms to minimize.
[2021-05-15 21:10:29] [INFO ] Deduced a trap composed of 31 places in 610 ms of which 1 ms to minimize.
[2021-05-15 21:10:30] [INFO ] Deduced a trap composed of 38 places in 610 ms of which 1 ms to minimize.
[2021-05-15 21:10:31] [INFO ] Deduced a trap composed of 28 places in 606 ms of which 1 ms to minimize.
[2021-05-15 21:10:32] [INFO ] Deduced a trap composed of 19 places in 608 ms of which 1 ms to minimize.
[2021-05-15 21:10:32] [INFO ] Deduced a trap composed of 26 places in 586 ms of which 1 ms to minimize.
[2021-05-15 21:10:33] [INFO ] Deduced a trap composed of 30 places in 582 ms of which 2 ms to minimize.
[2021-05-15 21:10:34] [INFO ] Deduced a trap composed of 30 places in 568 ms of which 2 ms to minimize.
[2021-05-15 21:10:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
[2021-05-15 21:10:34] [INFO ] [Real]Absence check using 451 positive place invariants in 164 ms returned sat
[2021-05-15 21:10:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:10:36] [INFO ] [Real]Absence check using state equation in 1444 ms returned sat
[2021-05-15 21:10:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:10:36] [INFO ] [Nat]Absence check using 451 positive place invariants in 161 ms returned sat
[2021-05-15 21:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:10:38] [INFO ] [Nat]Absence check using state equation in 1514 ms returned sat
[2021-05-15 21:10:38] [INFO ] Deduced a trap composed of 25 places in 791 ms of which 2 ms to minimize.
[2021-05-15 21:10:39] [INFO ] Deduced a trap composed of 18 places in 776 ms of which 2 ms to minimize.
[2021-05-15 21:10:40] [INFO ] Deduced a trap composed of 19 places in 768 ms of which 2 ms to minimize.
[2021-05-15 21:10:41] [INFO ] Deduced a trap composed of 17 places in 762 ms of which 2 ms to minimize.
[2021-05-15 21:10:42] [INFO ] Deduced a trap composed of 23 places in 757 ms of which 2 ms to minimize.
[2021-05-15 21:10:43] [INFO ] Deduced a trap composed of 24 places in 732 ms of which 2 ms to minimize.
[2021-05-15 21:10:44] [INFO ] Deduced a trap composed of 23 places in 729 ms of which 1 ms to minimize.
[2021-05-15 21:10:45] [INFO ] Deduced a trap composed of 18 places in 718 ms of which 2 ms to minimize.
[2021-05-15 21:10:45] [INFO ] Deduced a trap composed of 21 places in 711 ms of which 1 ms to minimize.
[2021-05-15 21:10:46] [INFO ] Deduced a trap composed of 28 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:10:47] [INFO ] Deduced a trap composed of 26 places in 687 ms of which 1 ms to minimize.
[2021-05-15 21:10:48] [INFO ] Deduced a trap composed of 35 places in 689 ms of which 1 ms to minimize.
[2021-05-15 21:10:48] [INFO ] Deduced a trap composed of 30 places in 666 ms of which 1 ms to minimize.
[2021-05-15 21:10:49] [INFO ] Deduced a trap composed of 32 places in 641 ms of which 2 ms to minimize.
[2021-05-15 21:10:50] [INFO ] Deduced a trap composed of 32 places in 637 ms of which 2 ms to minimize.
[2021-05-15 21:10:51] [INFO ] Deduced a trap composed of 29 places in 622 ms of which 2 ms to minimize.
[2021-05-15 21:10:51] [INFO ] Deduced a trap composed of 32 places in 645 ms of which 1 ms to minimize.
[2021-05-15 21:10:52] [INFO ] Deduced a trap composed of 25 places in 604 ms of which 1 ms to minimize.
[2021-05-15 21:10:53] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 1 ms to minimize.
[2021-05-15 21:10:53] [INFO ] Deduced a trap composed of 45 places in 590 ms of which 2 ms to minimize.
[2021-05-15 21:10:54] [INFO ] Deduced a trap composed of 33 places in 585 ms of which 2 ms to minimize.
[2021-05-15 21:10:55] [INFO ] Deduced a trap composed of 30 places in 573 ms of which 1 ms to minimize.
[2021-05-15 21:10:56] [INFO ] Deduced a trap composed of 24 places in 568 ms of which 2 ms to minimize.
[2021-05-15 21:10:56] [INFO ] Deduced a trap composed of 26 places in 549 ms of which 1 ms to minimize.
[2021-05-15 21:10:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
[2021-05-15 21:10:57] [INFO ] [Real]Absence check using 451 positive place invariants in 158 ms returned sat
[2021-05-15 21:10:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:10:58] [INFO ] [Real]Absence check using state equation in 1368 ms returned sat
[2021-05-15 21:10:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 21:10:59] [INFO ] [Nat]Absence check using 451 positive place invariants in 161 ms returned sat
[2021-05-15 21:10:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 21:11:00] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2021-05-15 21:11:01] [INFO ] Deduced a trap composed of 22 places in 765 ms of which 1 ms to minimize.
[2021-05-15 21:11:02] [INFO ] Deduced a trap composed of 24 places in 749 ms of which 2 ms to minimize.
[2021-05-15 21:11:02] [INFO ] Deduced a trap composed of 23 places in 737 ms of which 2 ms to minimize.
[2021-05-15 21:11:03] [INFO ] Deduced a trap composed of 16 places in 735 ms of which 2 ms to minimize.
[2021-05-15 21:11:04] [INFO ] Deduced a trap composed of 18 places in 731 ms of which 1 ms to minimize.
[2021-05-15 21:11:05] [INFO ] Deduced a trap composed of 17 places in 732 ms of which 1 ms to minimize.
[2021-05-15 21:11:06] [INFO ] Deduced a trap composed of 32 places in 707 ms of which 2 ms to minimize.
[2021-05-15 21:11:07] [INFO ] Deduced a trap composed of 31 places in 691 ms of which 1 ms to minimize.
[2021-05-15 21:11:07] [INFO ] Deduced a trap composed of 38 places in 679 ms of which 1 ms to minimize.
[2021-05-15 21:11:08] [INFO ] Deduced a trap composed of 19 places in 685 ms of which 2 ms to minimize.
[2021-05-15 21:11:09] [INFO ] Deduced a trap composed of 14 places in 669 ms of which 2 ms to minimize.
[2021-05-15 21:11:10] [INFO ] Deduced a trap composed of 28 places in 652 ms of which 1 ms to minimize.
[2021-05-15 21:11:10] [INFO ] Deduced a trap composed of 30 places in 648 ms of which 1 ms to minimize.
[2021-05-15 21:11:11] [INFO ] Deduced a trap composed of 27 places in 658 ms of which 1 ms to minimize.
[2021-05-15 21:11:12] [INFO ] Deduced a trap composed of 23 places in 624 ms of which 1 ms to minimize.
[2021-05-15 21:11:13] [INFO ] Deduced a trap composed of 30 places in 635 ms of which 2 ms to minimize.
[2021-05-15 21:11:13] [INFO ] Deduced a trap composed of 25 places in 605 ms of which 1 ms to minimize.
[2021-05-15 21:11:14] [INFO ] Deduced a trap composed of 33 places in 617 ms of which 1 ms to minimize.
[2021-05-15 21:11:15] [INFO ] Deduced a trap composed of 31 places in 599 ms of which 1 ms to minimize.
[2021-05-15 21:11:15] [INFO ] Deduced a trap composed of 31 places in 586 ms of which 1 ms to minimize.
[2021-05-15 21:11:16] [INFO ] Deduced a trap composed of 42 places in 590 ms of which 1 ms to minimize.
[2021-05-15 21:11:17] [INFO ] Deduced a trap composed of 38 places in 581 ms of which 1 ms to minimize.
[2021-05-15 21:11:17] [INFO ] Deduced a trap composed of 33 places in 555 ms of which 1 ms to minimize.
[2021-05-15 21:11:18] [INFO ] Deduced a trap composed of 41 places in 552 ms of which 2 ms to minimize.
[2021-05-15 21:11:19] [INFO ] Deduced a trap composed of 40 places in 546 ms of which 1 ms to minimize.
[2021-05-15 21:11:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
[2021-05-15 21:11:19] [INFO ] [Real]Absence check using 451 positive place invariants in 158 ms returned sat
[2021-05-15 21:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 21:11:20] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2021-05-15 21:11:21] [INFO ] Deduced a trap composed of 15 places in 769 ms of which 2 ms to minimize.
[2021-05-15 21:11:22] [INFO ] Deduced a trap composed of 14 places in 769 ms of which 1 ms to minimize.
[2021-05-15 21:11:23] [INFO ] Deduced a trap composed of 18 places in 766 ms of which 2 ms to minimize.
[2021-05-15 21:11:24] [INFO ] Deduced a trap composed of 25 places in 767 ms of which 1 ms to minimize.
[2021-05-15 21:11:25] [INFO ] Deduced a trap composed of 22 places in 749 ms of which 1 ms to minimize.
[2021-05-15 21:11:26] [INFO ] Deduced a trap composed of 22 places in 752 ms of which 1 ms to minimize.
[2021-05-15 21:11:26] [INFO ] Deduced a trap composed of 27 places in 753 ms of which 2 ms to minimize.
[2021-05-15 21:11:27] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 1 ms to minimize.
[2021-05-15 21:11:28] [INFO ] Deduced a trap composed of 24 places in 801 ms of which 2 ms to minimize.
[2021-05-15 21:11:29] [INFO ] Deduced a trap composed of 23 places in 789 ms of which 2 ms to minimize.
[2021-05-15 21:11:30] [INFO ] Deduced a trap composed of 43 places in 788 ms of which 2 ms to minimize.
[2021-05-15 21:11:31] [INFO ] Deduced a trap composed of 33 places in 769 ms of which 2 ms to minimize.
[2021-05-15 21:11:32] [INFO ] Deduced a trap composed of 26 places in 756 ms of which 2 ms to minimize.
[2021-05-15 21:11:33] [INFO ] Deduced a trap composed of 26 places in 761 ms of which 2 ms to minimize.
[2021-05-15 21:11:33] [INFO ] Deduced a trap composed of 42 places in 750 ms of which 2 ms to minimize.
[2021-05-15 21:11:34] [INFO ] Deduced a trap composed of 44 places in 739 ms of which 2 ms to minimize.
[2021-05-15 21:11:35] [INFO ] Deduced a trap composed of 39 places in 728 ms of which 2 ms to minimize.
[2021-05-15 21:11:36] [INFO ] Deduced a trap composed of 37 places in 716 ms of which 2 ms to minimize.
[2021-05-15 21:11:37] [INFO ] Deduced a trap composed of 39 places in 725 ms of which 2 ms to minimize.
[2021-05-15 21:11:38] [INFO ] Deduced a trap composed of 24 places in 726 ms of which 2 ms to minimize.
[2021-05-15 21:11:38] [INFO ] Deduced a trap composed of 27 places in 725 ms of which 2 ms to minimize.
[2021-05-15 21:11:39] [INFO ] Deduced a trap composed of 18 places in 686 ms of which 1 ms to minimize.
[2021-05-15 21:11:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 635 transitions
Trivial Post-agglo rules discarded 635 transitions
Performed 635 trivial Post agglomeration. Transition count delta: 635
Iterating post reduction 0 with 635 rules applied. Total rules applied 635 place count 3148 transition count 2263
Reduce places removed 635 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 638 rules applied. Total rules applied 1273 place count 2513 transition count 2260
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 1278 place count 2511 transition count 2257
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1281 place count 2508 transition count 2257
Performed 302 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 302 Pre rules applied. Total rules applied 1281 place count 2508 transition count 1955
Deduced a syphon composed of 302 places in 14 ms
Reduce places removed 302 places and 0 transitions.
Iterating global reduction 4 with 604 rules applied. Total rules applied 1885 place count 2206 transition count 1955
Discarding 138 places :
Symmetric choice reduction at 4 with 138 rule applications. Total rules 2023 place count 2068 transition count 1817
Iterating global reduction 4 with 138 rules applied. Total rules applied 2161 place count 2068 transition count 1817
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 102 Pre rules applied. Total rules applied 2161 place count 2068 transition count 1715
Deduced a syphon composed of 102 places in 4 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 2365 place count 1966 transition count 1715
Performed 848 Post agglomeration using F-continuation condition.Transition count delta: 848
Deduced a syphon composed of 848 places in 1 ms
Reduce places removed 848 places and 0 transitions.
Iterating global reduction 4 with 1696 rules applied. Total rules applied 4061 place count 1118 transition count 867
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4263 place count 1017 transition count 933
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 4349 place count 974 transition count 961
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4350 place count 973 transition count 960
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4352 place count 971 transition count 960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4352 place count 971 transition count 959
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4354 place count 970 transition count 959
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4355 place count 969 transition count 958
Applied a total of 4355 rules in 1139 ms. Remains 969 /3149 variables (removed 2180) and now considering 958/2899 (removed 1941) transitions.
[2021-05-15 21:11:49] [INFO ] Flatten gal took : 42 ms
[2021-05-15 21:11:49] [INFO ] Flatten gal took : 41 ms
[2021-05-15 21:11:49] [INFO ] Input system was already deterministic with 958 transitions.
[2021-05-15 21:11:49] [INFO ] Flatten gal took : 40 ms
[2021-05-15 21:11:49] [INFO ] Flatten gal took : 39 ms
[2021-05-15 21:11:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14857567574975141786.gal : 21 ms
[2021-05-15 21:11:49] [INFO ] Time to serialize properties into /tmp/CTLFireability1958323312569265054.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14857567574975141786.gal, -t, CGAL, -ctl, /tmp/CTLFireability1958323312569265054.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14857567574975141786.gal -t CGAL -ctl /tmp/CTLFireability1958323312569265054.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.4e+141,1.83532,48868,2,3107,5,192258,6,0,4832,248832,0
Converting to forward existential form...Done !
original formula: AF(AG((AF(((((((p3499==1)||(p2800==1))||(p981==1))||(p1010==1))||(p1148==1))||(p1118==1))) * ((((((p2628==1)||(p1708==1))||(p1576==1))||(p3295==1))||(p1560==1))||((p822==1)&&(p855==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(EG(!(((((((p3499==1)||(p2800==1))||(p981==1))||(p1010==1))||(p1148==1))||(p1118==1))))) * ((((((p2628==1)||(p1708==1))||(p1576==1))||(p3295==1))||(p1560==1))||((p822==1)&&(p855==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t51, t52, t53, t55, t57, t58, t171, t173, t185, t190, t193, t196, t199, t203, t207, t210, t214, t218, t222, t225, t227, t235, t237, t243, t248, t252, t255, t260, t263, t265, t269, t272, t275, t278, t282, t285, t289, t292, t295, t298, t301, t305, t310, t313, t317, t320, t324, t328, t332, t337, t342, t345, t349, t352, t355, t359, t362, t386, t392, t400, t402, t412, t416, t424, t428, t436, t440, t448, t452, t460, t464, t472, t476, t484, t488, t496, t500, t507, t511, t520, t524, t532, t536, t548, t552, t564, t568, t576, t580, t586, t592, t600, t604, t612, t616, t624, t628, t633, t634, t635, t636, t638, t645, t646, t647, t648, t652, t657, t658, t659, t660, t664, t669, t675, t684, t686, t694, t700, t708, t712, t720, t724, t732, t736, t743, t747, t756, t760, t768, t770, t780, t784, t792, t796, t804, t808, t816, t828, t832, t840, t842, t849, t850, t851, t852, t856, t864, t868, t876, t878, t888, t892, t900, t902, t912, t916, t933, t934, t935, t936, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/751/207/958
Detected timeout of ITS tools.
[2021-05-15 21:12:19] [INFO ] Flatten gal took : 40 ms
[2021-05-15 21:12:19] [INFO ] Applying decomposition
[2021-05-15 21:12:19] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph619157553688717052.txt, -o, /tmp/graph619157553688717052.bin, -w, /tmp/graph619157553688717052.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph619157553688717052.bin, -l, -1, -v, -w, /tmp/graph619157553688717052.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:12:20] [INFO ] Decomposing Gal with order
[2021-05-15 21:12:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:12:20] [INFO ] Removed a total of 1048 redundant transitions.
[2021-05-15 21:12:20] [INFO ] Flatten gal took : 156 ms
[2021-05-15 21:12:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 426 labels/synchronizations in 28 ms.
[2021-05-15 21:12:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7795302251774933962.gal : 15 ms
[2021-05-15 21:12:20] [INFO ] Time to serialize properties into /tmp/CTLFireability1115648083976659638.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7795302251774933962.gal, -t, CGAL, -ctl, /tmp/CTLFireability1115648083976659638.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7795302251774933962.gal -t CGAL -ctl /tmp/CTLFireability1115648083976659638.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.4e+141,2.79805,68104,508,39,121588,373,983,312770,80,1363,0
Converting to forward existential form...Done !
original formula: AF(AG((AF(((((((i27.u397.p3499==1)||(i21.u318.p2800==1))||(i7.u111.p981==1))||(i7.u112.p1010==1))||(i8.u126.p1148==1))||(i8.u125.p1118==1))) * ((((((i20.i0.i0.u300.p2628==1)||(i12.i1.i0.u191.p1708==1))||(i12.i0.i1.u175.p1576==1))||(i25.i1.i1.u375.p3295==1))||(i11.u174.p1560==1))||((i5.i1.i0.u89.p822==1)&&(i5.i1.i0.u95.p855==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(EG(!(((((((i27.u397.p3499==1)||(i21.u318.p2800==1))||(i7.u111.p981==1))||(i7.u112.p1010==1))||(i8.u126.p1148==1))||(i8.u125.p1118==1))))) * ((((((i20.i0.i0.u300.p2628==1)||(i12.i1.i0.u191.p1708==1))||(i12.i0.i1.u175.p1576==1))||(i25.i1.i1.u375.p3295==1))||(i11.u174.p1560==1))||((i5.i1.i0.u89.p822==1)&&(i5.i1.i0.u95.p855==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.t404, i0.t400, i0.t391, i0.t385, i0.t1, i0.t0, i0.u1.t185, i0.u9.t190, i1.i0.t2, i1.i0.t414, i1.i0.i0.t411, i1.i0.i0.u17.t193, i1.i1.t3, i1.i1.t421, i1.i1.i1.t426, i1.i1.i1.u25.t196, i2.i0.t4, i2.i0.t433, i2.i0.i1.t438, i2.i0.i1.u33.t199, i2.i1.t5, i2.i1.t451, i2.i1.i0.t445, i2.i1.i0.u41.t203, i3.i0.t6, i3.i0.t461, i3.i0.i0.t460, i3.i0.i0.u49.t207, i3.i1.t7, i3.i1.t470, i3.i1.i1.t476, i3.i1.i1.u57.t210, i4.i0.t8, i4.i0.t485, i4.i0.i0.t481, i4.i0.i0.u65.t214, i4.i1.t9, i4.i1.t500, i4.i1.i0.t496, i4.i1.i0.u73.t218, i5.i0.t10, i5.i0.t509, i5.i0.i0.t506, i5.i0.i0.u81.t222, i5.i1.t11, i5.i1.t519, i5.i1.i0.t225, i5.i1.i2.t521, i6.t536, i6.t530, i6.t12, i6.u98.t227, i7.t551, i7.t547, i7.t14, i7.t13, i7.u106.t237, i7.u111.t235, i7.u112.t58, i7.u113.t243, i8.t566, i8.t562, i8.t16, i8.u121.t248, i8.u122.t15, i8.u125.t171, i8.u126.t57, i8.u127.t252, i9.t579, i9.t573, i9.t17, i9.u135.t255, i10.i0.t18, i10.i0.t588, i10.i0.i1.t591, i10.i0.i1.u143.t260, i10.i1.t19, i10.i1.t600, i10.i1.i1.t604, i10.i1.i1.u151.t263, i11.t625, i11.t623, i11.t616, i11.t610, i11.t21, i11.t20, i11.u159.t265, i11.u167.t269, i11.u174.t173, i12.i0.t22, i12.i0.t272, i12.i0.t633, i12.i0.i0.t640, i12.i0.i0.u176.t275, i12.i1.t23, i12.i1.t646, i12.i1.i0.t652, i12.i1.i0.u184.t278, i12.i1.i0.u191.t55, i13.i0.t24, i13.i0.t657, i13.i0.i1.t662, i13.i0.i1.u192.t282, i13.i1.t25, i13.i1.t676, i13.i1.i0.t672, i13.i1.i0.u200.t285, i14.i0.t26, i14.i0.t685, i14.i0.i1.t684, i14.i0.i1.u208.t289, i14.i1.t27, i14.i1.t700, i14.i1.i0.t694, i14.i1.i0.u216.t292, i15.t711, i15.t707, i15.t28, i15.u224.t295, i16.i0.t29, i16.i0.t717, i16.i0.i1.t724, i16.i0.i1.u232.t298, i16.i1.t30, i16.i1.t736, i16.i1.i0.t730, i16.i1.i0.u240.t301, i17.i0.t31, i17.i0.t742, i17.i0.i0.t748, i17.i0.i0.u248.t305, i17.i1.t32, i17.i1.t760, i17.i1.i0.t754, i17.i1.i0.u256.t310, i18.i0.t33, i18.i0.t771, i18.i0.i0.t766, i18.i0.i0.u264.t313, i18.i1.t34, i18.i1.t778, i18.i1.i1.t781, i18.i1.i1.u272.t317, i19.i0.t35, i19.i0.t796, i19.i0.i0.t791, i19.i0.i0.u280.t320, i19.i1.t36, i19.i1.t806, i19.i1.i0.t804, i19.i1.i0.u288.t324, i20.i0.t37, i20.i0.t816, i20.i0.i0.u296.t328, i20.i0.i0.u300.t53, i20.i1.t38, i20.i1.t825, i20.i1.i1.t830, i20.i1.i1.u304.t332, i21.t843, i21.t837, i21.t39, i21.u312.t337, i21.u318.t52, i22.i0.t40, i22.i0.t856, i22.i0.i0.t849, i22.i0.i0.u320.t342, i22.i1.t41, i22.i1.t862, i22.i1.i0.t868, i22.i1.i0.u328.t345, i23.t878, i23.t876, i23.t42, i23.u336.t349, i24.i0.t43, i24.i0.t889, i24.i0.i0.t885, i24.i0.i0.u344.t352, i24.i1.t44, i24.i1.t901, i24.i1.i1.t899, i24.i1.i1.u352.t355, i25.i0.t45, i25.i0.t912, i25.i0.i0.t913, i25.i0.i0.u360.t359, i25.i1.t46, i25.i1.i1.u368.t362, i25.i1.i1.u375.t51, i26.t935, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/385/192/577
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 589 transitions
Trivial Post-agglo rules discarded 589 transitions
Performed 589 trivial Post agglomeration. Transition count delta: 589
Iterating post reduction 0 with 589 rules applied. Total rules applied 589 place count 3148 transition count 2309
Reduce places removed 589 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 591 rules applied. Total rules applied 1180 place count 2559 transition count 2307
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 1202 place count 2558 transition count 2286
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 1223 place count 2537 transition count 2286
Performed 290 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 290 Pre rules applied. Total rules applied 1223 place count 2537 transition count 1996
Deduced a syphon composed of 290 places in 4 ms
Reduce places removed 290 places and 0 transitions.
Iterating global reduction 4 with 580 rules applied. Total rules applied 1803 place count 2247 transition count 1996
Discarding 130 places :
Symmetric choice reduction at 4 with 130 rule applications. Total rules 1933 place count 2117 transition count 1866
Iterating global reduction 4 with 130 rules applied. Total rules applied 2063 place count 2117 transition count 1866
Performed 88 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 88 Pre rules applied. Total rules applied 2063 place count 2117 transition count 1778
Deduced a syphon composed of 88 places in 3 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2239 place count 2029 transition count 1778
Performed 800 Post agglomeration using F-continuation condition.Transition count delta: 800
Deduced a syphon composed of 800 places in 1 ms
Reduce places removed 800 places and 0 transitions.
Iterating global reduction 4 with 1600 rules applied. Total rules applied 3839 place count 1229 transition count 978
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4041 place count 1128 transition count 1037
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 4109 place count 1094 transition count 1058
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 4114 place count 1094 transition count 1058
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4115 place count 1093 transition count 1057
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4116 place count 1092 transition count 1056
Applied a total of 4116 rules in 744 ms. Remains 1092 /3149 variables (removed 2057) and now considering 1056/2899 (removed 1843) transitions.
[2021-05-15 21:12:51] [INFO ] Flatten gal took : 49 ms
[2021-05-15 21:12:51] [INFO ] Flatten gal took : 41 ms
[2021-05-15 21:12:51] [INFO ] Input system was already deterministic with 1056 transitions.
[2021-05-15 21:12:51] [INFO ] Flatten gal took : 50 ms
[2021-05-15 21:12:51] [INFO ] Flatten gal took : 40 ms
[2021-05-15 21:12:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3565022430243345190.gal : 6 ms
[2021-05-15 21:12:51] [INFO ] Time to serialize properties into /tmp/CTLFireability18274925432311172151.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3565022430243345190.gal, -t, CGAL, -ctl, /tmp/CTLFireability18274925432311172151.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3565022430243345190.gal -t CGAL -ctl /tmp/CTLFireability18274925432311172151.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49695e+155,12.9719,311336,2,6817,5,1.16967e+06,6,0,5417,2.08344e+06,0
Converting to forward existential form...Done !
original formula: E((((((((((p16==1)||(p3264==1))||(p2240==1))||(p1188==1))||(p2010==1))||(p152==1))||(p1653==1))||((p1306==1)&&(p1334==1)))||(((p1111==1)&&(p1143==1))&&(p1155==1))) U (AG(A((((((((((p520==0)&&((p206==0)||(p208==0)))&&(p436==0))&&(((p3454==0)||(p3467==0))||(p3501==0)))&&(p1322==0))&&(p951==0))&&((p2903==0)||(p3001==0)))&&((p337==0)||(p391==0)))&&((p212==0)||(p310==0))) U (EF((((((((((p1608==1)||(p102==1))||(((p1180==1)&&(p1212==1))&&(p1224==1)))||((p3241==1)&&(p3260==1)))||(p2670==1))||((p1310==1)&&(p1312==1)))||(p1133==1))||(p3437==1))||(p1734==1))) + ((p1129==1)&&(((((((((p990==1)||(p2257==1))||(p3135==1))||(p3315==1))||(p36==1))||((p619==1)&&(p638==1)))||(p2919==1))||(p237==1))||(p630==1)))))) + (EF(((A(((((((((((p1457==1)||(p2529==1))||(p1869==1))||(p2750==1))||(p1048==1))||(p2435==1))||(p2817==1))||(p2280==1))||(p900==1))||(p2964==1)) U ((p853==1)||(p3233==1))) * EG(((((((((p808==1)||(p3494==1))||(((p1591==1)&&(p1604==1))&&(p1638==1)))||((p477==1)&&(p510==1)))||(p732==1))||(p2103==1))||(p2928==1))||(p1876==1)))) * ((((p2716==1)||(p1425==1))||(p2042==1))||(p1570==1)))) * (((!(AG(((((p1543==1)||((p2959==1)&&(p3013==1)))||(p1685==1))||(p2853==1)))) + !(AG((((((p408==1)&&(p441==1))||(p2706==1))||((p2966==1)&&(p2968==1)))||(p1354==1))))) + !(EF((((((((p2305==1)||(p2927==1))||(p370==1))||(p106==1))||(p2360==1))||(p1635==1))||(((p1249==1)&&(p1281==1))&&(p1293==1)))))) + (((((((p2126==0)&&(p1297==0))&&(p2477==0))&&(p457==0))&&(p3453==0))&&((p1517==0)||(p1519==0)))&&(((p832==0)||(p845==0))||(p879==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((((((((p16==1)||(p3264==1))||(p2240==1))||(p1188==1))||(p2010==1))||(p152==1))||(p1653==1))||((p1306==1)&&(p1334==1)))||(((p1111==1)&&(p1143==1))&&(p1155==1)))) * !(E(TRUE U !(!((E(!((E(TRUE U (((((((((p1608==1)||(p102==1))||(((p1180==1)&&(p1212==1))&&(p1224==1)))||((p3241==1)&&(p3260==1)))||(p2670==1))||((p1310==1)&&(p1312==1)))||(p1133==1))||(p3437==1))||(p1734==1))) + ((p1129==1)&&(((((((((p990==1)||(p2257==1))||(p3135==1))||(p3315==1))||(p36==1))||((p619==1)&&(p638==1)))||(p2919==1))||(p237==1))||(p630==1))))) U (!((((((((((p520==0)&&((p206==0)||(p208==0)))&&(p436==0))&&(((p3454==0)||(p3467==0))||(p3501==0)))&&(p1322==0))&&(p951==0))&&((p2903==0)||(p3001==0)))&&((p337==0)||(p391==0)))&&((p212==0)||(p310==0)))) * !((E(TRUE U (((((((((p1608==1)||(p102==1))||(((p1180==1)&&(p1212==1))&&(p1224==1)))||((p3241==1)&&(p3260==1)))||(p2670==1))||((p1310==1)&&(p1312==1)))||(p1133==1))||(p3437==1))||(p1734==1))) + ((p1129==1)&&(((((((((p990==1)||(p2257==1))||(p3135==1))||(p3315==1))||(p36==1))||((p619==1)&&(p638==1)))||(p2919==1))||(p237==1))||(p630==1))))))) + EG(!((E(TRUE U (((((((((p1608==1)||(p102==1))||(((p1180==1)&&(p1212==1))&&(p1224==1)))||((p3241==1)&&(p3260==1)))||(p2670==1))||((p1310==1)&&(p1312==1)))||(p1133==1))||(p3437==1))||(p1734==1))) + ((p1129==1)&&(((((((((p990==1)||(p2257==1))||(p3135==1))||(p3315==1))||(p36==1))||((p619==1)&&(p638==1)))||(p2919==1))||(p237==1))||(p630==1))))))))))))] != FALSE + ((([(FwdU((FwdU(Init,(((((((((p16==1)||(p3264==1))||(p2240==1))||(p1188==1))||(p2010==1))||(p152==1))||(p1653==1))||((p1306==1)&&(p1334==1)))||(((p1111==1)&&(p1143==1))&&(p1155==1)))) * E(TRUE U ((!((E(!(((p853==1)||(p3233==1))) U (!(((((((((((p1457==1)||(p2529==1))||(p1869==1))||(p2750==1))||(p1048==1))||(p2435==1))||(p2817==1))||(p2280==1))||(p900==1))||(p2964==1))) * !(((p853==1)||(p3233==1))))) + EG(!(((p853==1)||(p3233==1)))))) * EG(((((((((p808==1)||(p3494==1))||(((p1591==1)&&(p1604==1))&&(p1638==1)))||((p477==1)&&(p510==1)))||(p732==1))||(p2103==1))||(p2928==1))||(p1876==1)))) * ((((p2716==1)||(p1425==1))||(p2042==1))||(p1570==1))))),TRUE) * !(((((p1543==1)||((p2959==1)&&(p3013==1)))||(p1685==1))||(p2853==1))))] != FALSE + [(FwdU((FwdU(Init,(((((((((p16==1)||(p3264==1))||(p2240==1))||(p1188==1))||(p2010==1))||(p152==1))||(p1653==1))||((p1306==1)&&(p1334==1)))||(((p1111==1)&&(p1143==1))&&(p1155==1)))) * E(TRUE U ((!((E(!(((p853==1)||(p3233==1))) U (!(((((((((((p1457==1)||(p2529==1))||(p1869==1))||(p2750==1))||(p1048==1))||(p2435==1))||(p2817=
Detected timeout of ITS tools.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:176)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:342)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:284)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:326)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:178)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:185)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:161)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:326)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:392)
at fr.lip6.move.gal.application.ITSRunner$ITSInterpreter.run(ITSRunner.java:182)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-15 21:13:21] [INFO ] Flatten gal took : 39 ms
[2021-05-15 21:13:21] [INFO ] Applying decomposition
[2021-05-15 21:13:21] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14504770478151146790.txt, -o, /tmp/graph14504770478151146790.bin, -w, /tmp/graph14504770478151146790.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14504770478151146790.bin, -l, -1, -v, -w, /tmp/graph14504770478151146790.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:13:21] [INFO ] Decomposing Gal with order
[2021-05-15 21:13:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:13:21] [INFO ] Removed a total of 836 redundant transitions.
[2021-05-15 21:13:21] [INFO ] Flatten gal took : 70 ms
[2021-05-15 21:13:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 36 ms.
[2021-05-15 21:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability7890786074368091108.gal : 10 ms
[2021-05-15 21:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9694179204127087118.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7890786074368091108.gal, -t, CGAL, -ctl, /tmp/CTLFireability9694179204127087118.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7890786074368091108.gal -t CGAL -ctl /tmp/CTLFireability9694179204127087118.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.49695e+155,27.4267,706044,1994,147,1.22784e+06,1589,1854,4.43094e+06,203,11959,0
Converting to forward existential form...Done !
original formula: E((((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1))) U (AG(A((((((((((i3.i0.i1.u53.p520==0)&&((i1.u16.p206==0)||(i1.u17.p208==0)))&&(i2.i1.i0.u45.p436==0))&&(((i28.u397.p3454==0)||(i28.u398.p3467==0))||(i28.u399.p3501==0)))&&(i10.u147.p1322==0))&&(i7.u99.p951==0))&&((i24.u331.p2903==0)||(i25.i0.i1.u343.p3001==0)))&&((i2.i0.i0.u31.p337==0)||(i2.i0.i0.u39.p391==0)))&&((i1.u19.p212==0)||(i1.u29.p310==0))) U (EF((((((((((i12.i1.i1.u182.p1608==1)||(i0.u7.p102==1))||(((i9.u129.p1180==1)&&(i9.u131.p1212==1))&&(i9.u132.p1224==1)))||((i27.i0.i1.u371.p3241==1)&&(i27.i0.i1.u375.p3260==1)))||(i21.u299.p2670==1))||((i10.u143.p1310==1)&&(i10.u144.p1312==1)))||(i8.i1.i0.u121.p1133==1))||(i28.u393.p3437==1))||(i14.i0.i0.u198.p1734==1))) + ((i8.i1.i0.u122.p1129==1)&&(((((((((i7.u106.p990==1)||(i17.u253.p2257==1))||(i26.u359.p3135==1))||(i27.i1.i0.u380.p3315==1))||(i8.i0.i0.u113.p36==1))||((i4.u63.p619==1)&&(i4.u68.p638==1)))||(i24.u334.p2919==1))||(i1.u21.p237==1))||(i4.u68.p630==1)))))) + (EF(((A(((((((((((i11.u164.p1457==1)||(i20.u285.p2529==1))||(i15.i0.i0.u212.p1869==1))||(i22.u307.p2750==1))||(i8.i0.i1.u114.p1048==1))||(i19.u275.p2435==1))||(i23.u316.p2817==1))||(i18.u257.p2280==1))||(i7.u94.p900==1))||(i25.i0.i0.u338.p2964==1)) U ((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))) * EG(((((((((i5.u82.p808==1)||(i28.u399.p3494==1))||(((i12.i0.i1.u179.p1591==1)&&(i12.i1.i0.u181.p1604==1))&&(i12.i1.i2.u183.p1638==1)))||((i3.i0.i0.u48.p477==1)&&(i3.i0.i0.u52.p510==1)))||(i5.u76.p732==1))||(i16.i1.i1.u237.p2103==1))||(i24.u335.p2928==1))||(i15.i0.i1.u214.p1876==1)))) * ((((i22.u306.p2716==1)||(i11.u158.p1425==1))||(i16.i0.i1.u229.p2042==1))||(i12.i0.i2.u175.p1570==1)))) * (((!(AG(((((i12.i0.i0.u173.p1543==1)||((i25.i0.i0.u337.p2959==1)&&(i25.i0.i2.u344.p3013==1)))||(i13.u190.p1685==1))||(i23.u323.p2853==1)))) + !(AG((((((i2.i1.i0.u40.p408==1)&&(i2.i1.i0.u45.p441==1))||(i22.u305.p2706==1))||((i25.i0.i0.u338.p2966==1)&&(i25.i0.i1.u339.p2968==1)))||(i10.u150.p1354==1))))) + !(EF((((((((i18.u260.p2305==1)||(i24.u333.p2927==1))||(i2.i0.i0.u37.p370==1))||(i0.u7.p106==1))||(i19.u268.p2360==1))||(i12.i1.i2.u183.p1635==1))||(((i9.u137.p1249==1)&&(i9.u138.p1281==1))&&(i9.u139.p1293==1)))))) + (((((((i17.u239.p2126==0)&&(i10.u140.p1297==0))&&(i20.u278.p2477==0))&&(i2.i1.i1.u47.p457==0))&&(i28.u397.p3453==0))&&((i12.i0.i1.u168.p1517==0)||(i12.i0.i2.u169.p1519==0)))&&(((i6.u86.p832==0)||(i6.u88.p845==0))||(i6.u90.p879==0)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1)))) * !(E(TRUE U !(!((E(!((E(TRUE U (((((((((i12.i1.i1.u182.p1608==1)||(i0.u7.p102==1))||(((i9.u129.p1180==1)&&(i9.u131.p1212==1))&&(i9.u132.p1224==1)))||((i27.i0.i1.u371.p3241==1)&&(i27.i0.i1.u375.p3260==1)))||(i21.u299.p2670==1))||((i10.u143.p1310==1)&&(i10.u144.p1312==1)))||(i8.i1.i0.u121.p1133==1))||(i28.u393.p3437==1))||(i14.i0.i0.u198.p1734==1))) + ((i8.i1.i0.u122.p1129==1)&&(((((((((i7.u106.p990==1)||(i17.u253.p2257==1))||(i26.u359.p3135==1))||(i27.i1.i0.u380.p3315==1))||(i8.i0.i0.u113.p36==1))||((i4.u63.p619==1)&&(i4.u68.p638==1)))||(i24.u334.p2919==1))||(i1.u21.p237==1))||(i4.u68.p630==1))))) U (!((((((((((i3.i0.i1.u53.p520==0)&&((i1.u16.p206==0)||(i1.u17.p208==0)))&&(i2.i1.i0.u45.p436==0))&&(((i28.u397.p3454==0)||(i28.u398.p3467==0))||(i28.u399.p3501==0)))&&(i10.u147.p1322==0))&&(i7.u99.p951==0))&&((i24.u331.p2903==0)||(i25.i0.i1.u343.p3001==0)))&&((i2.i0.i0.u31.p337==0)||(i2.i0.i0.u39.p391==0)))&&((i1.u19.p212==0)||(i1.u29.p310==0)))) * !((E(TRUE U (((((((((i12.i1.i1.u182.p1608==1)||(i0.u7.p102==1))||(((i9.u129.p1180==1)&&(i9.u131.p1212==1))&&(i9.u132.p1224==1)))||((i27.i0.i1.u371.p3241==1)&&(i27.i0.i1.u375.p3260==1)))||(i21.u299.p2670==1))||((i10.u143.p1310==1)&&(i10.u144.p1312==1)))||(i8.i1.i0.u121.p1133==1))||(i28.u393.p3437==1))||(i14.i0.i0.u198.p1734==1))) + ((i8.i1.i0.u122.p1129==1)&&(((((((((i7.u106.p990==1)||(i17.u253.p2257==1))||(i26.u359.p3135==1))||(i27.i1.i0.u380.p3315==1))||(i8.i0.i0.u113.p36==1))||((i4.u63.p619==1)&&(i4.u68.p638==1)))||(i24.u334.p2919==1))||(i1.u21.p237==1))||(i4.u68.p630==1))))))) + EG(!((E(TRUE U (((((((((i12.i1.i1.u182.p1608==1)||(i0.u7.p102==1))||(((i9.u129.p1180==1)&&(i9.u131.p1212==1))&&(i9.u132.p1224==1)))||((i27.i0.i1.u371.p3241==1)&&(i27.i0.i1.u375.p3260==1)))||(i21.u299.p2670==1))||((i10.u143.p1310==1)&&(i10.u144.p1312==1)))||(i8.i1.i0.u121.p1133==1))||(i28.u393.p3437==1))||(i14.i0.i0.u198.p1734==1))) + ((i8.i1.i0.u122.p1129==1)&&(((((((((i7.u106.p990==1)||(i17.u253.p2257==1))||(i26.u359.p3135==1))||(i27.i1.i0.u380.p3315==1))||(i8.i0.i0.u113.p36==1))||((i4.u63.p619==1)&&(i4.u68.p638==1)))||(i24.u334.p2919==1))||(i1.u21.p237==1))||(i4.u68.p630==1))))))))))))] != FALSE + ((([(FwdU((FwdU(Init,(((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1)))) * E(TRUE U ((!((E(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))) U (!(((((((((((i11.u164.p1457==1)||(i20.u285.p2529==1))||(i15.i0.i0.u212.p1869==1))||(i22.u307.p2750==1))||(i8.i0.i1.u114.p1048==1))||(i19.u275.p2435==1))||(i23.u316.p2817==1))||(i18.u257.p2280==1))||(i7.u94.p900==1))||(i25.i0.i0.u338.p2964==1))) * !(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))))) + EG(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1)))))) * EG(((((((((i5.u82.p808==1)||(i28.u399.p3494==1))||(((i12.i0.i1.u179.p1591==1)&&(i12.i1.i0.u181.p1604==1))&&(i12.i1.i2.u183.p1638==1)))||((i3.i0.i0.u48.p477==1)&&(i3.i0.i0.u52.p510==1)))||(i5.u76.p732==1))||(i16.i1.i1.u237.p2103==1))||(i24.u335.p2928==1))||(i15.i0.i1.u214.p1876==1)))) * ((((i22.u306.p2716==1)||(i11.u158.p1425==1))||(i16.i0.i1.u229.p2042==1))||(i12.i0.i2.u175.p1570==1))))),TRUE) * !(((((i12.i0.i0.u173.p1543==1)||((i25.i0.i0.u337.p2959==1)&&(i25.i0.i2.u344.p3013==1)))||(i13.u190.p1685==1))||(i23.u323.p2853==1))))] != FALSE + [(FwdU((FwdU(Init,(((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1)))) * E(TRUE U ((!((E(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))) U (!(((((((((((i11.u164.p1457==1)||(i20.u285.p2529==1))||(i15.i0.i0.u212.p1869==1))||(i22.u307.p2750==1))||(i8.i0.i1.u114.p1048==1))||(i19.u275.p2435==1))||(i23.u316.p2817==1))||(i18.u257.p2280==1))||(i7.u94.p900==1))||(i25.i0.i0.u338.p2964==1))) * !(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))))) + EG(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1)))))) * EG(((((((((i5.u82.p808==1)||(i28.u399.p3494==1))||(((i12.i0.i1.u179.p1591==1)&&(i12.i1.i0.u181.p1604==1))&&(i12.i1.i2.u183.p1638==1)))||((i3.i0.i0.u48.p477==1)&&(i3.i0.i0.u52.p510==1)))||(i5.u76.p732==1))||(i16.i1.i1.u237.p2103==1))||(i24.u335.p2928==1))||(i15.i0.i1.u214.p1876==1)))) * ((((i22.u306.p2716==1)||(i11.u158.p1425==1))||(i16.i0.i1.u229.p2042==1))||(i12.i0.i2.u175.p1570==1))))),TRUE) * !((((((i2.i1.i0.u40.p408==1)&&(i2.i1.i0.u45.p441==1))||(i22.u305.p2706==1))||((i25.i0.i0.u338.p2966==1)&&(i25.i0.i1.u339.p2968==1)))||(i10.u150.p1354==1))))] != FALSE) + [((FwdU(Init,(((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1)))) * E(TRUE U ((!((E(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))) U (!(((((((((((i11.u164.p1457==1)||(i20.u285.p2529==1))||(i15.i0.i0.u212.p1869==1))||(i22.u307.p2750==1))||(i8.i0.i1.u114.p1048==1))||(i19.u275.p2435==1))||(i23.u316.p2817==1))||(i18.u257.p2280==1))||(i7.u94.p900==1))||(i25.i0.i0.u338.p2964==1))) * !(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))))) + EG(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1)))))) * EG(((((((((i5.u82.p808==1)||(i28.u399.p3494==1))||(((i12.i0.i1.u179.p1591==1)&&(i12.i1.i0.u181.p1604==1))&&(i12.i1.i2.u183.p1638==1)))||((i3.i0.i0.u48.p477==1)&&(i3.i0.i0.u52.p510==1)))||(i5.u76.p732==1))||(i16.i1.i1.u237.p2103==1))||(i24.u335.p2928==1))||(i15.i0.i1.u214.p1876==1)))) * ((((i22.u306.p2716==1)||(i11.u158.p1425==1))||(i16.i0.i1.u229.p2042==1))||(i12.i0.i2.u175.p1570==1))))) * !(E(TRUE U (((((((i18.u260.p2305==1)||(i24.u333.p2927==1))||(i2.i0.i0.u37.p370==1))||(i0.u7.p106==1))||(i19.u268.p2360==1))||(i12.i1.i2.u183.p1635==1))||(((i9.u137.p1249==1)&&(i9.u138.p1281==1))&&(i9.u139.p1293==1))))))] != FALSE) + [((FwdU(Init,(((((((((i19.u0.p16==1)||(i27.i0.i0.u376.p3264==1))||(i17.u252.p2240==1))||(i9.u130.p1188==1))||(i16.i0.i0.u228.p2010==1))||(i0.u13.p152==1))||(i13.u185.p1653==1))||((i10.u142.p1306==1)&&(i10.u148.p1334==1)))||(((i8.i1.i1.u120.p1111==1)&&(i8.i1.i1.u123.p1143==1))&&(i8.i1.i1.u124.p1155==1)))) * E(TRUE U ((!((E(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))) U (!(((((((((((i11.u164.p1457==1)||(i20.u285.p2529==1))||(i15.i0.i0.u212.p1869==1))||(i22.u307.p2750==1))||(i8.i0.i1.u114.p1048==1))||(i19.u275.p2435==1))||(i23.u316.p2817==1))||(i18.u257.p2280==1))||(i7.u94.p900==1))||(i25.i0.i0.u338.p2964==1))) * !(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1))))) + EG(!(((i6.u89.p853==1)||(i27.i0.i1.u369.p3233==1)))))) * EG(((((((((i5.u82.p808==1)||(i28.u399.p3494==1))||(((i12.i0.i1.u179.p1591==1)&&(i12.i1.i0.u181.p1604==1))&&(i12.i1.i2.u183.p1638==1)))||((i3.i0.i0.u48.p477==1)&&(i3.i0.i0.u52.p510==1)))||(i5.u76.p732==1))||(i16.i1.i1.u237.p2103==1))||(i24.u335.p2928==1))||(i15.i0.i1.u214.p1876==1)))) * ((((i22.u306.p2716==1)||(i11.u158.p1425==1))||(i16.i0.i1.u229.p2042==1))||(i12.i0.i2.u175.p1570==1))))) * (((((((i17.u239.p2126==0)&&(i10.u140.p1297==0))&&(i20.u278.p2477==0))&&(i2.i1.i1.u47.p457==0))&&(i28.u397.p3453==0))&&((i12.i0.i1.u168.p1517==0)||(i12.i0.i2.u169.p1519==0)))&&(((i6.u86.p832==0)||(i6.u88.p845==0))||(i6.u90.p879==0))))] != FALSE))
Reverse transition relation is NOT exact ! Due to transitions t439, i0.t1, i0.t0, i0.u2.t305, i0.u5.t518, i0.u7.t123, i0.u7.t307, i0.u8.t311, i0.u12.t526, i0.u13.t122, i1.t550, i1.t544, i1.t534, i1.t312, i1.t250, i1.t2, i1.u15.t316, i1.u19.t121, i1.u21.t251, i1.u23.t319, i2.i0.t3, i2.i0.t560, i2.i0.i0.t556, i2.i0.i0.t118, i2.i0.i0.u31.t119, i2.i0.i0.u37.t252, i2.i1.i0.t323, i2.i1.i0.u45.t114, i2.i1.i0.u45.t115, i2.i1.i1.t571, i2.i1.i1.t4, i2.i1.i1.u47.t569, i2.i1.i1.u47.t570, i3.i0.i0.t328, i3.i0.i1.u49.t5, i3.i0.i1.u50.t582, i3.i0.i1.u53.t330, i3.i1.t6, i3.i1.t592, i3.i1.i0.t588, i3.i1.i0.u54.t333, i4.t602, i4.t7, i4.u62.t337, i4.u67.t606, i4.u68.t595, i4.u68.t596, i5.t621, i5.t618, i5.t614, i5.t9, i5.t8, i5.u69.t341, i5.u76.t110, i5.u77.t346, i5.u82.t348, i6.t636, i6.t634, i6.t10, i6.u89.t254, i7.t659, i7.t655, i7.t649, i7.t362, i7.t12, i7.t11, i7.u94.t105, i7.u91.t353, i7.u100.t1052, i8.i0.t367, i8.i0.t666, i8.i0.i0.t13, i8.i0.i0.u109.t366, i8.i0.i0.u113.t670, i8.i0.i1.u115.t292, i8.i1.i0.t257, i8.i1.i0.u122.t370, i8.i1.i1.t680, i8.i1.i1.t676, i8.i1.i1.t14, i9.t701, i9.t697, i9.t687, i9.t685, i9.t16, i9.t15, i9.u125.t376, i9.u130.t374, i9.u133.t379, i10.t711, i10.t383, i10.t93, i10.u147.t92, i10.u141.t382, i10.u142.t94, i10.u150.t709, i10.u150.t710, i11.t736, i11.t732, i11.t726, i11.t720, i11.t388, i11.t19, i11.t18, i11.u151.t387, i11.u158.t90, i11.u159.t391, i11.u164.t258, i12.t754, i12.i0.t259, i12.i0.t744, i12.i0.i0.u173.t89, i12.i0.i2.t748, i12.i0.i2.u175.t87, i12.i1.t20, i12.i1.i1.u182.t85, i12.i1.i2.u183.t83, i13.t768, i13.t766, i13.t398, i13.t21, i13.u190.t81, i14.i0.t775, i14.i0.i0.u198.t772, i14.i0.i1.t780, i14.i0.i1.t22, i14.i0.i1.u193.t401, i14.i1.t23, i14.i1.t791, i14.i1.i0.t787, i14.i1.i0.u201.t403, i15.i0.i0.u209.t408, i15.i0.i0.u210.t24, i15.i0.i0.u212.t79, i15.i0.i1.u213.t281, i15.i1.t25, i15.i1.t813, i15.i1.i1.t810, i15.i1.i1.u215.t411, i16.i0.t26, i16.i0.t824, i16.i0.i0.t820, i16.i0.i0.u223.t414, i16.i0.i0.u228.t816, i16.i0.i1.u229.t77, i16.i1.t27, i16.i1.t838, i16.i1.i0.t831, i16.i1.i0.u231.t417, i16.i1.i1.u237.t75, i17.t854, i17.t849, i17.t845, i17.t419, i17.t28, i17.u240.t420, i17.u248.t426, i17.u249.t29, i17.u252.t74, i17.u253.t431, i18.t866, i18.t434, i18.t30, i18.u257.t72, i18.u260.t71, i19.t885, i19.t879, i19.t443, i19.t441, i19.t32, i19.t31, i19.u263.t437, i19.u267.t874, i19.u268.t70, i19.u275.t263, i20.t896, i20.t894, i20.t33, i20.u278.t69, i20.u285.t68, i21.t907, i21.t905, i21.t35, i21.t34, i21.u286.t451, i21.u294.t455, i21.u299.t67, i22.t938, i22.t932, i22.t463, i22.t64, i22.t37, i22.t36, i22.u306.t265, i22.u304.t926, i22.u305.t459, i22.u308.t466, i23.t947, i23.t943, i23.t471, i23.t38, i23.u317.t1055, i24.t956, i24.t476, i24.t473, i24.t39, i24.u334.t61, i24.u331.t62, i24.u335.t267, i25.i0.t268, i25.i0.t974, i25.i0.i0.t57, i25.i0.i0.u337.t59, i25.i0.i2.t967, i25.i1.t40, i25.i1.t983, i25.i1.i1.t981, i25.i1.i1.u345.t484, i26.t1008, i26.t1004, i26.t997, i26.t993, i26.t42, i26.t41, i26.u353.t488, i26.u359.t269, i26.u361.t492, i27.i0.t493, i27.i0.i0.u376.t51, i27.i0.i1.t1017, i27.i0.i1.t53, i27.i0.i1.t43, i27.i0.i1.u374.t1022, i27.i1.t44, i27.i1.i0.u380.t50, i27.i1.i1.t1034, i27.i1.i1.u377.t500, i28.t1043, i28.t1041, i28.t507, i28.t45, i28.u385.t504, i28.u399.t48, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/498/243/741
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 599 transitions
Trivial Post-agglo rules discarded 599 transitions
Performed 599 trivial Post agglomeration. Transition count delta: 599
Iterating post reduction 0 with 599 rules applied. Total rules applied 599 place count 3148 transition count 2299
Reduce places removed 599 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 614 rules applied. Total rules applied 1213 place count 2549 transition count 2284
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 1228 place count 2534 transition count 2284
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 299 Pre rules applied. Total rules applied 1228 place count 2534 transition count 1985
Deduced a syphon composed of 299 places in 4 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 1826 place count 2235 transition count 1985
Discarding 132 places :
Symmetric choice reduction at 3 with 132 rule applications. Total rules 1958 place count 2103 transition count 1853
Iterating global reduction 3 with 132 rules applied. Total rules applied 2090 place count 2103 transition count 1853
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 2090 place count 2103 transition count 1761
Deduced a syphon composed of 92 places in 20 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 3 with 184 rules applied. Total rules applied 2274 place count 2011 transition count 1761
Performed 820 Post agglomeration using F-continuation condition.Transition count delta: 820
Deduced a syphon composed of 820 places in 1 ms
Reduce places removed 820 places and 0 transitions.
Iterating global reduction 3 with 1640 rules applied. Total rules applied 3914 place count 1191 transition count 941
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 4116 place count 1090 transition count 1000
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 4190 place count 1053 transition count 1023
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 4192 place count 1053 transition count 1023
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4193 place count 1052 transition count 1022
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4194 place count 1051 transition count 1022
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4195 place count 1050 transition count 1021
Applied a total of 4195 rules in 776 ms. Remains 1050 /3149 variables (removed 2099) and now considering 1021/2899 (removed 1878) transitions.
[2021-05-15 21:13:52] [INFO ] Flatten gal took : 58 ms
[2021-05-15 21:13:52] [INFO ] Flatten gal took : 79 ms
[2021-05-15 21:13:53] [INFO ] Input system was already deterministic with 1021 transitions.
[2021-05-15 21:13:53] [INFO ] Flatten gal took : 44 ms
[2021-05-15 21:13:53] [INFO ] Flatten gal took : 46 ms
[2021-05-15 21:13:53] [INFO ] Time to serialize gal into /tmp/CTLFireability14063765206506972094.gal : 15 ms
[2021-05-15 21:13:53] [INFO ] Time to serialize properties into /tmp/CTLFireability6149122901435466463.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14063765206506972094.gal, -t, CGAL, -ctl, /tmp/CTLFireability6149122901435466463.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14063765206506972094.gal -t CGAL -ctl /tmp/CTLFireability6149122901435466463.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.25092e+150,19.1614,452716,2,50980,5,1.89698e+06,6,0,5208,2.46586e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-15 21:14:23] [INFO ] Flatten gal took : 37 ms
[2021-05-15 21:14:23] [INFO ] Applying decomposition
[2021-05-15 21:14:23] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10861340497645513113.txt, -o, /tmp/graph10861340497645513113.bin, -w, /tmp/graph10861340497645513113.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10861340497645513113.bin, -l, -1, -v, -w, /tmp/graph10861340497645513113.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:14:23] [INFO ] Decomposing Gal with order
[2021-05-15 21:14:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:14:23] [INFO ] Removed a total of 903 redundant transitions.
[2021-05-15 21:14:23] [INFO ] Flatten gal took : 67 ms
[2021-05-15 21:14:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 380 labels/synchronizations in 15 ms.
[2021-05-15 21:14:23] [INFO ] Time to serialize gal into /tmp/CTLFireability8650991969602006079.gal : 235 ms
[2021-05-15 21:14:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5201769355463133403.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8650991969602006079.gal, -t, CGAL, -ctl, /tmp/CTLFireability5201769355463133403.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8650991969602006079.gal -t CGAL -ctl /tmp/CTLFireability5201769355463133403.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 602 transitions
Trivial Post-agglo rules discarded 602 transitions
Performed 602 trivial Post agglomeration. Transition count delta: 602
Iterating post reduction 0 with 602 rules applied. Total rules applied 602 place count 3148 transition count 2296
Reduce places removed 602 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 605 rules applied. Total rules applied 1207 place count 2546 transition count 2293
Reduce places removed 2 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 2 with 15 rules applied. Total rules applied 1222 place count 2544 transition count 2280
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 1235 place count 2531 transition count 2280
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 293 Pre rules applied. Total rules applied 1235 place count 2531 transition count 1987
Deduced a syphon composed of 293 places in 4 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 4 with 586 rules applied. Total rules applied 1821 place count 2238 transition count 1987
Discarding 133 places :
Symmetric choice reduction at 4 with 133 rule applications. Total rules 1954 place count 2105 transition count 1854
Iterating global reduction 4 with 133 rules applied. Total rules applied 2087 place count 2105 transition count 1854
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 99 Pre rules applied. Total rules applied 2087 place count 2105 transition count 1755
Deduced a syphon composed of 99 places in 3 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 2285 place count 2006 transition count 1755
Performed 812 Post agglomeration using F-continuation condition.Transition count delta: 812
Deduced a syphon composed of 812 places in 1 ms
Reduce places removed 812 places and 0 transitions.
Iterating global reduction 4 with 1624 rules applied. Total rules applied 3909 place count 1194 transition count 943
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4111 place count 1093 transition count 1007
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 4187 place count 1055 transition count 1031
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4188 place count 1055 transition count 1031
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4189 place count 1054 transition count 1030
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4191 place count 1052 transition count 1030
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4191 place count 1052 transition count 1029
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4193 place count 1051 transition count 1029
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4194 place count 1050 transition count 1028
Applied a total of 4194 rules in 670 ms. Remains 1050 /3149 variables (removed 2099) and now considering 1028/2899 (removed 1871) transitions.
[2021-05-15 21:14:54] [INFO ] Flatten gal took : 40 ms
[2021-05-15 21:14:54] [INFO ] Flatten gal took : 42 ms
[2021-05-15 21:14:54] [INFO ] Input system was already deterministic with 1028 transitions.
[2021-05-15 21:14:54] [INFO ] Flatten gal took : 41 ms
[2021-05-15 21:14:54] [INFO ] Flatten gal took : 44 ms
[2021-05-15 21:14:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8875305770535887073.gal : 4 ms
[2021-05-15 21:14:54] [INFO ] Time to serialize properties into /tmp/CTLFireability17008819962670776536.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8875305770535887073.gal, -t, CGAL, -ctl, /tmp/CTLFireability17008819962670776536.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8875305770535887073.gal -t CGAL -ctl /tmp/CTLFireability17008819962670776536.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.66762e+149,9.54426,235072,2,5391,5,898176,6,0,5229,1.53574e+06,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-15 21:15:24] [INFO ] Flatten gal took : 41 ms
[2021-05-15 21:15:24] [INFO ] Applying decomposition
[2021-05-15 21:15:24] [INFO ] Flatten gal took : 42 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15173620854989223785.txt, -o, /tmp/graph15173620854989223785.bin, -w, /tmp/graph15173620854989223785.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15173620854989223785.bin, -l, -1, -v, -w, /tmp/graph15173620854989223785.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:15:25] [INFO ] Decomposing Gal with order
[2021-05-15 21:15:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:15:25] [INFO ] Removed a total of 935 redundant transitions.
[2021-05-15 21:15:25] [INFO ] Flatten gal took : 65 ms
[2021-05-15 21:15:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 382 labels/synchronizations in 27 ms.
[2021-05-15 21:15:25] [INFO ] Time to serialize gal into /tmp/CTLFireability7265987763295427505.gal : 10 ms
[2021-05-15 21:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14232450858497622865.ctl : 7487 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7265987763295427505.gal, -t, CGAL, -ctl, /tmp/CTLFireability14232450858497622865.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7265987763295427505.gal -t CGAL -ctl /tmp/CTLFireability14232450858497622865.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.66762e+149,13.7387,399524,1448,96,828547,2648,1743,1.90561e+06,163,19282,0
Converting to forward existential form...Done !
original formula: ((!(AF((((((((i17.u234.p2068==1)&&(i17.u238.p2087==1))||(i28.u377.p3268==1))||((i8.u115.p1033==1)&&(i8.u119.p1052==1)))||(i22.i1.i1.u304.p2642==1))||(i20.u269.p2330==1))||(i4.i1.i2.u65.p578==1)))) * AF(((((((((((((((i22.i1.i2.u306.p2662==1)||(i9.u132.p1187==1))||(i22.i0.i0.u292.p2550==1))||(i21.i0.i1.u281.p2465==1))||(i18.i1.i1.u257.p2248==1))||(i16.u230.p2020==1))||(i21.i1.i0.u288.p2510==1))||(((i19.u262.p2284==1)&&(i19.u264.p2316==1))&&(i19.u265.p2328==1)))||((((((((((i9.u138.p1251==0)&&((i20.u266.p2338==0)||(i20.u273.p2392==0)))&&(i17.u239.p2089==0))&&(i27.u371.p3209==0))&&(i19.u263.p2296==0))&&(i10.i0.i2.u147.p1337==0))&&(i20.u272.p2381==0))&&((i8.u124.p1109==0)||(i9.u131.p1207==0)))&&(i10.i0.i0.u145.p1324==0))&&(i4.i0.i2.u56.p504==0)))||(i6.u87.p762==1))||(i4.i1.i1.u66.p593==1))||(i22.i1.i2.u305.p2654==1))||(i5.u75.p663==1)) * ((AG((((((i28.u380.p3296==1)||((i23.i1.i2.u315.p2754==1)&&(i23.i1.i2.u321.p2787==1)))||((i27.u365.p3168==1)&&(i27.u369.p3201==1)))||(i28.u381.p3308==1))||(i18.i1.i0.u255.p2221==1))) + EG((((((i7.u110.p971==1)&&(i8.u118.p1069==1))||(((i12.u172.p1522==1)&&(i12.u174.p1535==1))&&(i12.u176.p1569==1)))||(i28.u379.p3278==1))||(i9.u132.p1182==1)))) + ((((((((((((((((i12.u175.p1559==1)||(i15.i0.i1.u212.p1866==1))||(i21.i0.i0.u274.p2400==1))||(i0.u0.p53==1))||((i17.u235.p2070==1)&&(i17.u240.p2109==1)))||(i6.u97.p842==1))||(i10.i1.i2.u157.p1405==1))||(i7.u103.p916==1))&&(i28.u386.p3330==0))&&(i10.i1.i2.u156.p1408==0))&&(i0.u7.p89==0))&&(((i17.u237.p2077==0)||(i17.u240.p2109==0))||(i17.u241.p2121==0)))&&(i24.u330.p2849==0))&&(i11.u160.p1438==0))&&(i28.u372.p3236==0))&&((i23.i0.i0.u312.p2703==0)||(i23.i1.i0.u318.p2762==0))))))) * !(AF(((((i10.i0.i1.u148.p1348==1)||((i29.u389.p3373==1)&&(i29.u396.p3427==1)))||(i22.i0.i0.u291.p2546==1))||(i5.u74.p657==1)))))
=> equivalent forward existential formula: (([(Init * !(EG(!((((((((i17.u234.p2068==1)&&(i17.u238.p2087==1))||(i28.u377.p3268==1))||((i8.u115.p1033==1)&&(i8.u119.p1052==1)))||(i22.i1.i1.u304.p2642==1))||(i20.u269.p2330==1))||(i4.i1.i2.u65.p578==1))))))] = FALSE * [FwdG(Init,!(((((((((((((((i22.i1.i2.u306.p2662==1)||(i9.u132.p1187==1))||(i22.i0.i0.u292.p2550==1))||(i21.i0.i1.u281.p2465==1))||(i18.i1.i1.u257.p2248==1))||(i16.u230.p2020==1))||(i21.i1.i0.u288.p2510==1))||(((i19.u262.p2284==1)&&(i19.u264.p2316==1))&&(i19.u265.p2328==1)))||((((((((((i9.u138.p1251==0)&&((i20.u266.p2338==0)||(i20.u273.p2392==0)))&&(i17.u239.p2089==0))&&(i27.u371.p3209==0))&&(i19.u263.p2296==0))&&(i10.i0.i2.u147.p1337==0))&&(i20.u272.p2381==0))&&((i8.u124.p1109==0)||(i9.u131.p1207==0)))&&(i10.i0.i0.u145.p1324==0))&&(i4.i0.i2.u56.p504==0)))||(i6.u87.p762==1))||(i4.i1.i1.u66.p593==1))||(i22.i1.i2.u305.p2654==1))||(i5.u75.p663==1)) * ((!(E(TRUE U !((((((i28.u380.p3296==1)||((i23.i1.i2.u315.p2754==1)&&(i23.i1.i2.u321.p2787==1)))||((i27.u365.p3168==1)&&(i27.u369.p3201==1)))||(i28.u381.p3308==1))||(i18.i1.i0.u255.p2221==1))))) + EG((((((i7.u110.p971==1)&&(i8.u118.p1069==1))||(((i12.u172.p1522==1)&&(i12.u174.p1535==1))&&(i12.u176.p1569==1)))||(i28.u379.p3278==1))||(i9.u132.p1182==1)))) + ((((((((((((((((i12.u175.p1559==1)||(i15.i0.i1.u212.p1866==1))||(i21.i0.i0.u274.p2400==1))||(i0.u0.p53==1))||((i17.u235.p2070==1)&&(i17.u240.p2109==1)))||(i6.u97.p842==1))||(i10.i1.i2.u157.p1405==1))||(i7.u103.p916==1))&&(i28.u386.p3330==0))&&(i10.i1.i2.u156.p1408==0))&&(i0.u7.p89==0))&&(((i17.u237.p2077==0)||(i17.u240.p2109==0))||(i17.u241.p2121==0)))&&(i24.u330.p2849==0))&&(i11.u160.p1438==0))&&(i28.u372.p3236==0))&&((i23.i0.i0.u312.p2703==0)||(i23.i1.i0.u318.p2762==0)))))))] = FALSE) * [(Init * !(EG(!(((((i10.i0.i1.u148.p1348==1)||((i29.u389.p3373==1)&&(i29.u396.p3427==1)))||(i22.i0.i0.u291.p2546==1))||(i5.u74.p657==1))))))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.t479, i0.t475, i0.t272, i0.t270, i0.t0, i0.u7.t230, i1.i0.t1, i1.i0.t491, i1.i0.i0.t487, i1.i0.i0.u10.t278, i1.i1.t2, i1.i1.t499, i1.i1.i1.t503, i1.i1.i1.u18.t281, i2.t516, i2.t510, i2.t3, i2.u26.t283, i3.i0.t4, i3.i0.t524, i3.i0.i1.t528, i3.i0.i1.u34.t288, i3.i1.t5, i3.i1.t537, i3.i1.i0.t541, i3.i1.i0.u42.t291, i4.i0.t6, i4.i0.t548, i4.i0.i1.t550, i4.i0.i2.u56.t107, i4.i1.t7, i4.i1.t562, i4.i1.i0.t558, i4.i1.i1.u66.t299, i4.i1.i2.u65.t298, i5.t585, i5.t581, i5.t572, i5.t9, i5.t8, i5.u68.t303, i5.u74.t105, i5.u75.t104, i5.u76.t308, i6.t595, i6.t11, i6.t10, i6.u87.t103, i6.u84.t312, i6.u92.t315, i6.u96.t605, i6.u97.t102, i7.t624, i7.t616, i7.t610, i7.t321, i7.t13, i7.t12, i7.u103.t101, i7.u98.t318, i7.u106.t325, i7.u110.t99, i8.t648, i8.t636, i8.t330, i8.t15, i8.t14, i8.u118.t639, i8.u114.t329, i8.u120.t334, i8.u124.t95, i9.t670, i9.t666, i9.t657, i9.t17, i9.u128.t337, i9.u129.t16, i9.u131.t661, i9.u132.t93, i9.u133.t341, i9.u138.t663, i10.i0.i0.u146.t266, i10.i0.i1.u148.t349, i10.i0.i2.u142.t18, i10.i0.i2.u147.t347, i10.i1.t19, i10.i1.t685, i10.i1.i1.t688, i10.i1.i2.t87, i10.i1.i2.u157.t351, i11.t700, i11.t696, i11.t353, i11.t20, i11.u161.t357, i12.t725, i12.t721, i12.t712, i12.t706, i12.t22, i12.t21, i12.u169.t360, i12.u175.t85, i12.u177.t363, i13.t737, i13.t733, i13.t23, i13.u185.t366, i14.i0.t24, i14.i0.t746, i14.i0.i0.t743, i14.i0.i0.u193.t369, i14.i1.t25, i14.i1.t758, i14.i1.i0.t754, i14.i1.i0.u201.t372, i15.i0.t26, i15.i0.i0.t773, i15.i0.i0.u209.t376, i15.i0.i1.u212.t83, i15.i1.t27, i15.i1.t780, i15.i1.i1.t782, i15.i1.i1.u217.t379, i16.t795, i16.t791, i16.t28, i16.u230.t235, i16.u225.t383, i17.t808, i17.t802, i17.t79, i17.t29, i17.u233.t385, i18.i0.t30, i18.i0.t814, i18.i0.i1.t819, i18.i0.i1.u242.t388, i18.i1.i0.u256.t249, i18.i1.i1.t829, i18.i1.i1.t31, i18.i1.i1.u250.t392, i18.i1.i1.u257.t74, i19.t840, i19.t836, i19.t32, i19.u258.t397, i19.u263.t73, i20.t846, i20.t403, i20.t68, i20.t33, i20.u266.t69, i20.u269.t847, i20.u269.t849, i20.u271.t252, i21.i0.t408, i21.i0.i0.t34, i21.i0.i0.u275.t406, i21.i0.i1.t858, i21.i0.i1.u281.t857, i21.i1.t35, i21.i1.t866, i21.i1.i0.u288.t412, i21.i1.i2.t871, i22.i0.t36, i22.i0.t882, i22.i0.i0.t878, i22.i0.i0.u291.t64, i22.i1.t416, i22.i1.i0.t37, i22.i1.i0.u302.t893, i22.i1.i1.t419, i22.i1.i1.u304.t236, i22.i1.i2.t61, i22.i1.i2.u305.t62, i23.i0.t38, i23.i0.t905, i23.i0.i0.t899, i23.i0.i0.u307.t423, i23.i1.t39, i23.i1.t426, i23.i1.i0.u318.t59, i23.i1.i1.t917, i23.i1.i2.t428, i24.t928, i24.t922, i24.t434, i24.t433, i24.t40, i24.u330.t237, i25.i0.t41, i25.i0.t941, i25.i0.i0.t935, i25.i0.i0.u333.t438, i25.i1.t42, i25.i1.t950, i25.i1.i0.t948, i25.i1.i0.u341.t441, i26.i0.t43, i26.i0.t963, i26.i0.i0.t960, i26.i0.i0.u349.t445, i26.i1.t44, i26.i1.t972, i26.i1.i1.t974, i26.i1.i1.u357.t448, i27.t451, i27.u366.t45, i27.u367.t985, i27.u370.t258, i28.t461, i28.t46, i28.u372.t56, i28.u377.t238, i28.u375.t993, i28.u378.t261, i28.u381.t53, i28.u386.t52, i29.t1021, i29.t1010, i29.t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/458/222/680
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 3148 transition count 2269
Reduce places removed 629 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 632 rules applied. Total rules applied 1261 place count 2519 transition count 2266
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 1267 place count 2517 transition count 2262
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1271 place count 2513 transition count 2262
Performed 304 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 304 Pre rules applied. Total rules applied 1271 place count 2513 transition count 1958
Deduced a syphon composed of 304 places in 4 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 4 with 608 rules applied. Total rules applied 1879 place count 2209 transition count 1958
Discarding 141 places :
Symmetric choice reduction at 4 with 141 rule applications. Total rules 2020 place count 2068 transition count 1817
Iterating global reduction 4 with 141 rules applied. Total rules applied 2161 place count 2068 transition count 1817
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 2161 place count 2068 transition count 1713
Deduced a syphon composed of 104 places in 3 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 2369 place count 1964 transition count 1713
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 837
Deduced a syphon composed of 837 places in 2 ms
Reduce places removed 837 places and 0 transitions.
Iterating global reduction 4 with 1674 rules applied. Total rules applied 4043 place count 1127 transition count 876
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4245 place count 1026 transition count 942
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4333 place count 982 transition count 970
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4334 place count 982 transition count 970
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4335 place count 981 transition count 969
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4337 place count 979 transition count 969
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4337 place count 979 transition count 968
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4339 place count 978 transition count 968
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4340 place count 977 transition count 967
Applied a total of 4340 rules in 631 ms. Remains 977 /3149 variables (removed 2172) and now considering 967/2899 (removed 1932) transitions.
[2021-05-15 21:16:03] [INFO ] Flatten gal took : 32 ms
[2021-05-15 21:16:03] [INFO ] Flatten gal took : 35 ms
[2021-05-15 21:16:03] [INFO ] Input system was already deterministic with 967 transitions.
[2021-05-15 21:16:03] [INFO ] Flatten gal took : 36 ms
[2021-05-15 21:16:03] [INFO ] Flatten gal took : 34 ms
[2021-05-15 21:16:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9663274296955606539.gal : 3 ms
[2021-05-15 21:16:03] [INFO ] Time to serialize properties into /tmp/CTLFireability8379278669392794662.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability9663274296955606539.gal, -t, CGAL, -ctl, /tmp/CTLFireability8379278669392794662.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability9663274296955606539.gal -t CGAL -ctl /tmp/CTLFireability8379278669392794662.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.32208e+142,9.67275,192476,2,25177,5,839428,6,0,4873,923354,0
Converting to forward existential form...Done !
original formula: !(A(((((((((((((((((((p455==0)&&(((p2212==0)||(p2225==0))||(p2259==0)))&&(p41==0))&&(p884==0))&&(p2333==0))&&(p2797==0))&&(p2280==0))&&(p2508==0))&&(p3136==0))&&(p3084==0))&&(p1477==0))&&((p2414==0)||(p2416==0)))&&(p1317==0))&&((p689==0)||(p691==0)))&&(p1044==0))&&(((p349==0)||(p362==0))||(p396==0)))&&((p2272==0)||(p2300==0)))&&(p976==0)) U (p1140==1)))
=> equivalent forward existential formula: ([(FwdU(Init,!((p1140==1))) * (!(((((((((((((((((((p455==0)&&(((p2212==0)||(p2225==0))||(p2259==0)))&&(p41==0))&&(p884==0))&&(p2333==0))&&(p2797==0))&&(p2280==0))&&(p2508==0))&&(p3136==0))&&(p3084==0))&&(p1477==0))&&((p2414==0)||(p2416==0)))&&(p1317==0))&&((p689==0)||(p691==0)))&&(p1044==0))&&(((p349==0)||(p362==0))||(p396==0)))&&((p2272==0)||(p2300==0)))&&(p976==0))) * !((p1140==1))))] != FALSE + [FwdG(Init,!((p1140==1)))] != FALSE)
Hit Full ! (commute/partial/dont) 964/0/3
(forward)formula 0,1,10.4116,192476,1,0,12,839428,19,3,9145,923354,5
FORMULA ShieldIIPt-PT-050B-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 643 transitions
Trivial Post-agglo rules discarded 643 transitions
Performed 643 trivial Post agglomeration. Transition count delta: 643
Iterating post reduction 0 with 643 rules applied. Total rules applied 643 place count 3148 transition count 2255
Reduce places removed 643 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 646 rules applied. Total rules applied 1289 place count 2505 transition count 2252
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 1292 place count 2503 transition count 2251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1293 place count 2502 transition count 2251
Performed 301 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 301 Pre rules applied. Total rules applied 1293 place count 2502 transition count 1950
Deduced a syphon composed of 301 places in 4 ms
Reduce places removed 301 places and 0 transitions.
Iterating global reduction 4 with 602 rules applied. Total rules applied 1895 place count 2201 transition count 1950
Discarding 138 places :
Symmetric choice reduction at 4 with 138 rule applications. Total rules 2033 place count 2063 transition count 1812
Iterating global reduction 4 with 138 rules applied. Total rules applied 2171 place count 2063 transition count 1812
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 104 Pre rules applied. Total rules applied 2171 place count 2063 transition count 1708
Deduced a syphon composed of 104 places in 3 ms
Reduce places removed 104 places and 0 transitions.
Iterating global reduction 4 with 208 rules applied. Total rules applied 2379 place count 1959 transition count 1708
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 1 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 4 with 1698 rules applied. Total rules applied 4077 place count 1110 transition count 859
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4279 place count 1009 transition count 926
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 4373 place count 962 transition count 957
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4374 place count 961 transition count 956
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 4376 place count 959 transition count 956
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4376 place count 959 transition count 955
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4378 place count 958 transition count 955
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4379 place count 957 transition count 954
Applied a total of 4379 rules in 630 ms. Remains 957 /3149 variables (removed 2192) and now considering 954/2899 (removed 1945) transitions.
[2021-05-15 21:16:14] [INFO ] Flatten gal took : 39 ms
[2021-05-15 21:16:14] [INFO ] Flatten gal took : 35 ms
[2021-05-15 21:16:14] [INFO ] Input system was already deterministic with 954 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA ShieldIIPt-PT-050B-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-15 21:16:15] [INFO ] Flatten gal took : 75 ms
[2021-05-15 21:16:15] [INFO ] Flatten gal took : 70 ms
[2021-05-15 21:16:15] [INFO ] Applying decomposition
[2021-05-15 21:16:15] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph699065226184629860.txt, -o, /tmp/graph699065226184629860.bin, -w, /tmp/graph699065226184629860.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph699065226184629860.bin, -l, -1, -v, -w, /tmp/graph699065226184629860.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 21:16:15] [INFO ] Decomposing Gal with order
[2021-05-15 21:16:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:16:15] [INFO ] Removed a total of 362 redundant transitions.
[2021-05-15 21:16:15] [INFO ] Flatten gal took : 141 ms
[2021-05-15 21:16:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2021-05-15 21:16:18] [INFO ] Time to serialize gal into /tmp/CTLFireability3863767678430013080.gal : 1854 ms
[2021-05-15 21:16:18] [INFO ] Time to serialize properties into /tmp/CTLFireability6406108824152779999.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability3863767678430013080.gal, -t, CGAL, -ctl, /tmp/CTLFireability6406108824152779999.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability3863767678430013080.gal -t CGAL -ctl /tmp/CTLFireability6406108824152779999.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 21:39:10] [INFO ] Applying decomposition
[2021-05-15 21:39:10] [INFO ] Flatten gal took : 248 ms
[2021-05-15 21:39:11] [INFO ] Decomposing Gal with order
[2021-05-15 21:39:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 21:39:13] [INFO ] Removed a total of 87 redundant transitions.
[2021-05-15 21:39:13] [INFO ] Flatten gal took : 177 ms
[2021-05-15 21:39:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-15 21:39:18] [INFO ] Time to serialize gal into /tmp/CTLFireability8189240332132488804.gal : 25 ms
[2021-05-15 21:39:18] [INFO ] Time to serialize properties into /tmp/CTLFireability11321776660453580405.ctl : 20 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability8189240332132488804.gal, -t, CGAL, -ctl, /tmp/CTLFireability11321776660453580405.ctl], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability8189240332132488804.gal -t CGAL -ctl /tmp/CTLFireability11321776660453580405.ctl
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Detected timeout of ITS tools.
[2021-05-15 22:02:18] [INFO ] Flatten gal took : 574 ms
[2021-05-15 22:02:20] [INFO ] Input system was already deterministic with 2899 transitions.
[2021-05-15 22:02:20] [INFO ] Transformed 3149 places.
[2021-05-15 22:02:20] [INFO ] Transformed 2899 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-15 22:02:20] [INFO ] Time to serialize gal into /tmp/CTLFireability12741543294201133490.gal : 10 ms
[2021-05-15 22:02:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6726330040427417513.ctl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12741543294201133490.gal, -t, CGAL, -ctl, /tmp/CTLFireability6726330040427417513.ctl, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ctl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability12741543294201133490.gal -t CGAL -ctl /tmp/CTLFireability6726330040427417513.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="ShieldIIPt-PT-050B"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-050B, 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 r216-tall-162098205200490"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B 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 '
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 ;