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-162098205700871.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPt-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-162098205700871
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K 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.3K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 12:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 12:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:39 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 955K 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 ShieldPPPt-PT-050B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-050B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1622927247492

Running Version 0
[2021-06-05 21:07:29] [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-06-05 21:07:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-05 21:07:29] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2021-06-05 21:07:29] [INFO ] Transformed 3903 places.
[2021-06-05 21:07:29] [INFO ] Transformed 3553 transitions.
[2021-06-05 21:07:29] [INFO ] Found NUPN structural information;
[2021-06-05 21:07:29] [INFO ] Parsed PT model containing 3903 places and 3553 transitions in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
Support contains 719 out of 3903 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3903/3903 places, 3553/3553 transitions.
Discarding 407 places :
Symmetric choice reduction at 0 with 407 rule applications. Total rules 407 place count 3496 transition count 3146
Iterating global reduction 0 with 407 rules applied. Total rules applied 814 place count 3496 transition count 3146
Applied a total of 814 rules in 771 ms. Remains 3496 /3903 variables (removed 407) and now considering 3146/3553 (removed 407) transitions.
// Phase 1: matrix 3146 rows 3496 cols
[2021-06-05 21:07:30] [INFO ] Computed 551 place invariants in 49 ms
[2021-06-05 21:07:31] [INFO ] Implicit Places using invariants in 1097 ms returned []
// Phase 1: matrix 3146 rows 3496 cols
[2021-06-05 21:07:31] [INFO ] Computed 551 place invariants in 16 ms
[2021-06-05 21:07:35] [INFO ] Implicit Places using invariants and state equation in 3342 ms returned []
Implicit Place search using SMT with State Equation took 4494 ms to find 0 implicit places.
// Phase 1: matrix 3146 rows 3496 cols
[2021-06-05 21:07:35] [INFO ] Computed 551 place invariants in 19 ms
[2021-06-05 21:07:37] [INFO ] Dead Transitions using invariants and state equation in 2286 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3496/3903 places, 3146/3553 transitions.
[2021-06-05 21:07:37] [INFO ] Flatten gal took : 221 ms
[2021-06-05 21:07:38] [INFO ] Flatten gal took : 150 ms
[2021-06-05 21:07:38] [INFO ] Input system was already deterministic with 3146 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 1193 ms. (steps per millisecond=83 ) properties (out of 88) seen :73
Running SMT prover for 15 properties.
// Phase 1: matrix 3146 rows 3496 cols
[2021-06-05 21:07:39] [INFO ] Computed 551 place invariants in 20 ms
[2021-06-05 21:07:40] [INFO ] [Real]Absence check using 551 positive place invariants in 226 ms returned sat
[2021-06-05 21:07:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:07:41] [INFO ] [Real]Absence check using state equation in 1665 ms returned sat
[2021-06-05 21:07:42] [INFO ] Deduced a trap composed of 24 places in 877 ms of which 11 ms to minimize.
[2021-06-05 21:07:43] [INFO ] Deduced a trap composed of 17 places in 792 ms of which 4 ms to minimize.
[2021-06-05 21:07:44] [INFO ] Deduced a trap composed of 27 places in 777 ms of which 3 ms to minimize.
[2021-06-05 21:07:45] [INFO ] Deduced a trap composed of 23 places in 912 ms of which 3 ms to minimize.
[2021-06-05 21:07:46] [INFO ] Deduced a trap composed of 18 places in 772 ms of which 5 ms to minimize.
[2021-06-05 21:07:47] [INFO ] Deduced a trap composed of 43 places in 787 ms of which 1 ms to minimize.
[2021-06-05 21:07:48] [INFO ] Deduced a trap composed of 38 places in 763 ms of which 3 ms to minimize.
[2021-06-05 21:07:49] [INFO ] Deduced a trap composed of 23 places in 789 ms of which 2 ms to minimize.
[2021-06-05 21:07:50] [INFO ] Deduced a trap composed of 37 places in 775 ms of which 2 ms to minimize.
[2021-06-05 21:07:51] [INFO ] Deduced a trap composed of 33 places in 749 ms of which 2 ms to minimize.
[2021-06-05 21:07:52] [INFO ] Deduced a trap composed of 26 places in 761 ms of which 2 ms to minimize.
[2021-06-05 21:07:52] [INFO ] Deduced a trap composed of 29 places in 747 ms of which 1 ms to minimize.
[2021-06-05 21:07:53] [INFO ] Deduced a trap composed of 29 places in 776 ms of which 2 ms to minimize.
[2021-06-05 21:07:54] [INFO ] Deduced a trap composed of 18 places in 729 ms of which 2 ms to minimize.
[2021-06-05 21:07:55] [INFO ] Deduced a trap composed of 25 places in 776 ms of which 2 ms to minimize.
[2021-06-05 21:07:56] [INFO ] Deduced a trap composed of 17 places in 718 ms of which 1 ms to minimize.
[2021-06-05 21:07:57] [INFO ] Deduced a trap composed of 21 places in 705 ms of which 2 ms to minimize.
[2021-06-05 21:07:58] [INFO ] Deduced a trap composed of 30 places in 713 ms of which 1 ms to minimize.
[2021-06-05 21:07:58] [INFO ] Deduced a trap composed of 24 places in 695 ms of which 1 ms to minimize.
[2021-06-05 21:07:59] [INFO ] Deduced a trap composed of 21 places in 706 ms of which 2 ms to minimize.
[2021-06-05 21:07:59] [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-06-05 21:08:00] [INFO ] [Real]Absence check using 551 positive place invariants in 212 ms returned sat
[2021-06-05 21:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:01] [INFO ] [Real]Absence check using state equation in 1714 ms returned sat
[2021-06-05 21:08:02] [INFO ] Deduced a trap composed of 19 places in 768 ms of which 2 ms to minimize.
[2021-06-05 21:08:03] [INFO ] Deduced a trap composed of 16 places in 773 ms of which 2 ms to minimize.
[2021-06-05 21:08:04] [INFO ] Deduced a trap composed of 29 places in 749 ms of which 2 ms to minimize.
[2021-06-05 21:08:05] [INFO ] Deduced a trap composed of 27 places in 747 ms of which 2 ms to minimize.
[2021-06-05 21:08:06] [INFO ] Deduced a trap composed of 17 places in 728 ms of which 2 ms to minimize.
[2021-06-05 21:08:07] [INFO ] Deduced a trap composed of 21 places in 723 ms of which 2 ms to minimize.
[2021-06-05 21:08:08] [INFO ] Deduced a trap composed of 19 places in 747 ms of which 2 ms to minimize.
[2021-06-05 21:08:08] [INFO ] Deduced a trap composed of 29 places in 720 ms of which 2 ms to minimize.
[2021-06-05 21:08:09] [INFO ] Deduced a trap composed of 18 places in 676 ms of which 2 ms to minimize.
[2021-06-05 21:08:10] [INFO ] Deduced a trap composed of 23 places in 670 ms of which 2 ms to minimize.
[2021-06-05 21:08:11] [INFO ] Deduced a trap composed of 16 places in 649 ms of which 1 ms to minimize.
[2021-06-05 21:08:12] [INFO ] Deduced a trap composed of 21 places in 653 ms of which 2 ms to minimize.
[2021-06-05 21:08:12] [INFO ] Deduced a trap composed of 30 places in 644 ms of which 2 ms to minimize.
[2021-06-05 21:08:13] [INFO ] Deduced a trap composed of 38 places in 595 ms of which 8 ms to minimize.
[2021-06-05 21:08:14] [INFO ] Deduced a trap composed of 40 places in 595 ms of which 2 ms to minimize.
[2021-06-05 21:08:15] [INFO ] Deduced a trap composed of 33 places in 593 ms of which 1 ms to minimize.
[2021-06-05 21:08:15] [INFO ] Deduced a trap composed of 24 places in 612 ms of which 1 ms to minimize.
[2021-06-05 21:08:16] [INFO ] Deduced a trap composed of 25 places in 564 ms of which 2 ms to minimize.
[2021-06-05 21:08:17] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 2 ms to minimize.
[2021-06-05 21:08:17] [INFO ] Deduced a trap composed of 43 places in 539 ms of which 3 ms to minimize.
[2021-06-05 21:08:18] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 2 ms to minimize.
[2021-06-05 21:08:19] [INFO ] Deduced a trap composed of 33 places in 537 ms of which 1 ms to minimize.
[2021-06-05 21:08:19] [INFO ] Deduced a trap composed of 36 places in 552 ms of which 1 ms to minimize.
[2021-06-05 21:08: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 1
[2021-06-05 21:08:20] [INFO ] [Real]Absence check using 551 positive place invariants in 203 ms returned sat
[2021-06-05 21:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:22] [INFO ] [Real]Absence check using state equation in 1707 ms returned sat
[2021-06-05 21:08:22] [INFO ] Deduced a trap composed of 25 places in 773 ms of which 1 ms to minimize.
[2021-06-05 21:08:23] [INFO ] Deduced a trap composed of 25 places in 759 ms of which 2 ms to minimize.
[2021-06-05 21:08:24] [INFO ] Deduced a trap composed of 17 places in 722 ms of which 2 ms to minimize.
[2021-06-05 21:08:25] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 1 ms to minimize.
[2021-06-05 21:08:26] [INFO ] Deduced a trap composed of 31 places in 733 ms of which 2 ms to minimize.
[2021-06-05 21:08:27] [INFO ] Deduced a trap composed of 26 places in 741 ms of which 1 ms to minimize.
[2021-06-05 21:08:28] [INFO ] Deduced a trap composed of 23 places in 680 ms of which 2 ms to minimize.
[2021-06-05 21:08:28] [INFO ] Deduced a trap composed of 21 places in 673 ms of which 2 ms to minimize.
[2021-06-05 21:08:29] [INFO ] Deduced a trap composed of 20 places in 648 ms of which 1 ms to minimize.
[2021-06-05 21:08:30] [INFO ] Deduced a trap composed of 23 places in 629 ms of which 2 ms to minimize.
[2021-06-05 21:08:31] [INFO ] Deduced a trap composed of 27 places in 622 ms of which 2 ms to minimize.
[2021-06-05 21:08:31] [INFO ] Deduced a trap composed of 18 places in 649 ms of which 1 ms to minimize.
[2021-06-05 21:08:32] [INFO ] Deduced a trap composed of 28 places in 621 ms of which 8 ms to minimize.
[2021-06-05 21:08:33] [INFO ] Deduced a trap composed of 26 places in 594 ms of which 1 ms to minimize.
[2021-06-05 21:08:34] [INFO ] Deduced a trap composed of 36 places in 632 ms of which 1 ms to minimize.
[2021-06-05 21:08:34] [INFO ] Deduced a trap composed of 44 places in 636 ms of which 1 ms to minimize.
[2021-06-05 21:08:35] [INFO ] Deduced a trap composed of 26 places in 618 ms of which 2 ms to minimize.
[2021-06-05 21:08:36] [INFO ] Deduced a trap composed of 23 places in 608 ms of which 2 ms to minimize.
[2021-06-05 21:08:37] [INFO ] Deduced a trap composed of 27 places in 584 ms of which 2 ms to minimize.
[2021-06-05 21:08:37] [INFO ] Deduced a trap composed of 35 places in 546 ms of which 2 ms to minimize.
[2021-06-05 21:08:38] [INFO ] Deduced a trap composed of 32 places in 559 ms of which 2 ms to minimize.
[2021-06-05 21:08:39] [INFO ] Deduced a trap composed of 30 places in 565 ms of which 2 ms to minimize.
[2021-06-05 21:08:39] [INFO ] Deduced a trap composed of 29 places in 552 ms of which 4 ms to minimize.
[2021-06-05 21:08:42] [INFO ] Deduced a trap composed of 13 places in 2229 ms of which 3 ms to minimize.
[2021-06-05 21:08:42] [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-06-05 21:08:42] [INFO ] [Real]Absence check using 551 positive place invariants in 221 ms returned sat
[2021-06-05 21:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:08:44] [INFO ] [Real]Absence check using state equation in 1661 ms returned sat
[2021-06-05 21:08:45] [INFO ] Deduced a trap composed of 19 places in 786 ms of which 16 ms to minimize.
[2021-06-05 21:08:46] [INFO ] Deduced a trap composed of 18 places in 736 ms of which 2 ms to minimize.
[2021-06-05 21:08:46] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 2 ms to minimize.
[2021-06-05 21:08:47] [INFO ] Deduced a trap composed of 27 places in 754 ms of which 1 ms to minimize.
[2021-06-05 21:08:48] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 2 ms to minimize.
[2021-06-05 21:08:49] [INFO ] Deduced a trap composed of 36 places in 721 ms of which 2 ms to minimize.
[2021-06-05 21:08:50] [INFO ] Deduced a trap composed of 25 places in 701 ms of which 2 ms to minimize.
[2021-06-05 21:08:51] [INFO ] Deduced a trap composed of 23 places in 698 ms of which 1 ms to minimize.
[2021-06-05 21:08:51] [INFO ] Deduced a trap composed of 36 places in 699 ms of which 2 ms to minimize.
[2021-06-05 21:08:52] [INFO ] Deduced a trap composed of 33 places in 637 ms of which 1 ms to minimize.
[2021-06-05 21:08:53] [INFO ] Deduced a trap composed of 21 places in 679 ms of which 1 ms to minimize.
[2021-06-05 21:08:54] [INFO ] Deduced a trap composed of 27 places in 640 ms of which 2 ms to minimize.
[2021-06-05 21:08:55] [INFO ] Deduced a trap composed of 27 places in 665 ms of which 2 ms to minimize.
[2021-06-05 21:08:55] [INFO ] Deduced a trap composed of 22 places in 636 ms of which 2 ms to minimize.
[2021-06-05 21:08:56] [INFO ] Deduced a trap composed of 31 places in 660 ms of which 2 ms to minimize.
[2021-06-05 21:08:57] [INFO ] Deduced a trap composed of 33 places in 653 ms of which 1 ms to minimize.
[2021-06-05 21:08:58] [INFO ] Deduced a trap composed of 23 places in 616 ms of which 1 ms to minimize.
[2021-06-05 21:08:58] [INFO ] Deduced a trap composed of 30 places in 622 ms of which 1 ms to minimize.
[2021-06-05 21:08:59] [INFO ] Deduced a trap composed of 23 places in 606 ms of which 2 ms to minimize.
[2021-06-05 21:09:00] [INFO ] Deduced a trap composed of 26 places in 584 ms of which 2 ms to minimize.
[2021-06-05 21:09:01] [INFO ] Deduced a trap composed of 23 places in 592 ms of which 1 ms to minimize.
[2021-06-05 21:09:01] [INFO ] Deduced a trap composed of 35 places in 599 ms of which 1 ms to minimize.
[2021-06-05 21:09:02] [INFO ] Deduced a trap composed of 29 places in 580 ms of which 2 ms to minimize.
[2021-06-05 21:09:02] [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-06-05 21:09:03] [INFO ] [Real]Absence check using 551 positive place invariants in 207 ms returned sat
[2021-06-05 21:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:04] [INFO ] [Real]Absence check using state equation in 1723 ms returned sat
[2021-06-05 21:09:04] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:09:05] [INFO ] [Nat]Absence check using 551 positive place invariants in 234 ms returned sat
[2021-06-05 21:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:07] [INFO ] [Nat]Absence check using state equation in 1662 ms returned sat
[2021-06-05 21:09:08] [INFO ] Deduced a trap composed of 22 places in 840 ms of which 2 ms to minimize.
[2021-06-05 21:09:08] [INFO ] Deduced a trap composed of 24 places in 771 ms of which 2 ms to minimize.
[2021-06-05 21:09:09] [INFO ] Deduced a trap composed of 22 places in 752 ms of which 1 ms to minimize.
[2021-06-05 21:09:10] [INFO ] Deduced a trap composed of 27 places in 736 ms of which 2 ms to minimize.
[2021-06-05 21:09:11] [INFO ] Deduced a trap composed of 25 places in 739 ms of which 2 ms to minimize.
[2021-06-05 21:09:12] [INFO ] Deduced a trap composed of 19 places in 727 ms of which 2 ms to minimize.
[2021-06-05 21:09:13] [INFO ] Deduced a trap composed of 25 places in 737 ms of which 2 ms to minimize.
[2021-06-05 21:09:14] [INFO ] Deduced a trap composed of 31 places in 738 ms of which 1 ms to minimize.
[2021-06-05 21:09:14] [INFO ] Deduced a trap composed of 33 places in 728 ms of which 2 ms to minimize.
[2021-06-05 21:09:15] [INFO ] Deduced a trap composed of 26 places in 704 ms of which 2 ms to minimize.
[2021-06-05 21:09:16] [INFO ] Deduced a trap composed of 18 places in 680 ms of which 1 ms to minimize.
[2021-06-05 21:09:17] [INFO ] Deduced a trap composed of 21 places in 695 ms of which 2 ms to minimize.
[2021-06-05 21:09:18] [INFO ] Deduced a trap composed of 18 places in 692 ms of which 1 ms to minimize.
[2021-06-05 21:09:19] [INFO ] Deduced a trap composed of 28 places in 719 ms of which 1 ms to minimize.
[2021-06-05 21:09:19] [INFO ] Deduced a trap composed of 34 places in 649 ms of which 2 ms to minimize.
[2021-06-05 21:09:20] [INFO ] Deduced a trap composed of 33 places in 617 ms of which 2 ms to minimize.
[2021-06-05 21:09:21] [INFO ] Deduced a trap composed of 27 places in 664 ms of which 2 ms to minimize.
[2021-06-05 21:09:22] [INFO ] Deduced a trap composed of 37 places in 669 ms of which 2 ms to minimize.
[2021-06-05 21:09:22] [INFO ] Deduced a trap composed of 40 places in 669 ms of which 2 ms to minimize.
[2021-06-05 21:09:23] [INFO ] Deduced a trap composed of 37 places in 669 ms of which 2 ms to minimize.
[2021-06-05 21:09:24] [INFO ] Deduced a trap composed of 38 places in 683 ms of which 1 ms to minimize.
[2021-06-05 21:09:25] [INFO ] Deduced a trap composed of 36 places in 647 ms of which 1 ms to minimize.
[2021-06-05 21:09:25] [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-06-05 21:09:25] [INFO ] [Real]Absence check using 551 positive place invariants in 222 ms returned sat
[2021-06-05 21:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:27] [INFO ] [Real]Absence check using state equation in 1675 ms returned sat
[2021-06-05 21:09:28] [INFO ] Deduced a trap composed of 25 places in 799 ms of which 2 ms to minimize.
[2021-06-05 21:09:29] [INFO ] Deduced a trap composed of 24 places in 800 ms of which 1 ms to minimize.
[2021-06-05 21:09:30] [INFO ] Deduced a trap composed of 23 places in 763 ms of which 2 ms to minimize.
[2021-06-05 21:09:31] [INFO ] Deduced a trap composed of 18 places in 775 ms of which 2 ms to minimize.
[2021-06-05 21:09:31] [INFO ] Deduced a trap composed of 31 places in 777 ms of which 1 ms to minimize.
[2021-06-05 21:09:32] [INFO ] Deduced a trap composed of 25 places in 758 ms of which 2 ms to minimize.
[2021-06-05 21:09:33] [INFO ] Deduced a trap composed of 26 places in 792 ms of which 2 ms to minimize.
[2021-06-05 21:09:34] [INFO ] Deduced a trap composed of 23 places in 793 ms of which 2 ms to minimize.
[2021-06-05 21:09:35] [INFO ] Deduced a trap composed of 17 places in 734 ms of which 1 ms to minimize.
[2021-06-05 21:09:36] [INFO ] Deduced a trap composed of 26 places in 752 ms of which 6 ms to minimize.
[2021-06-05 21:09:37] [INFO ] Deduced a trap composed of 27 places in 738 ms of which 1 ms to minimize.
[2021-06-05 21:09:38] [INFO ] Deduced a trap composed of 17 places in 767 ms of which 2 ms to minimize.
[2021-06-05 21:09:38] [INFO ] Deduced a trap composed of 32 places in 730 ms of which 2 ms to minimize.
[2021-06-05 21:09:39] [INFO ] Deduced a trap composed of 23 places in 726 ms of which 1 ms to minimize.
[2021-06-05 21:09:40] [INFO ] Deduced a trap composed of 19 places in 679 ms of which 2 ms to minimize.
[2021-06-05 21:09:41] [INFO ] Deduced a trap composed of 20 places in 653 ms of which 2 ms to minimize.
[2021-06-05 21:09:42] [INFO ] Deduced a trap composed of 25 places in 648 ms of which 2 ms to minimize.
[2021-06-05 21:09:42] [INFO ] Deduced a trap composed of 18 places in 661 ms of which 1 ms to minimize.
[2021-06-05 21:09:43] [INFO ] Deduced a trap composed of 26 places in 615 ms of which 1 ms to minimize.
[2021-06-05 21:09:44] [INFO ] Deduced a trap composed of 27 places in 641 ms of which 2 ms to minimize.
[2021-06-05 21:09:45] [INFO ] Deduced a trap composed of 29 places in 600 ms of which 1 ms to minimize.
[2021-06-05 21:09:47] [INFO ] Deduced a trap composed of 13 places in 2061 ms of which 3 ms to minimize.
[2021-06-05 21:09:47] [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-06-05 21:09:47] [INFO ] [Real]Absence check using 551 positive place invariants in 225 ms returned sat
[2021-06-05 21:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:09:49] [INFO ] [Real]Absence check using state equation in 2046 ms returned sat
[2021-06-05 21:09:50] [INFO ] Deduced a trap composed of 18 places in 855 ms of which 2 ms to minimize.
[2021-06-05 21:09:51] [INFO ] Deduced a trap composed of 17 places in 859 ms of which 2 ms to minimize.
[2021-06-05 21:09:52] [INFO ] Deduced a trap composed of 23 places in 842 ms of which 1 ms to minimize.
[2021-06-05 21:09:53] [INFO ] Deduced a trap composed of 40 places in 876 ms of which 2 ms to minimize.
[2021-06-05 21:09:54] [INFO ] Deduced a trap composed of 20 places in 872 ms of which 2 ms to minimize.
[2021-06-05 21:09:55] [INFO ] Deduced a trap composed of 19 places in 813 ms of which 1 ms to minimize.
[2021-06-05 21:09:56] [INFO ] Deduced a trap composed of 17 places in 767 ms of which 2 ms to minimize.
[2021-06-05 21:09:57] [INFO ] Deduced a trap composed of 30 places in 766 ms of which 1 ms to minimize.
[2021-06-05 21:09:58] [INFO ] Deduced a trap composed of 16 places in 788 ms of which 1 ms to minimize.
[2021-06-05 21:09:59] [INFO ] Deduced a trap composed of 33 places in 755 ms of which 2 ms to minimize.
[2021-06-05 21:10:00] [INFO ] Deduced a trap composed of 28 places in 749 ms of which 2 ms to minimize.
[2021-06-05 21:10:01] [INFO ] Deduced a trap composed of 28 places in 736 ms of which 2 ms to minimize.
[2021-06-05 21:10:01] [INFO ] Deduced a trap composed of 27 places in 741 ms of which 2 ms to minimize.
[2021-06-05 21:10:02] [INFO ] Deduced a trap composed of 33 places in 724 ms of which 1 ms to minimize.
[2021-06-05 21:10:03] [INFO ] Deduced a trap composed of 34 places in 699 ms of which 2 ms to minimize.
[2021-06-05 21:10:04] [INFO ] Deduced a trap composed of 23 places in 691 ms of which 1 ms to minimize.
[2021-06-05 21:10:05] [INFO ] Deduced a trap composed of 29 places in 657 ms of which 2 ms to minimize.
[2021-06-05 21:10:05] [INFO ] Deduced a trap composed of 38 places in 693 ms of which 1 ms to minimize.
[2021-06-05 21:10:06] [INFO ] Deduced a trap composed of 26 places in 673 ms of which 2 ms to minimize.
[2021-06-05 21:10:07] [INFO ] Deduced a trap composed of 29 places in 673 ms of which 2 ms to minimize.
[2021-06-05 21:10:07] [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-06-05 21:10:08] [INFO ] [Real]Absence check using 551 positive place invariants in 218 ms returned sat
[2021-06-05 21:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:09] [INFO ] [Real]Absence check using state equation in 1824 ms returned sat
[2021-06-05 21:10:10] [INFO ] Deduced a trap composed of 25 places in 706 ms of which 2 ms to minimize.
[2021-06-05 21:10:11] [INFO ] Deduced a trap composed of 17 places in 687 ms of which 1 ms to minimize.
[2021-06-05 21:10:12] [INFO ] Deduced a trap composed of 16 places in 666 ms of which 2 ms to minimize.
[2021-06-05 21:10:13] [INFO ] Deduced a trap composed of 29 places in 701 ms of which 2 ms to minimize.
[2021-06-05 21:10:14] [INFO ] Deduced a trap composed of 23 places in 719 ms of which 1 ms to minimize.
[2021-06-05 21:10:14] [INFO ] Deduced a trap composed of 21 places in 656 ms of which 1 ms to minimize.
[2021-06-05 21:10:15] [INFO ] Deduced a trap composed of 24 places in 613 ms of which 2 ms to minimize.
[2021-06-05 21:10:16] [INFO ] Deduced a trap composed of 27 places in 638 ms of which 1 ms to minimize.
[2021-06-05 21:10:17] [INFO ] Deduced a trap composed of 28 places in 622 ms of which 1 ms to minimize.
[2021-06-05 21:10:17] [INFO ] Deduced a trap composed of 26 places in 575 ms of which 1 ms to minimize.
[2021-06-05 21:10:18] [INFO ] Deduced a trap composed of 20 places in 580 ms of which 1 ms to minimize.
[2021-06-05 21:10:19] [INFO ] Deduced a trap composed of 39 places in 574 ms of which 1 ms to minimize.
[2021-06-05 21:10:19] [INFO ] Deduced a trap composed of 26 places in 592 ms of which 1 ms to minimize.
[2021-06-05 21:10:20] [INFO ] Deduced a trap composed of 33 places in 556 ms of which 1 ms to minimize.
[2021-06-05 21:10:21] [INFO ] Deduced a trap composed of 30 places in 542 ms of which 1 ms to minimize.
[2021-06-05 21:10:21] [INFO ] Deduced a trap composed of 29 places in 542 ms of which 2 ms to minimize.
[2021-06-05 21:10:22] [INFO ] Deduced a trap composed of 28 places in 502 ms of which 2 ms to minimize.
[2021-06-05 21:10:23] [INFO ] Deduced a trap composed of 35 places in 496 ms of which 1 ms to minimize.
[2021-06-05 21:10:23] [INFO ] Deduced a trap composed of 21 places in 502 ms of which 1 ms to minimize.
[2021-06-05 21:10:24] [INFO ] Deduced a trap composed of 41 places in 485 ms of which 1 ms to minimize.
[2021-06-05 21:10:24] [INFO ] Deduced a trap composed of 29 places in 461 ms of which 2 ms to minimize.
[2021-06-05 21:10:25] [INFO ] Deduced a trap composed of 36 places in 490 ms of which 1 ms to minimize.
[2021-06-05 21:10:26] [INFO ] Deduced a trap composed of 46 places in 476 ms of which 1 ms to minimize.
[2021-06-05 21:10:26] [INFO ] Deduced a trap composed of 52 places in 460 ms of which 2 ms to minimize.
[2021-06-05 21:10:27] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 1 ms to minimize.
[2021-06-05 21:10:27] [INFO ] Deduced a trap composed of 34 places in 446 ms of which 1 ms to minimize.
[2021-06-05 21:10:27] [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-06-05 21:10:28] [INFO ] [Real]Absence check using 551 positive place invariants in 215 ms returned sat
[2021-06-05 21:10:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:30] [INFO ] [Real]Absence check using state equation in 1678 ms returned sat
[2021-06-05 21:10:31] [INFO ] Deduced a trap composed of 39 places in 797 ms of which 2 ms to minimize.
[2021-06-05 21:10:32] [INFO ] Deduced a trap composed of 20 places in 840 ms of which 2 ms to minimize.
[2021-06-05 21:10:33] [INFO ] Deduced a trap composed of 16 places in 813 ms of which 1 ms to minimize.
[2021-06-05 21:10:33] [INFO ] Deduced a trap composed of 25 places in 816 ms of which 2 ms to minimize.
[2021-06-05 21:10:34] [INFO ] Deduced a trap composed of 20 places in 810 ms of which 2 ms to minimize.
[2021-06-05 21:10:35] [INFO ] Deduced a trap composed of 17 places in 800 ms of which 2 ms to minimize.
[2021-06-05 21:10:36] [INFO ] Deduced a trap composed of 26 places in 790 ms of which 1 ms to minimize.
[2021-06-05 21:10:37] [INFO ] Deduced a trap composed of 25 places in 779 ms of which 1 ms to minimize.
[2021-06-05 21:10:38] [INFO ] Deduced a trap composed of 26 places in 757 ms of which 2 ms to minimize.
[2021-06-05 21:10:39] [INFO ] Deduced a trap composed of 25 places in 754 ms of which 2 ms to minimize.
[2021-06-05 21:10:40] [INFO ] Deduced a trap composed of 20 places in 775 ms of which 1 ms to minimize.
[2021-06-05 21:10:41] [INFO ] Deduced a trap composed of 29 places in 774 ms of which 1 ms to minimize.
[2021-06-05 21:10:42] [INFO ] Deduced a trap composed of 27 places in 772 ms of which 2 ms to minimize.
[2021-06-05 21:10:42] [INFO ] Deduced a trap composed of 21 places in 766 ms of which 1 ms to minimize.
[2021-06-05 21:10:43] [INFO ] Deduced a trap composed of 27 places in 773 ms of which 1 ms to minimize.
[2021-06-05 21:10:44] [INFO ] Deduced a trap composed of 22 places in 703 ms of which 2 ms to minimize.
[2021-06-05 21:10:45] [INFO ] Deduced a trap composed of 18 places in 715 ms of which 1 ms to minimize.
[2021-06-05 21:10:46] [INFO ] Deduced a trap composed of 17 places in 681 ms of which 1 ms to minimize.
[2021-06-05 21:10:47] [INFO ] Deduced a trap composed of 26 places in 628 ms of which 2 ms to minimize.
[2021-06-05 21:10:47] [INFO ] Deduced a trap composed of 25 places in 637 ms of which 1 ms to minimize.
[2021-06-05 21:10:48] [INFO ] Deduced a trap composed of 26 places in 673 ms of which 2 ms to minimize.
[2021-06-05 21:10:48] [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-06-05 21:10:49] [INFO ] [Real]Absence check using 551 positive place invariants in 216 ms returned sat
[2021-06-05 21:10:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:10:50] [INFO ] [Real]Absence check using state equation in 1685 ms returned sat
[2021-06-05 21:10:51] [INFO ] Deduced a trap composed of 28 places in 866 ms of which 2 ms to minimize.
[2021-06-05 21:10:52] [INFO ] Deduced a trap composed of 29 places in 839 ms of which 1 ms to minimize.
[2021-06-05 21:10:53] [INFO ] Deduced a trap composed of 22 places in 844 ms of which 2 ms to minimize.
[2021-06-05 21:10:54] [INFO ] Deduced a trap composed of 17 places in 821 ms of which 2 ms to minimize.
[2021-06-05 21:10:55] [INFO ] Deduced a trap composed of 29 places in 796 ms of which 2 ms to minimize.
[2021-06-05 21:10:56] [INFO ] Deduced a trap composed of 26 places in 790 ms of which 1 ms to minimize.
[2021-06-05 21:10:57] [INFO ] Deduced a trap composed of 24 places in 772 ms of which 2 ms to minimize.
[2021-06-05 21:10:58] [INFO ] Deduced a trap composed of 35 places in 763 ms of which 2 ms to minimize.
[2021-06-05 21:10:59] [INFO ] Deduced a trap composed of 25 places in 753 ms of which 2 ms to minimize.
[2021-06-05 21:11:00] [INFO ] Deduced a trap composed of 35 places in 717 ms of which 2 ms to minimize.
[2021-06-05 21:11:00] [INFO ] Deduced a trap composed of 37 places in 746 ms of which 1 ms to minimize.
[2021-06-05 21:11:01] [INFO ] Deduced a trap composed of 19 places in 717 ms of which 1 ms to minimize.
[2021-06-05 21:11:02] [INFO ] Deduced a trap composed of 29 places in 702 ms of which 1 ms to minimize.
[2021-06-05 21:11:03] [INFO ] Deduced a trap composed of 27 places in 672 ms of which 1 ms to minimize.
[2021-06-05 21:11:04] [INFO ] Deduced a trap composed of 17 places in 677 ms of which 1 ms to minimize.
[2021-06-05 21:11:05] [INFO ] Deduced a trap composed of 31 places in 660 ms of which 2 ms to minimize.
[2021-06-05 21:11:05] [INFO ] Deduced a trap composed of 31 places in 643 ms of which 2 ms to minimize.
[2021-06-05 21:11:06] [INFO ] Deduced a trap composed of 34 places in 657 ms of which 2 ms to minimize.
[2021-06-05 21:11:07] [INFO ] Deduced a trap composed of 42 places in 634 ms of which 2 ms to minimize.
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 23 places in 619 ms of which 1 ms to minimize.
[2021-06-05 21:11:08] [INFO ] Deduced a trap composed of 35 places in 631 ms of which 2 ms to minimize.
[2021-06-05 21:11:08] [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-06-05 21:11:09] [INFO ] [Real]Absence check using 551 positive place invariants in 227 ms returned sat
[2021-06-05 21:11:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:11] [INFO ] [Real]Absence check using state equation in 1991 ms returned sat
[2021-06-05 21:11:12] [INFO ] Deduced a trap composed of 21 places in 796 ms of which 2 ms to minimize.
[2021-06-05 21:11:13] [INFO ] Deduced a trap composed of 19 places in 795 ms of which 2 ms to minimize.
[2021-06-05 21:11:14] [INFO ] Deduced a trap composed of 22 places in 788 ms of which 2 ms to minimize.
[2021-06-05 21:11:15] [INFO ] Deduced a trap composed of 18 places in 763 ms of which 2 ms to minimize.
[2021-06-05 21:11:15] [INFO ] Deduced a trap composed of 27 places in 750 ms of which 2 ms to minimize.
[2021-06-05 21:11:16] [INFO ] Deduced a trap composed of 27 places in 731 ms of which 2 ms to minimize.
[2021-06-05 21:11:17] [INFO ] Deduced a trap composed of 18 places in 726 ms of which 2 ms to minimize.
[2021-06-05 21:11:18] [INFO ] Deduced a trap composed of 17 places in 724 ms of which 2 ms to minimize.
[2021-06-05 21:11:19] [INFO ] Deduced a trap composed of 23 places in 740 ms of which 2 ms to minimize.
[2021-06-05 21:11:20] [INFO ] Deduced a trap composed of 26 places in 731 ms of which 3 ms to minimize.
[2021-06-05 21:11:20] [INFO ] Deduced a trap composed of 35 places in 717 ms of which 2 ms to minimize.
[2021-06-05 21:11:21] [INFO ] Deduced a trap composed of 39 places in 683 ms of which 1 ms to minimize.
[2021-06-05 21:11:22] [INFO ] Deduced a trap composed of 33 places in 677 ms of which 2 ms to minimize.
[2021-06-05 21:11:23] [INFO ] Deduced a trap composed of 37 places in 647 ms of which 2 ms to minimize.
[2021-06-05 21:11:24] [INFO ] Deduced a trap composed of 26 places in 658 ms of which 1 ms to minimize.
[2021-06-05 21:11:24] [INFO ] Deduced a trap composed of 28 places in 680 ms of which 1 ms to minimize.
[2021-06-05 21:11:25] [INFO ] Deduced a trap composed of 33 places in 690 ms of which 1 ms to minimize.
[2021-06-05 21:11:26] [INFO ] Deduced a trap composed of 38 places in 664 ms of which 2 ms to minimize.
[2021-06-05 21:11:27] [INFO ] Deduced a trap composed of 21 places in 614 ms of which 1 ms to minimize.
[2021-06-05 21:11:28] [INFO ] Deduced a trap composed of 45 places in 652 ms of which 2 ms to minimize.
[2021-06-05 21:11:28] [INFO ] Deduced a trap composed of 44 places in 630 ms of which 2 ms to minimize.
[2021-06-05 21:11:28] [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: Broken pipe ... while checking expression at index 10
[2021-06-05 21:11:29] [INFO ] [Real]Absence check using 551 positive place invariants in 213 ms returned sat
[2021-06-05 21:11:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:31] [INFO ] [Real]Absence check using state equation in 1756 ms returned sat
[2021-06-05 21:11:32] [INFO ] Deduced a trap composed of 26 places in 823 ms of which 2 ms to minimize.
[2021-06-05 21:11:33] [INFO ] Deduced a trap composed of 31 places in 838 ms of which 2 ms to minimize.
[2021-06-05 21:11:34] [INFO ] Deduced a trap composed of 29 places in 833 ms of which 1 ms to minimize.
[2021-06-05 21:11:34] [INFO ] Deduced a trap composed of 21 places in 792 ms of which 2 ms to minimize.
[2021-06-05 21:11:35] [INFO ] Deduced a trap composed of 30 places in 785 ms of which 2 ms to minimize.
[2021-06-05 21:11:36] [INFO ] Deduced a trap composed of 38 places in 794 ms of which 2 ms to minimize.
[2021-06-05 21:11:37] [INFO ] Deduced a trap composed of 25 places in 780 ms of which 2 ms to minimize.
[2021-06-05 21:11:38] [INFO ] Deduced a trap composed of 23 places in 784 ms of which 2 ms to minimize.
[2021-06-05 21:11:39] [INFO ] Deduced a trap composed of 24 places in 821 ms of which 2 ms to minimize.
[2021-06-05 21:11:40] [INFO ] Deduced a trap composed of 30 places in 761 ms of which 2 ms to minimize.
[2021-06-05 21:11:41] [INFO ] Deduced a trap composed of 28 places in 744 ms of which 2 ms to minimize.
[2021-06-05 21:11:42] [INFO ] Deduced a trap composed of 18 places in 735 ms of which 1 ms to minimize.
[2021-06-05 21:11:42] [INFO ] Deduced a trap composed of 19 places in 719 ms of which 2 ms to minimize.
[2021-06-05 21:11:43] [INFO ] Deduced a trap composed of 31 places in 709 ms of which 1 ms to minimize.
[2021-06-05 21:11:44] [INFO ] Deduced a trap composed of 36 places in 681 ms of which 2 ms to minimize.
[2021-06-05 21:11:45] [INFO ] Deduced a trap composed of 40 places in 671 ms of which 2 ms to minimize.
[2021-06-05 21:11:46] [INFO ] Deduced a trap composed of 25 places in 656 ms of which 1 ms to minimize.
[2021-06-05 21:11:46] [INFO ] Deduced a trap composed of 42 places in 643 ms of which 1 ms to minimize.
[2021-06-05 21:11:47] [INFO ] Deduced a trap composed of 33 places in 603 ms of which 2 ms to minimize.
[2021-06-05 21:11:48] [INFO ] Deduced a trap composed of 28 places in 616 ms of which 1 ms to minimize.
[2021-06-05 21:11:49] [INFO ] Deduced a trap composed of 23 places in 615 ms of which 1 ms to minimize.
[2021-06-05 21:11: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 11
[2021-06-05 21:11:49] [INFO ] [Real]Absence check using 551 positive place invariants in 213 ms returned sat
[2021-06-05 21:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:51] [INFO ] [Real]Absence check using state equation in 1640 ms returned sat
[2021-06-05 21:11:51] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:11:51] [INFO ] [Nat]Absence check using 551 positive place invariants in 213 ms returned sat
[2021-06-05 21:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:11:53] [INFO ] [Nat]Absence check using state equation in 1698 ms returned sat
[2021-06-05 21:11:54] [INFO ] Deduced a trap composed of 26 places in 722 ms of which 1 ms to minimize.
[2021-06-05 21:11:55] [INFO ] Deduced a trap composed of 18 places in 744 ms of which 2 ms to minimize.
[2021-06-05 21:11:56] [INFO ] Deduced a trap composed of 20 places in 722 ms of which 2 ms to minimize.
[2021-06-05 21:11:57] [INFO ] Deduced a trap composed of 23 places in 743 ms of which 1 ms to minimize.
[2021-06-05 21:11:57] [INFO ] Deduced a trap composed of 30 places in 705 ms of which 1 ms to minimize.
[2021-06-05 21:11:58] [INFO ] Deduced a trap composed of 28 places in 726 ms of which 1 ms to minimize.
[2021-06-05 21:11:59] [INFO ] Deduced a trap composed of 33 places in 715 ms of which 2 ms to minimize.
[2021-06-05 21:12:00] [INFO ] Deduced a trap composed of 19 places in 708 ms of which 2 ms to minimize.
[2021-06-05 21:12:01] [INFO ] Deduced a trap composed of 20 places in 647 ms of which 1 ms to minimize.
[2021-06-05 21:12:01] [INFO ] Deduced a trap composed of 21 places in 666 ms of which 2 ms to minimize.
[2021-06-05 21:12:02] [INFO ] Deduced a trap composed of 29 places in 659 ms of which 2 ms to minimize.
[2021-06-05 21:12:03] [INFO ] Deduced a trap composed of 28 places in 697 ms of which 1 ms to minimize.
[2021-06-05 21:12:04] [INFO ] Deduced a trap composed of 27 places in 665 ms of which 2 ms to minimize.
[2021-06-05 21:12:04] [INFO ] Deduced a trap composed of 29 places in 639 ms of which 2 ms to minimize.
[2021-06-05 21:12:05] [INFO ] Deduced a trap composed of 28 places in 653 ms of which 2 ms to minimize.
[2021-06-05 21:12:06] [INFO ] Deduced a trap composed of 23 places in 623 ms of which 2 ms to minimize.
[2021-06-05 21:12:07] [INFO ] Deduced a trap composed of 20 places in 605 ms of which 1 ms to minimize.
[2021-06-05 21:12:07] [INFO ] Deduced a trap composed of 21 places in 582 ms of which 1 ms to minimize.
[2021-06-05 21:12:08] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 1 ms to minimize.
[2021-06-05 21:12:09] [INFO ] Deduced a trap composed of 25 places in 561 ms of which 2 ms to minimize.
[2021-06-05 21:12:09] [INFO ] Deduced a trap composed of 18 places in 591 ms of which 1 ms to minimize.
[2021-06-05 21:12:10] [INFO ] Deduced a trap composed of 25 places in 559 ms of which 2 ms to minimize.
[2021-06-05 21:12:11] [INFO ] Deduced a trap composed of 26 places in 577 ms of which 2 ms to minimize.
[2021-06-05 21:12:13] [INFO ] Deduced a trap composed of 13 places in 2052 ms of which 4 ms to minimize.
[2021-06-05 21:12: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 12
[2021-06-05 21:12:14] [INFO ] [Real]Absence check using 551 positive place invariants in 253 ms returned sat
[2021-06-05 21:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:18] [INFO ] [Real]Absence check using state equation in 4028 ms returned sat
[2021-06-05 21:12:18] [INFO ] Solution in real domain found non-integer solution.
[2021-06-05 21:12:18] [INFO ] [Nat]Absence check using 551 positive place invariants in 254 ms returned sat
[2021-06-05 21:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:21] [INFO ] [Nat]Absence check using state equation in 2509 ms returned sat
[2021-06-05 21:12:22] [INFO ] Deduced a trap composed of 22 places in 1085 ms of which 3 ms to minimize.
[2021-06-05 21:12:23] [INFO ] Deduced a trap composed of 21 places in 1076 ms of which 3 ms to minimize.
[2021-06-05 21:12:24] [INFO ] Deduced a trap composed of 18 places in 1015 ms of which 2 ms to minimize.
[2021-06-05 21:12:25] [INFO ] Deduced a trap composed of 23 places in 1042 ms of which 2 ms to minimize.
[2021-06-05 21:12:27] [INFO ] Deduced a trap composed of 22 places in 1005 ms of which 2 ms to minimize.
[2021-06-05 21:12:28] [INFO ] Deduced a trap composed of 25 places in 1034 ms of which 2 ms to minimize.
[2021-06-05 21:12:29] [INFO ] Deduced a trap composed of 26 places in 1022 ms of which 2 ms to minimize.
[2021-06-05 21:12:30] [INFO ] Deduced a trap composed of 29 places in 1012 ms of which 2 ms to minimize.
[2021-06-05 21:12:31] [INFO ] Deduced a trap composed of 26 places in 991 ms of which 2 ms to minimize.
[2021-06-05 21:12:32] [INFO ] Deduced a trap composed of 19 places in 960 ms of which 2 ms to minimize.
[2021-06-05 21:12:33] [INFO ] Deduced a trap composed of 23 places in 941 ms of which 2 ms to minimize.
[2021-06-05 21:12:34] [INFO ] Deduced a trap composed of 17 places in 922 ms of which 1 ms to minimize.
[2021-06-05 21:12:35] [INFO ] Deduced a trap composed of 25 places in 918 ms of which 2 ms to minimize.
[2021-06-05 21:12:36] [INFO ] Deduced a trap composed of 19 places in 909 ms of which 2 ms to minimize.
[2021-06-05 21:12:37] [INFO ] Deduced a trap composed of 28 places in 894 ms of which 2 ms to minimize.
[2021-06-05 21:12:38] [INFO ] Deduced a trap composed of 16 places in 899 ms of which 2 ms to minimize.
[2021-06-05 21:12:38] [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 13
[2021-06-05 21:12:39] [INFO ] [Real]Absence check using 551 positive place invariants in 216 ms returned sat
[2021-06-05 21:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-05 21:12:41] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2021-06-05 21:12:42] [INFO ] Deduced a trap composed of 26 places in 776 ms of which 2 ms to minimize.
[2021-06-05 21:12:42] [INFO ] Deduced a trap composed of 19 places in 770 ms of which 1 ms to minimize.
[2021-06-05 21:12:43] [INFO ] Deduced a trap composed of 26 places in 762 ms of which 2 ms to minimize.
[2021-06-05 21:12:44] [INFO ] Deduced a trap composed of 33 places in 742 ms of which 2 ms to minimize.
[2021-06-05 21:12:45] [INFO ] Deduced a trap composed of 26 places in 753 ms of which 1 ms to minimize.
[2021-06-05 21:12:46] [INFO ] Deduced a trap composed of 20 places in 707 ms of which 2 ms to minimize.
[2021-06-05 21:12:47] [INFO ] Deduced a trap composed of 23 places in 737 ms of which 1 ms to minimize.
[2021-06-05 21:12:48] [INFO ] Deduced a trap composed of 29 places in 721 ms of which 2 ms to minimize.
[2021-06-05 21:12:48] [INFO ] Deduced a trap composed of 21 places in 696 ms of which 2 ms to minimize.
[2021-06-05 21:12:49] [INFO ] Deduced a trap composed of 33 places in 690 ms of which 1 ms to minimize.
[2021-06-05 21:12:50] [INFO ] Deduced a trap composed of 27 places in 644 ms of which 1 ms to minimize.
[2021-06-05 21:12:51] [INFO ] Deduced a trap composed of 27 places in 661 ms of which 2 ms to minimize.
[2021-06-05 21:12:52] [INFO ] Deduced a trap composed of 21 places in 675 ms of which 2 ms to minimize.
[2021-06-05 21:12:52] [INFO ] Deduced a trap composed of 36 places in 646 ms of which 2 ms to minimize.
[2021-06-05 21:12:53] [INFO ] Deduced a trap composed of 18 places in 633 ms of which 1 ms to minimize.
[2021-06-05 21:12:54] [INFO ] Deduced a trap composed of 23 places in 604 ms of which 1 ms to minimize.
[2021-06-05 21:12:55] [INFO ] Deduced a trap composed of 30 places in 615 ms of which 1 ms to minimize.
[2021-06-05 21:12:55] [INFO ] Deduced a trap composed of 36 places in 604 ms of which 1 ms to minimize.
[2021-06-05 21:12:56] [INFO ] Deduced a trap composed of 33 places in 561 ms of which 2 ms to minimize.
[2021-06-05 21:12:57] [INFO ] Deduced a trap composed of 46 places in 558 ms of which 1 ms to minimize.
[2021-06-05 21:12:57] [INFO ] Deduced a trap composed of 40 places in 568 ms of which 1 ms to minimize.
[2021-06-05 21:12:58] [INFO ] Deduced a trap composed of 40 places in 540 ms of which 1 ms to minimize.
[2021-06-05 21:12:59] [INFO ] Deduced a trap composed of 38 places in 555 ms of which 2 ms to minimize.
[2021-06-05 21:12:59] [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 14
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 3495 transition count 2444
Reduce places removed 701 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 713 rules applied. Total rules applied 1414 place count 2794 transition count 2432
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1426 place count 2782 transition count 2432
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 1426 place count 2782 transition count 2113
Deduced a syphon composed of 319 places in 5 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 2064 place count 2463 transition count 2113
Discarding 89 places :
Symmetric choice reduction at 3 with 89 rule applications. Total rules 2153 place count 2374 transition count 2024
Iterating global reduction 3 with 89 rules applied. Total rules applied 2242 place count 2374 transition count 2024
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 2242 place count 2374 transition count 1961
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 2368 place count 2311 transition count 1961
Performed 831 Post agglomeration using F-continuation condition.Transition count delta: 831
Deduced a syphon composed of 831 places in 3 ms
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 3 with 1662 rules applied. Total rules applied 4030 place count 1480 transition count 1130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4031 place count 1480 transition count 1129
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4033 place count 1479 transition count 1128
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4235 place count 1378 transition count 1128
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 4309 place count 1341 transition count 1128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4310 place count 1341 transition count 1128
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4311 place count 1340 transition count 1127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4312 place count 1339 transition count 1127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4312 place count 1339 transition count 1125
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4316 place count 1337 transition count 1125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4317 place count 1336 transition count 1124
Applied a total of 4317 rules in 1296 ms. Remains 1336 /3496 variables (removed 2160) and now considering 1124/3146 (removed 2022) transitions.
[2021-06-05 21:13:00] [INFO ] Flatten gal took : 65 ms
[2021-06-05 21:13:00] [INFO ] Flatten gal took : 56 ms
[2021-06-05 21:13:00] [INFO ] Input system was already deterministic with 1124 transitions.
[2021-06-05 21:13:00] [INFO ] Flatten gal took : 51 ms
[2021-06-05 21:13:00] [INFO ] Flatten gal took : 54 ms
[2021-06-05 21:13:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15455787477796384173.gal : 22 ms
[2021-06-05 21:13:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5145497020343600213.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/CTLFireability15455787477796384173.gal, -t, CGAL, -ctl, /tmp/CTLFireability5145497020343600213.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/CTLFireability15455787477796384173.gal -t CGAL -ctl /tmp/CTLFireability5145497020343600213.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.7031e+188,17.6252,407012,2,6084,5,1.69815e+06,6,0,6468,2.61179e+06,0


Converting to forward existential form...Done !
original formula: (EF(((p805==1)||(p519==1))) * EF((((((((((A(AG((((((((((p2566==1)||((p1145==1)&&(p1172==1)))||(p1627==1))||(p1030==1))||(p1422==1))||(p2902==1))||(p3356==1))||(p1906==1))&&((((((p226==1)||(p1106==1))||(p2196==1))||(p1489==1))||((p2932==1)&&(p2965==1)))||(p944==1)))) U (((((((((((((A(((((((((((p2760==1)||(p2094==1))||(p1752==1))||(p1264==1))||((p679==1)&&(p720==1)))||(p3076==1))||(p492==1))||(p507==1))||(p2521==1))||(p2413==1)) U ((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))) * ((p3015==0)||(p3074==0))) * (p3553==0)) * (p3580==0)) * (p1026==0)) * ((p3609==0)||(p3636==0))) * (p741==0)) * ((p237==0)||(p270==0))) * (p3814==0)) * (p3279==0)) * (p1134==0)) * (p437==0)) * (p399==0)) * ((p2469==0)||(p2471==0)))) + (p2579==1)) + (p3743==1)) + ((p2371==1)&&(p2433==1))) + (p1712==1)) + (p1436==1)) + (p2573==1)) + (p1730==1)) + (p2526==1)) + (p473==1))))
=> equivalent forward existential formula: ((((((((([((FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * !(EG(!((((((((((((((!((E(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))) U (!(((((((((((p2760==1)||(p2094==1))||(p1752==1))||(p1264==1))||((p679==1)&&(p720==1)))||(p3076==1))||(p492==1))||(p507==1))||(p2521==1))||(p2413==1))) * !(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))))) + EG(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1)))))) * ((p3015==0)||(p3074==0))) * (p3553==0)) * (p3580==0)) * (p1026==0)) * ((p3609==0)||(p3636==0))) * (p741==0)) * ((p237==0)||(p270==0))) * (p3814==0)) * (p3279==0)) * (p1134==0)) * (p437==0)) * (p399==0)) * ((p2469==0)||(p2471==0))))))) * !(E(!((((((((((((((!((E(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))) U (!(((((((((((p2760==1)||(p2094==1))||(p1752==1))||(p1264==1))||((p679==1)&&(p720==1)))||(p3076==1))||(p492==1))||(p507==1))||(p2521==1))||(p2413==1))) * !(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))))) + EG(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1)))))) * ((p3015==0)||(p3074==0))) * (p3553==0)) * (p3580==0)) * (p1026==0)) * ((p3609==0)||(p3636==0))) * (p741==0)) * ((p237==0)||(p270==0))) * (p3814==0)) * (p3279==0)) * (p1134==0)) * (p437==0)) * (p399==0)) * ((p2469==0)||(p2471==0)))) U (!(!(E(TRUE U !((((((((((p2566==1)||((p1145==1)&&(p1172==1)))||(p1627==1))||(p1030==1))||(p1422==1))||(p2902==1))||(p3356==1))||(p1906==1))&&((((((p226==1)||(p1106==1))||(p2196==1))||(p1489==1))||((p2932==1)&&(p2965==1)))||(p944==1))))))) * !((((((((((((((!((E(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))) U (!(((((((((((p2760==1)||(p2094==1))||(p1752==1))||(p1264==1))||((p679==1)&&(p720==1)))||(p3076==1))||(p492==1))||(p507==1))||(p2521==1))||(p2413==1))) * !(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1))))) + EG(!(((((((p3344==1)||((p769==1)&&(p821==1)))||(p2956==1))||(p3808==1))||((p838==1)&&(p840==1)))||(p1638==1)))))) * ((p3015==0)||(p3074==0))) * (p3553==0)) * (p3580==0)) * (p1026==0)) * ((p3609==0)||(p3636==0))) * (p741==0)) * ((p237==0)||(p270==0))) * (p3814==0)) * (p3279==0)) * (p1134==0)) * (p437==0)) * (p399==0)) * ((p2469==0)||(p2471==0))))))))] != FALSE + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * (p2579==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * (p3743==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * ((p2371==1)&&(p2433==1)))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * (p1712==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * (p1436==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1)))),TRUE) * (p2573==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((p805==1)||(p519==1))
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-06-05 21:13:31] [INFO ] Flatten gal took : 51 ms
[2021-06-05 21:13:31] [INFO ] Applying decomposition
[2021-06-05 21:13:31] [INFO ] Flatten gal took : 66 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/graph9127956590277940982.txt, -o, /tmp/graph9127956590277940982.bin, -w, /tmp/graph9127956590277940982.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/graph9127956590277940982.bin, -l, -1, -v, -w, /tmp/graph9127956590277940982.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:13:31] [INFO ] Decomposing Gal with order
[2021-06-05 21:13:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:13:31] [INFO ] Removed a total of 346 redundant transitions.
[2021-06-05 21:13:31] [INFO ] Flatten gal took : 123 ms
[2021-06-05 21:13:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 288 labels/synchronizations in 70 ms.
[2021-06-05 21:13:31] [INFO ] Time to serialize gal into /tmp/CTLFireability771861581605904506.gal : 21 ms
[2021-06-05 21:13:31] [INFO ] Time to serialize properties into /tmp/CTLFireability15238041956228529957.ctl : 57 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/CTLFireability771861581605904506.gal, -t, CGAL, -ctl, /tmp/CTLFireability15238041956228529957.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/CTLFireability771861581605904506.gal -t CGAL -ctl /tmp/CTLFireability15238041956228529957.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.7031e+188,15.0292,354804,1721,67,660600,863,2164,1.71942e+06,121,4622,0


Converting to forward existential form...Done !
original formula: (EF(((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1))) * EF((((((((((A(AG((((((((((i19.u288.p2566==1)||((i9.u128.p1145==1)&&(i9.u135.p1172==1)))||(i12.i1.i0.u185.p1627==1))||(i7.u114.p1030==1))||(i11.i0.i0.u159.p1422==1))||(i22.u325.p2902==1))||(i25.u378.p3356==1))||(i14.i1.i0.u214.p1906==1))&&((((((i1.i0.i0.u21.p226==1)||(i8.u124.p1106==1))||(i16.u246.p2196==1))||(i11.i1.i3.u168.p1489==1))||((i22.u332.p2932==1)&&(i22.u334.p2965==1)))||(i6.i1.i2.u105.p944==1)))) U (((((((((((((A(((((((((((i21.i0.i1.u309.p2760==1)||(i15.i1.i1.u237.p2094==1))||(i13.i1.i0.u197.p1752==1))||(i10.i0.i0.u144.p1264==1))||((i5.i0.i0.u72.p679==1)&&(i5.i0.i0.u79.p720==1)))||(i23.i1.i0.u349.p3076==1))||(i3.u53.p492==1))||(i3.u54.p507==1))||(i19.u281.p2521==1))||(i18.i0.i0.u271.p2413==1)) U ((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))) * ((i23.i0.i1.u343.p3015==0)||(i23.i1.i0.u349.p3074==0))) * (i27.u402.p3553==0)) * (i27.u403.p3580==0)) * (i7.u115.p1026==0)) * ((i28.i0.i0.u406.p3609==0)||(i28.i0.i2.u413.p3636==0))) * (i5.i0.i0.u80.p741==0)) * ((i1.i0.i2.u25.p237==0)||(i1.i0.i1.u27.p270==0))) * (i29.i0.i2.u431.p3814==0)) * (i24.i1.i2.u369.p3279==0)) * (i9.u126.p1134==0)) * (i2.u44.p437==0)) * (i2.u43.p399==0)) * ((i18.i1.i2.u278.p2469==0)||(i18.i1.i1.u279.p2471==0)))) + (i19.u290.p2579==1)) + (i28.i1.i2.u422.p3743==1)) + ((i18.i0.i0.u264.p2371==1)&&(i18.i0.i3.u272.p2433==1))) + (i13.i0.i0.u194.p1712==1)) + (i11.i0.i1.u160.p1436==1)) + (i19.u289.p2573==1)) + (i13.i0.i0.u195.p1730==1)) + (i19.u282.p2526==1)) + (i3.u52.p473==1))))
=> equivalent forward existential formula: ((((((((([((FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * !(EG(!((((((((((((((!((E(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))) U (!(((((((((((i21.i0.i1.u309.p2760==1)||(i15.i1.i1.u237.p2094==1))||(i13.i1.i0.u197.p1752==1))||(i10.i0.i0.u144.p1264==1))||((i5.i0.i0.u72.p679==1)&&(i5.i0.i0.u79.p720==1)))||(i23.i1.i0.u349.p3076==1))||(i3.u53.p492==1))||(i3.u54.p507==1))||(i19.u281.p2521==1))||(i18.i0.i0.u271.p2413==1))) * !(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))))) + EG(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1)))))) * ((i23.i0.i1.u343.p3015==0)||(i23.i1.i0.u349.p3074==0))) * (i27.u402.p3553==0)) * (i27.u403.p3580==0)) * (i7.u115.p1026==0)) * ((i28.i0.i0.u406.p3609==0)||(i28.i0.i2.u413.p3636==0))) * (i5.i0.i0.u80.p741==0)) * ((i1.i0.i2.u25.p237==0)||(i1.i0.i1.u27.p270==0))) * (i29.i0.i2.u431.p3814==0)) * (i24.i1.i2.u369.p3279==0)) * (i9.u126.p1134==0)) * (i2.u44.p437==0)) * (i2.u43.p399==0)) * ((i18.i1.i2.u278.p2469==0)||(i18.i1.i1.u279.p2471==0))))))) * !(E(!((((((((((((((!((E(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))) U (!(((((((((((i21.i0.i1.u309.p2760==1)||(i15.i1.i1.u237.p2094==1))||(i13.i1.i0.u197.p1752==1))||(i10.i0.i0.u144.p1264==1))||((i5.i0.i0.u72.p679==1)&&(i5.i0.i0.u79.p720==1)))||(i23.i1.i0.u349.p3076==1))||(i3.u53.p492==1))||(i3.u54.p507==1))||(i19.u281.p2521==1))||(i18.i0.i0.u271.p2413==1))) * !(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))))) + EG(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1)))))) * ((i23.i0.i1.u343.p3015==0)||(i23.i1.i0.u349.p3074==0))) * (i27.u402.p3553==0)) * (i27.u403.p3580==0)) * (i7.u115.p1026==0)) * ((i28.i0.i0.u406.p3609==0)||(i28.i0.i2.u413.p3636==0))) * (i5.i0.i0.u80.p741==0)) * ((i1.i0.i2.u25.p237==0)||(i1.i0.i1.u27.p270==0))) * (i29.i0.i2.u431.p3814==0)) * (i24.i1.i2.u369.p3279==0)) * (i9.u126.p1134==0)) * (i2.u44.p437==0)) * (i2.u43.p399==0)) * ((i18.i1.i2.u278.p2469==0)||(i18.i1.i1.u279.p2471==0)))) U (!(!(E(TRUE U !((((((((((i19.u288.p2566==1)||((i9.u128.p1145==1)&&(i9.u135.p1172==1)))||(i12.i1.i0.u185.p1627==1))||(i7.u114.p1030==1))||(i11.i0.i0.u159.p1422==1))||(i22.u325.p2902==1))||(i25.u378.p3356==1))||(i14.i1.i0.u214.p1906==1))&&((((((i1.i0.i0.u21.p226==1)||(i8.u124.p1106==1))||(i16.u246.p2196==1))||(i11.i1.i3.u168.p1489==1))||((i22.u332.p2932==1)&&(i22.u334.p2965==1)))||(i6.i1.i2.u105.p944==1))))))) * !((((((((((((((!((E(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))) U (!(((((((((((i21.i0.i1.u309.p2760==1)||(i15.i1.i1.u237.p2094==1))||(i13.i1.i0.u197.p1752==1))||(i10.i0.i0.u144.p1264==1))||((i5.i0.i0.u72.p679==1)&&(i5.i0.i0.u79.p720==1)))||(i23.i1.i0.u349.p3076==1))||(i3.u53.p492==1))||(i3.u54.p507==1))||(i19.u281.p2521==1))||(i18.i0.i0.u271.p2413==1))) * !(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1))))) + EG(!(((((((i25.u377.p3344==1)||((i5.i1.i0.u84.p769==1)&&(i5.i1.i0.u89.p821==1)))||(i22.u334.p2956==1))||(i29.i0.i2.u430.p3808==1))||((i6.i0.i0.u91.p838==1)&&(i6.i0.i1.u92.p840==1)))||(i12.i1.i2.u186.p1638==1)))))) * ((i23.i0.i1.u343.p3015==0)||(i23.i1.i0.u349.p3074==0))) * (i27.u402.p3553==0)) * (i27.u403.p3580==0)) * (i7.u115.p1026==0)) * ((i28.i0.i0.u406.p3609==0)||(i28.i0.i2.u413.p3636==0))) * (i5.i0.i0.u80.p741==0)) * ((i1.i0.i2.u25.p237==0)||(i1.i0.i1.u27.p270==0))) * (i29.i0.i2.u431.p3814==0)) * (i24.i1.i2.u369.p3279==0)) * (i9.u126.p1134==0)) * (i2.u44.p437==0)) * (i2.u43.p399==0)) * ((i18.i1.i2.u278.p2469==0)||(i18.i1.i1.u279.p2471==0))))))))] != FALSE + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i19.u290.p2579==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i28.i1.i2.u422.p3743==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * ((i18.i0.i0.u264.p2371==1)&&(i18.i0.i3.u272.p2433==1)))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i13.i0.i0.u194.p1712==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i11.i0.i1.u160.p1436==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i19.u289.p2573==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i13.i0.i0.u195.p1730==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i19.u282.p2526==1))] != FALSE) + [(FwdU((Init * E(TRUE U ((i5.i1.i2.u88.p805==1)||(i4.i0.i0.u55.p519==1)))),TRUE) * (i3.u52.p473==1))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t0, i0.i0.t1, i0.i0.t2, i0.i0.i2.u1.t298, i0.i1.t3, i0.i1.t4, i0.i1.t5, i0.i1.i1.u10.t304, i1.i0.t6, i1.i0.i0.u21.t192, i1.i0.i2.t8, i1.i0.i3.u18.t308, i1.i1.t9, i1.i1.t10, i1.i1.t11, i1.i1.i1.t611, i1.i1.i2.t614, i1.i1.i2.u29.t314, i2.t14, i2.u39.t12, i2.u42.t620, i2.u43.t190, i2.u38.t318, i2.u40.t13, i2.u44.t189, i3.t634, i3.t626, i3.t17, i3.t16, i3.t15, i3.u53.t242, i3.u45.t324, i3.u52.t187, i3.u54.t186, i4.i0.t18, i4.i0.t19, i4.i0.t20, i4.i0.t330, i4.i0.i0.u56.t333, i4.i1.t21, i4.i1.t22, i4.i1.t23, i4.i1.i2.u64.t338, i5.i0.t24, i5.i0.i0.t344, i5.i0.i0.u80.t184, i5.i0.i1.t26, i5.i0.i2.u75.t25, i5.i1.t28, i5.i1.i0.u86.t29, i5.i1.i1.u81.t348, i5.i1.i1.u82.t27, i5.i1.i2.u87.t260, i6.i0.t30, i6.i0.t31, i6.i0.t244, i6.i0.i2.u90.t353, i6.i1.t32, i6.i1.t33, i6.i1.t34, i6.i1.t358, i6.i1.i2.t359, i6.i1.i2.u105.t245, i7.t179, i7.t37, i7.t36, i7.t35, i7.u115.t181, i8.t368, i8.t40, i8.t39, i8.t38, i8.u124.t177, i9.t372, i9.t43, i9.t42, i9.t41, i9.u127.t373, i10.i0.t45, i10.i0.i0.t44, i10.i0.i0.u144.t174, i10.i0.i1.t46, i10.i0.i1.u137.t381, i10.i1.t47, i10.i1.t48, i10.i1.t49, i10.i1.i2.u146.t387, i11.i0.t51, i11.i0.i0.u155.t50, i11.i0.i0.u159.t173, i11.i0.i1.u154.t393, i11.i0.i1.u160.t762, i11.i1.t53, i11.i1.t54, i11.i1.t55, i11.i1.i0.u158.t52, i11.i1.i3.u168.t400, i12.i0.t56, i12.i0.t57, i12.i0.t58, i12.i0.i1.u170.t404, i12.i1.t61, i12.i1.i0.t60, i12.i1.i0.u185.t172, i12.i1.i1.t59, i12.i1.i2.u186.t171, i13.i0.t63, i13.i0.i0.t62, i13.i0.i0.u194.t170, i13.i0.i0.u195.t169, i13.i0.i1.u188.t414, i13.i0.i1.u193.t64, i13.i1.t65, i13.i1.t66, i13.i1.t67, i13.i1.t415, i13.i1.i0.u198.t421, i14.i0.t68, i14.i0.t69, i14.i0.t70, i14.i0.i2.u206.t426, i14.i1.t71, i14.i1.t72, i14.i1.t73, i14.i1.t427, i14.i1.i1.u215.t433, i15.i0.t74, i15.i0.t75, i15.i0.t76, i15.i0.i2.u223.t437, i15.i1.t79, i15.i1.i0.u231.t444, i15.i1.i0.u232.t77, i15.i1.i1.t78, i15.i1.i1.u237.t442, i16.t870, i16.t82, i16.t81, i16.t80, i16.u240.t862, i16.u246.t167, i16.u239.t450, i17.i0.t83, i17.i0.t84, i17.i0.t85, i17.i0.i1.u248.t455, i17.i1.t86, i17.i1.t87, i17.i1.t88, i17.i1.i2.u256.t460, i18.i0.t89, i18.i0.t90, i18.i0.t91, i18.i0.t165, i18.i0.i0.u264.t166, i18.i0.i0.u271.t466, i18.i1.t92, i18.i1.t93, i18.i1.t249, i18.i1.i2.u273.t470, i19.t473, i19.t95, i19.t94, i19.u282.t163, i19.u288.t162, i19.u287.t96, i19.u289.t160, i20.i0.t97, i20.i0.t98, i20.i0.t99, i20.i0.i2.u292.t481, i20.i1.t100, i20.i1.t101, i20.i1.t102, i20.i1.i2.u300.t487, i21.i0.t104, i21.i0.t105, i21.i0.i1.u309.t158, i21.i0.i2.u308.t492, i21.i1.t106, i21.i1.t107, i21.i1.t108, i21.i1.i2.u317.t498, i22.t986, i22.t111, i22.t110, i22.t109, i22.u327.t978, i22.u334.t251, i22.u326.t503, i23.i0.t112, i23.i0.t113, i23.i0.t114, i23.i0.i0.u336.t510, i23.i1.t115, i23.i1.t116, i23.i1.t280, i23.i1.i0.t513, i23.i1.i0.u346.t516, i24.i0.t117, i24.i0.t118, i24.i0.t119, i24.i0.i1.u354.t521, i24.i1.t120, i24.i1.t121, i24.i1.t122, i24.i1.i2.u362.t527, i24.i1.i2.u369.t153, i25.t125, i25.t124, i25.t123, i25.u377.t152, i25.u370.t532, i25.u378.t151, i26.i0.t126, i26.i0.t127, i26.i0.t128, i26.i0.i2.u379.t538, i26.i1.t129, i26.i1.t130, i26.i1.t131, i26.i1.i1.u387.t543, i27.t134, i27.t133, i27.t132, i27.u402.t150, i27.u403.t1078, i27.u395.t548, i28.i0.t135, i28.i0.t136, i28.i0.t137, i28.i0.i0.u405.t552, i28.i1.t138, i28.i1.i0.u418.t139, i28.i1.i1.t140, i28.i1.i2.u415.t557, i28.i1.i2.u421.t282, i29.i0.t142, i29.i0.i0.u424.t141, i29.i0.i0.u424.t1106, i29.i0.i1.t1110, i29.i0.i1.t143, i29.i0.i1.u423.t563, i29.i0.i2.t145, i29.i1.i0.t1123, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/677/245/922
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 674 transitions
Trivial Post-agglo rules discarded 674 transitions
Performed 674 trivial Post agglomeration. Transition count delta: 674
Iterating post reduction 0 with 674 rules applied. Total rules applied 674 place count 3495 transition count 2471
Reduce places removed 674 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 1 with 695 rules applied. Total rules applied 1369 place count 2821 transition count 2450
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 1390 place count 2800 transition count 2450
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 1390 place count 2800 transition count 2131
Deduced a syphon composed of 319 places in 4 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 2028 place count 2481 transition count 2131
Discarding 94 places :
Symmetric choice reduction at 3 with 94 rule applications. Total rules 2122 place count 2387 transition count 2037
Iterating global reduction 3 with 94 rules applied. Total rules applied 2216 place count 2387 transition count 2037
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 2216 place count 2387 transition count 1966
Deduced a syphon composed of 71 places in 3 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 2358 place count 2316 transition count 1966
Performed 801 Post agglomeration using F-continuation condition.Transition count delta: 801
Deduced a syphon composed of 801 places in 2 ms
Reduce places removed 801 places and 0 transitions.
Iterating global reduction 3 with 1602 rules applied. Total rules applied 3960 place count 1515 transition count 1165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3961 place count 1515 transition count 1164
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3963 place count 1514 transition count 1163
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4165 place count 1413 transition count 1163
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 4227 place count 1382 transition count 1163
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 4230 place count 1382 transition count 1163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4231 place count 1381 transition count 1162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4232 place count 1380 transition count 1162
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4232 place count 1380 transition count 1160
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4236 place count 1378 transition count 1160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4237 place count 1377 transition count 1159
Applied a total of 4237 rules in 979 ms. Remains 1377 /3496 variables (removed 2119) and now considering 1159/3146 (removed 1987) transitions.
[2021-06-05 21:14:02] [INFO ] Flatten gal took : 41 ms
[2021-06-05 21:14:02] [INFO ] Flatten gal took : 47 ms
[2021-06-05 21:14:03] [INFO ] Input system was already deterministic with 1159 transitions.
[2021-06-05 21:14:03] [INFO ] Flatten gal took : 46 ms
[2021-06-05 21:14:03] [INFO ] Flatten gal took : 46 ms
[2021-06-05 21:14:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14769563918333266055.gal : 6 ms
[2021-06-05 21:14:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15950248089391727534.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/CTLFireability14769563918333266055.gal, -t, CGAL, -ctl, /tmp/CTLFireability15950248089391727534.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/CTLFireability14769563918333266055.gal -t CGAL -ctl /tmp/CTLFireability15950248089391727534.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2021-06-05 21:14:33] [INFO ] Flatten gal took : 44 ms
[2021-06-05 21:14:33] [INFO ] Applying decomposition
[2021-06-05 21:14:33] [INFO ] Flatten gal took : 43 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/graph10905565734972294427.txt, -o, /tmp/graph10905565734972294427.bin, -w, /tmp/graph10905565734972294427.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/graph10905565734972294427.bin, -l, -1, -v, -w, /tmp/graph10905565734972294427.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:14:33] [INFO ] Decomposing Gal with order
[2021-06-05 21:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:14:33] [INFO ] Removed a total of 337 redundant transitions.
[2021-06-05 21:14:33] [INFO ] Flatten gal took : 77 ms
[2021-06-05 21:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 282 labels/synchronizations in 44 ms.
[2021-06-05 21:14:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12256380547497976062.gal : 13 ms
[2021-06-05 21:14:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8452048704436248787.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/CTLFireability12256380547497976062.gal, -t, CGAL, -ctl, /tmp/CTLFireability8452048704436248787.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/CTLFireability12256380547497976062.gal -t CGAL -ctl /tmp/CTLFireability8452048704436248787.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 720 transitions
Trivial Post-agglo rules discarded 720 transitions
Performed 720 trivial Post agglomeration. Transition count delta: 720
Iterating post reduction 0 with 720 rules applied. Total rules applied 720 place count 3495 transition count 2425
Reduce places removed 720 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 728 rules applied. Total rules applied 1448 place count 2775 transition count 2417
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 1456 place count 2767 transition count 2417
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 318 Pre rules applied. Total rules applied 1456 place count 2767 transition count 2099
Deduced a syphon composed of 318 places in 5 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 2092 place count 2449 transition count 2099
Discarding 99 places :
Symmetric choice reduction at 3 with 99 rule applications. Total rules 2191 place count 2350 transition count 2000
Iterating global reduction 3 with 99 rules applied. Total rules applied 2290 place count 2350 transition count 2000
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 2290 place count 2350 transition count 1923
Deduced a syphon composed of 77 places in 4 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 2444 place count 2273 transition count 1923
Performed 844 Post agglomeration using F-continuation condition.Transition count delta: 844
Deduced a syphon composed of 844 places in 2 ms
Reduce places removed 844 places and 0 transitions.
Iterating global reduction 3 with 1688 rules applied. Total rules applied 4132 place count 1429 transition count 1079
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4133 place count 1429 transition count 1078
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4135 place count 1428 transition count 1077
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4337 place count 1327 transition count 1077
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 4417 place count 1287 transition count 1077
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4418 place count 1286 transition count 1076
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4419 place count 1285 transition count 1076
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4419 place count 1285 transition count 1074
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4423 place count 1283 transition count 1074
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4424 place count 1282 transition count 1073
Applied a total of 4424 rules in 888 ms. Remains 1282 /3496 variables (removed 2214) and now considering 1073/3146 (removed 2073) transitions.
[2021-06-05 21:15:04] [INFO ] Flatten gal took : 29 ms
[2021-06-05 21:15:04] [INFO ] Flatten gal took : 33 ms
[2021-06-05 21:15:04] [INFO ] Input system was already deterministic with 1073 transitions.
[2021-06-05 21:15:04] [INFO ] Flatten gal took : 33 ms
[2021-06-05 21:15:04] [INFO ] Flatten gal took : 33 ms
[2021-06-05 21:15:04] [INFO ] Time to serialize gal into /tmp/CTLFireability17411082403739930793.gal : 4 ms
[2021-06-05 21:15:04] [INFO ] Time to serialize properties into /tmp/CTLFireability2195048004298748579.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/CTLFireability17411082403739930793.gal, -t, CGAL, -ctl, /tmp/CTLFireability2195048004298748579.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/CTLFireability17411082403739930793.gal -t CGAL -ctl /tmp/CTLFireability2195048004298748579.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.31849e+183,4.81905,111152,2,6930,5,462557,6,0,6199,615340,0


Converting to forward existential form...Done !
original formula: EF(EG(((((((((p1754==1)||(p1187==1))||(p901==1))||(p1565==1))||(p2447==1))||(p330==1))||(p3342==1))||(((((((p1819==0)&&(p1203==0))&&(p3347==0))&&(p1126==0))&&(p976==0))&&((((((p2046==1)||(p830==1))||(p729==1))||(p2478==1))||(p3454==1))||((p1002==1)&&(p1112==1))))&&((p3700==0)||(p3747==0))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((((p1754==1)||(p1187==1))||(p901==1))||(p1565==1))||(p2447==1))||(p330==1))||(p3342==1))||(((((((p1819==0)&&(p1203==0))&&(p3347==0))&&(p1126==0))&&(p976==0))&&((((((p2046==1)||(p830==1))||(p729==1))||(p2478==1))||(p3454==1))||((p1002==1)&&(p1112==1))))&&((p3700==0)||(p3747==0)))))] != FALSE
Hit Full ! (commute/partial/dont) 1022/0/51
(forward)formula 0,1,27.428,570624,1,0,8,4.16648e+06,19,2,31688,729554,8
FORMULA ShieldPPPt-PT-050B-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 738 transitions
Trivial Post-agglo rules discarded 738 transitions
Performed 738 trivial Post agglomeration. Transition count delta: 738
Iterating post reduction 0 with 738 rules applied. Total rules applied 738 place count 3495 transition count 2407
Reduce places removed 738 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 739 rules applied. Total rules applied 1477 place count 2757 transition count 2406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1478 place count 2756 transition count 2406
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 1478 place count 2756 transition count 2085
Deduced a syphon composed of 321 places in 4 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 2120 place count 2435 transition count 2085
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 2222 place count 2333 transition count 1983
Iterating global reduction 3 with 102 rules applied. Total rules applied 2324 place count 2333 transition count 1983
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 2324 place count 2333 transition count 1904
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 2482 place count 2254 transition count 1904
Performed 852 Post agglomeration using F-continuation condition.Transition count delta: 852
Deduced a syphon composed of 852 places in 2 ms
Reduce places removed 852 places and 0 transitions.
Iterating global reduction 3 with 1704 rules applied. Total rules applied 4186 place count 1402 transition count 1052
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4187 place count 1402 transition count 1051
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4189 place count 1401 transition count 1050
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4391 place count 1300 transition count 1050
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 4487 place count 1252 transition count 1050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4488 place count 1251 transition count 1049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4489 place count 1250 transition count 1049
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4489 place count 1250 transition count 1047
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4493 place count 1248 transition count 1047
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4494 place count 1247 transition count 1046
Applied a total of 4494 rules in 869 ms. Remains 1247 /3496 variables (removed 2249) and now considering 1046/3146 (removed 2100) transitions.
[2021-06-05 21:15:33] [INFO ] Flatten gal took : 29 ms
[2021-06-05 21:15:33] [INFO ] Flatten gal took : 31 ms
[2021-06-05 21:15:33] [INFO ] Input system was already deterministic with 1046 transitions.
[2021-06-05 21:15:33] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:15:33] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:15:33] [INFO ] Time to serialize gal into /tmp/CTLFireability15791030790098470106.gal : 4 ms
[2021-06-05 21:15:33] [INFO ] Time to serialize properties into /tmp/CTLFireability5277277248079028031.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/CTLFireability15791030790098470106.gal, -t, CGAL, -ctl, /tmp/CTLFireability5277277248079028031.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/CTLFireability15791030790098470106.gal -t CGAL -ctl /tmp/CTLFireability5277277248079028031.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,3.65083e+179,2.23236,55988,2,4098,5,228211,6,0,6037,262470,0


Converting to forward existential form...Done !
original formula: !(EF(((p3316==1)&&(p3318==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((p3316==1)&&(p3318==1)))] = FALSE
(forward)formula 0,0,2.23622,55988,1,0,7,228211,8,1,6043,262470,1
FORMULA ShieldPPPt-PT-050B-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 725 transitions
Trivial Post-agglo rules discarded 725 transitions
Performed 725 trivial Post agglomeration. Transition count delta: 725
Iterating post reduction 0 with 725 rules applied. Total rules applied 725 place count 3495 transition count 2420
Reduce places removed 725 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 729 rules applied. Total rules applied 1454 place count 2770 transition count 2416
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1458 place count 2766 transition count 2416
Performed 318 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 318 Pre rules applied. Total rules applied 1458 place count 2766 transition count 2098
Deduced a syphon composed of 318 places in 4 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 2094 place count 2448 transition count 2098
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 2194 place count 2348 transition count 1998
Iterating global reduction 3 with 100 rules applied. Total rules applied 2294 place count 2348 transition count 1998
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 2294 place count 2348 transition count 1922
Deduced a syphon composed of 76 places in 4 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 2446 place count 2272 transition count 1922
Performed 849 Post agglomeration using F-continuation condition.Transition count delta: 849
Deduced a syphon composed of 849 places in 2 ms
Reduce places removed 849 places and 0 transitions.
Iterating global reduction 3 with 1698 rules applied. Total rules applied 4144 place count 1423 transition count 1073
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4145 place count 1423 transition count 1072
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4147 place count 1422 transition count 1071
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4349 place count 1321 transition count 1071
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 4437 place count 1277 transition count 1071
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4438 place count 1277 transition count 1071
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4439 place count 1276 transition count 1070
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4440 place count 1275 transition count 1070
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4440 place count 1275 transition count 1068
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4444 place count 1273 transition count 1068
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4445 place count 1272 transition count 1067
Applied a total of 4445 rules in 902 ms. Remains 1272 /3496 variables (removed 2224) and now considering 1067/3146 (removed 2079) transitions.
[2021-06-05 21:15:36] [INFO ] Flatten gal took : 29 ms
[2021-06-05 21:15:36] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:15:36] [INFO ] Input system was already deterministic with 1067 transitions.
[2021-06-05 21:15:36] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:15:36] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:15:36] [INFO ] Time to serialize gal into /tmp/CTLFireability7848357688265588905.gal : 5 ms
[2021-06-05 21:15:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3760484120469783784.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/CTLFireability7848357688265588905.gal, -t, CGAL, -ctl, /tmp/CTLFireability3760484120469783784.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/CTLFireability7848357688265588905.gal -t CGAL -ctl /tmp/CTLFireability3760484120469783784.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,2.00986e+182,3.61453,86604,2,5553,5,366507,6,0,6154,448783,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-06-05 21:16:07] [INFO ] Flatten gal took : 34 ms
[2021-06-05 21:16:07] [INFO ] Applying decomposition
[2021-06-05 21:16:07] [INFO ] Flatten gal took : 33 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/graph447552241352710989.txt, -o, /tmp/graph447552241352710989.bin, -w, /tmp/graph447552241352710989.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/graph447552241352710989.bin, -l, -1, -v, -w, /tmp/graph447552241352710989.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:16:07] [INFO ] Decomposing Gal with order
[2021-06-05 21:16:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:16:07] [INFO ] Removed a total of 306 redundant transitions.
[2021-06-05 21:16:07] [INFO ] Flatten gal took : 55 ms
[2021-06-05 21:16:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 294 labels/synchronizations in 12 ms.
[2021-06-05 21:16:07] [INFO ] Time to serialize gal into /tmp/CTLFireability11924360505186080576.gal : 11 ms
[2021-06-05 21:16:07] [INFO ] Time to serialize properties into /tmp/CTLFireability16600375747274138326.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/CTLFireability11924360505186080576.gal, -t, CGAL, -ctl, /tmp/CTLFireability16600375747274138326.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/CTLFireability11924360505186080576.gal -t CGAL -ctl /tmp/CTLFireability16600375747274138326.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,2.00986e+182,6.44677,158444,788,73,269454,719,1340,614554,106,5165,0


Converting to forward existential form...Done !
original formula: !(AG(A(AG(A(((((i19.u283.p2745==1)||(i12.u182.p1791==1))||(i5.i0.i2.u78.p822==1))||(i19.u277.p2684==1)) U (((((i14.i0.i0.u203.p1992==1)&&(i14.i0.i2.u209.p2019==1))||((i14.i0.i3.u207.p2003==1)&&(i14.i1.i1.u218.p2113==1)))||(i1.i1.i0.u23.p275==1))||(i7.u109.p1102==1)))) U EF(((((((((i4.i1.i0.u69.p730==1)||(i23.i0.i2.u332.p3182==1))||((i21.u300.p2912==1)&&(i21.u307.p2953==1)))||((i27.i0.i0.u392.p3764==1)&&(i27.i0.i1.u393.p3766==1)))||(i13.i1.i0.u199.p1962==1))||(i5.i1.i0.u84.p884==1))||((i17.i1.i2.u257.p2469==1)&&(i17.i1.i1.u258.p2471==1)))||(i25.i0.i1.u365.p3484==1))))))
=> equivalent forward existential formula: ([((FwdU(FwdU(Init,TRUE),!(E(TRUE U ((((((((i4.i1.i0.u69.p730==1)||(i23.i0.i2.u332.p3182==1))||((i21.u300.p2912==1)&&(i21.u307.p2953==1)))||((i27.i0.i0.u392.p3764==1)&&(i27.i0.i1.u393.p3766==1)))||(i13.i1.i0.u199.p1962==1))||(i5.i1.i0.u84.p884==1))||((i17.i1.i2.u257.p2469==1)&&(i17.i1.i1.u258.p2471==1)))||(i25.i0.i1.u365.p3484==1))))) * !(!(E(TRUE U !(!((E(!((((((i14.i0.i0.u203.p1992==1)&&(i14.i0.i2.u209.p2019==1))||((i14.i0.i3.u207.p2003==1)&&(i14.i1.i1.u218.p2113==1)))||(i1.i1.i0.u23.p275==1))||(i7.u109.p1102==1))) U (!(((((i19.u283.p2745==1)||(i12.u182.p1791==1))||(i5.i0.i2.u78.p822==1))||(i19.u277.p2684==1))) * !((((((i14.i0.i0.u203.p1992==1)&&(i14.i0.i2.u209.p2019==1))||((i14.i0.i3.u207.p2003==1)&&(i14.i1.i1.u218.p2113==1)))||(i1.i1.i0.u23.p275==1))||(i7.u109.p1102==1))))) + EG(!((((((i14.i0.i0.u203.p1992==1)&&(i14.i0.i2.u209.p2019==1))||((i14.i0.i3.u207.p2003==1)&&(i14.i1.i1.u218.p2113==1)))||(i1.i1.i0.u23.p275==1))||(i7.u109.p1102==1))))))))))) * !(E(TRUE U ((((((((i4.i1.i0.u69.p730==1)||(i23.i0.i2.u332.p3182==1))||((i21.u300.p2912==1)&&(i21.u307.p2953==1)))||((i27.i0.i0.u392.p3764==1)&&(i27.i0.i1.u393.p3766==1)))||(i13.i1.i0.u199.p1962==1))||(i5.i1.i0.u84.p884==1))||((i17.i1.i2.u257.p2469==1)&&(i17.i1.i1.u258.p2471==1)))||(i25.i0.i1.u365.p3484==1)))))] != FALSE + [FwdG(FwdU(Init,TRUE),!(E(TRUE U ((((((((i4.i1.i0.u69.p730==1)||(i23.i0.i2.u332.p3182==1))||((i21.u300.p2912==1)&&(i21.u307.p2953==1)))||((i27.i0.i0.u392.p3764==1)&&(i27.i0.i1.u393.p3766==1)))||(i13.i1.i0.u199.p1962==1))||(i5.i1.i0.u84.p884==1))||((i17.i1.i2.u257.p2469==1)&&(i17.i1.i1.u258.p2471==1)))||(i25.i0.i1.u365.p3484==1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions i0.t2, i0.t1, i0.t0, i0.u1.t220, i1.i0.t3, i1.i0.t4, i1.i0.t5, i1.i0.i2.u10.t225, i1.i1.t6, i1.i1.i0.u18.t230, i1.i1.i0.u23.t158, i1.i1.i1.u21.t7, i1.i1.i2.u22.t8, i2.i0.t9, i2.i0.t10, i2.i0.t11, i2.i0.i2.u24.t237, i2.i1.t12, i2.i1.t13, i2.i1.t14, i2.i1.i2.u32.t242, i3.i0.t15, i3.i0.t16, i3.i0.t17, i3.i0.i2.u40.t247, i3.i1.t18, i3.i1.t19, i3.i1.t20, i3.i1.i2.u48.t252, i4.i0.t21, i4.i0.t22, i4.i0.t23, i4.i0.i2.u56.t257, i4.i1.t25, i4.i1.t213, i4.i1.i0.u65.t24, i4.i1.i0.u69.t265, i4.i1.i1.t581, i4.i1.i1.u64.t263, i4.i1.i1.u68.t26, i5.i0.t27, i5.i0.t28, i5.i0.t29, i5.i0.i0.t586, i5.i0.i1.t590, i5.i0.i2.u71.t270, i5.i0.i2.u78.t156, i5.i1.t31, i5.i1.i0.u80.t30, i5.i1.i0.u84.t278, i5.i1.i1.u79.t275, i5.i1.i1.u83.t32, i6.i0.t33, i6.i0.t34, i6.i0.t35, i6.i0.i2.u86.t284, i6.i1.t36, i6.i1.t37, i6.i1.t38, i6.i1.i2.u94.t289, i7.t41, i7.t40, i7.t39, i7.u102.t1064, i8.i0.t42, i8.i0.t43, i8.i0.t44, i8.i0.i2.u111.t298, i8.i1.t45, i8.i1.t46, i8.i1.t47, i8.i1.i1.u119.t304, i9.i0.t48, i9.i0.t49, i9.i0.t50, i9.i0.i2.u127.t310, i9.i1.t51, i9.i1.t52, i9.i1.t53, i9.i1.i2.u135.t316, i10.i0.t54, i10.i0.t55, i10.i0.t56, i10.i0.i2.u143.t322, i10.i1.t57, i10.i1.t58, i10.i1.t59, i10.i1.i1.u151.t326, i11.i0.t60, i11.i0.t61, i11.i0.t62, i11.i0.i2.u159.t331, i11.i1.t63, i11.i1.t64, i11.i1.t65, i11.i1.i2.u167.t337, i12.t342, i12.t341, i12.t68, i12.t67, i12.t66, i12.u182.t200, i13.i0.t69, i13.i0.t70, i13.i0.t71, i13.i0.i2.u184.t348, i13.i1.t73, i13.i1.i0.t72, i13.i1.i0.u199.t355, i13.i1.i1.t74, i13.i1.i1.u192.t353, i14.i0.t356, i14.i1.t78, i25.i0.t130, i25.i0.t131, i25.i0.i1.u365.t145, i25.i1.t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/753/117/870
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 696 place count 3495 transition count 2449
Reduce places removed 696 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 707 rules applied. Total rules applied 1403 place count 2799 transition count 2438
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1414 place count 2788 transition count 2438
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 320 Pre rules applied. Total rules applied 1414 place count 2788 transition count 2118
Deduced a syphon composed of 320 places in 5 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 3 with 640 rules applied. Total rules applied 2054 place count 2468 transition count 2118
Discarding 91 places :
Symmetric choice reduction at 3 with 91 rule applications. Total rules 2145 place count 2377 transition count 2027
Iterating global reduction 3 with 91 rules applied. Total rules applied 2236 place count 2377 transition count 2027
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 2236 place count 2377 transition count 1959
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 2372 place count 2309 transition count 1959
Performed 825 Post agglomeration using F-continuation condition.Transition count delta: 825
Deduced a syphon composed of 825 places in 2 ms
Reduce places removed 825 places and 0 transitions.
Iterating global reduction 3 with 1650 rules applied. Total rules applied 4022 place count 1484 transition count 1134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4023 place count 1484 transition count 1133
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4025 place count 1483 transition count 1132
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4227 place count 1382 transition count 1132
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 2 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 4303 place count 1344 transition count 1132
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 4306 place count 1344 transition count 1132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4307 place count 1343 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4308 place count 1342 transition count 1131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4308 place count 1342 transition count 1129
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4312 place count 1340 transition count 1129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4313 place count 1339 transition count 1128
Applied a total of 4313 rules in 896 ms. Remains 1339 /3496 variables (removed 2157) and now considering 1128/3146 (removed 2018) transitions.
[2021-06-05 21:16:38] [INFO ] Flatten gal took : 36 ms
[2021-06-05 21:16:38] [INFO ] Flatten gal took : 39 ms
[2021-06-05 21:16:38] [INFO ] Input system was already deterministic with 1128 transitions.
[2021-06-05 21:16:38] [INFO ] Flatten gal took : 38 ms
[2021-06-05 21:16:38] [INFO ] Flatten gal took : 38 ms
[2021-06-05 21:16:38] [INFO ] Time to serialize gal into /tmp/CTLFireability14536544799644821019.gal : 3 ms
[2021-06-05 21:16:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14793919660119594647.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/CTLFireability14536544799644821019.gal, -t, CGAL, -ctl, /tmp/CTLFireability14793919660119594647.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/CTLFireability14536544799644821019.gal -t CGAL -ctl /tmp/CTLFireability14793919660119594647.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,7.69184e+188,22.6355,528844,2,7660,5,2.07386e+06,6,0,6486,3.57925e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-06-05 21:17:08] [INFO ] Flatten gal took : 41 ms
[2021-06-05 21:17:08] [INFO ] Applying decomposition
[2021-06-05 21:17:08] [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/graph18220923085774769194.txt, -o, /tmp/graph18220923085774769194.bin, -w, /tmp/graph18220923085774769194.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/graph18220923085774769194.bin, -l, -1, -v, -w, /tmp/graph18220923085774769194.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:17:08] [INFO ] Decomposing Gal with order
[2021-06-05 21:17:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:17:08] [INFO ] Removed a total of 325 redundant transitions.
[2021-06-05 21:17:08] [INFO ] Flatten gal took : 78 ms
[2021-06-05 21:17:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 278 labels/synchronizations in 26 ms.
[2021-06-05 21:17:08] [INFO ] Time to serialize gal into /tmp/CTLFireability4572455728630246956.gal : 14 ms
[2021-06-05 21:17:08] [INFO ] Time to serialize properties into /tmp/CTLFireability14290531892681658345.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/CTLFireability4572455728630246956.gal, -t, CGAL, -ctl, /tmp/CTLFireability14290531892681658345.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/CTLFireability4572455728630246956.gal -t CGAL -ctl /tmp/CTLFireability14290531892681658345.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,7.69184e+188,25.76,587656,1712,79,1.02652e+06,1082,2298,3.11712e+06,154,7090,0


Converting to forward existential form...Done !
original formula: E(A(AF((AF((((i3.i0.i3.u58.p483==1)||(i23.u332.p2967==1))||(i7.i0.i2.u108.p977==1))) * ((((((i29.u419.p3734==1)||(i2.i0.i1.u39.p343==1))||(i6.i0.i0.u98.p857==1))||(i5.u91.p818==1))||(i25.i1.i2.u366.p3278==1))||((i19.u278.p2528==1)&&(i19.u285.p2564==1))))) U (EG((((((((((i27.i1.i0.u393.p3491==1)||(i10.u159.p1431==1))||(i2.i0.i2.u36.p310==1))||(i28.i0.i0.u398.p3537==1))||((i12.i0.i2.u180.p1616==1)&&(i12.i0.i0.u184.p1668==1)))||((i26.u373.p3312==1)&&(i27.i0.i1.u384.p3422==1)))||(i13.i1.i0.u209.p1873==1))||(i14.i1.i2.u226.p2051==1))||((i9.u143.p1293==1)&&(i9.u151.p1355==1)))) + ((A((((((((((i28.i1.i2.u404.p4==1)||(i30.i1.i1.u437.p3885==1))||((i20.u289.p2602==1)&&(i20.u296.p2664==1)))||((i10.u156.p1383==1)&&(i10.u158.p1403==1)))||(i19.u287.p2588==1))||(i8.i0.i0.u132.p1181==1))||(i12.i1.i0.u192.p1732==1))||(i7.i1.i1.u123.p1087==1))||(i4.i0.i2.u75.p661==1)) U (i1.i0.i0.u17.p156==1)) * (EF(((i13.i0.i0.u197.p1769==1)&&(i13.i0.i2.u198.p1771==1))) + (((((((i10.u159.p1430==1)||(i18.i1.i1.u274.p2467==1))||(i1.i1.i2.u29.p252==1))||(i2.i1.i0.u49.p394==1))||(i18.i0.i0.u267.p2396==1))||((i8.i0.i1.u128.p1153==1)&&(i8.i0.i3.u129.p1155==1)))&&((((((((((i18.i0.i0.u267.p2403==1)||(i18.i0.i0.u260.p2370==1))||(i23.u325.p2911==1))||(i12.i1.i2.u190.p1696==1))||(i30.i1.i0.u435.p3874==1))||(i23.u324.p2909==1))||(i12.i0.i0.u184.p1665==1))||(i26.u375.p3341==1))||((i28.i1.i2.u409.p3624==1)&&(i28.i1.i1.u410.p3626==1)))||((i6.i0.i1.u95.p845==1)&&(i6.i0.i1.u95.p847==1)))))) * ((((i22.i0.i2.u314.p2783==1)||(i24.i1.i2.u342.p3057==1))||(i0.u8.p95==1))||(((((((i11.i1.i1.u175.p1575==1)||(i21.u305.p2703==1))||(i24.i1.i1.u350.p3113==1))||(i2.i1.i0.u44.p380==1))||((i19.u279.p2532==1)&&(i19.u280.p2534==1)))||((i1.i0.i1.u15.p151==1)&&(i1.i0.i2.u20.p171==1)))&&((i19.u288.p2591==1)||(i3.i1.i1.u67.p581==1))))))) U !(E(EF(((i21.u297.p2677==1)||(i8.i1.i1.u135.p1221==1))) U ((((i16.u248.p2234==1)&&(i17.u258.p2344==1))||((i2.i0.i0.u34.p306==1)&&(i2.i0.i2.u35.p308==1)))||((i8.i1.i1.u135.p1219==1)&&(i8.i1.i0.u141.p1255==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!((E(!((EG((((((((((i27.i1.i0.u393.p3491==1)||(i10.u159.p1431==1))||(i2.i0.i2.u36.p310==1))||(i28.i0.i0.u398.p3537==1))||((i12.i0.i2.u180.p1616==1)&&(i12.i0.i0.u184.p1668==1)))||((i26.u373.p3312==1)&&(i27.i0.i1.u384.p3422==1)))||(i13.i1.i0.u209.p1873==1))||(i14.i1.i2.u226.p2051==1))||((i9.u143.p1293==1)&&(i9.u151.p1355==1)))) + ((!((E(!((i1.i0.i0.u17.p156==1)) U (!((((((((((i28.i1.i2.u404.p4==1)||(i30.i1.i1.u437.p3885==1))||((i20.u289.p2602==1)&&(i20.u296.p2664==1)))||((i10.u156.p1383==1)&&(i10.u158.p1403==1)))||(i19.u287.p2588==1))||(i8.i0.i0.u132.p1181==1))||(i12.i1.i0.u192.p1732==1))||(i7.i1.i1.u123.p1087==1))||(i4.i0.i2.u75.p661==1))) * !((i1.i0.i0.u17.p156==1)))) + EG(!((i1.i0.i0.u17.p156==1))))) * (E(TRUE U ((i13.i0.i0.u197.p1769==1)&&(i13.i0.i2.u198.p1771==1))) + (((((((i10.u159.p1430==1)||(i18.i1.i1.u274.p2467==1))||(i1.i1.i2.u29.p252==1))||(i2.i1.i0.u49.p394==1))||(i18.i0.i0.u267.p2396==1))||((i8.i0.i1.u128.p1153==1)&&(i8.i0.i3.u129.p1155==1)))&&((((((((((i18.i0.i0.u267.p2403==1)||(i18.i0.i0.u260.p2370==1))||(i23.u325.p2911==1))||(i12.i1.i2.u190.p1696==1))||(i30.i1.i0.u435.p3874==1))||(i23.u324.p2909==1))||(i12.i0.i0.u184.p1665==1))||(i26.u375.p3341==1))||((i28.i1.i2.u409.p3624==1)&&(i28.i1.i1.u410.p3626==1)))||((i6.i0.i1.u95.p845==1)&&(i6.i0.i1.u95.p847==1)))))) * ((((i22.i0.i2.u314.p2783==1)||(i24.i1.i2.u342.p3057==1))||(i0.u8.p95==1))||(((((((i11.i1.i1.u175.p1575==1)||(i21.u305.p2703==1))||(i24.i1.i1.u350.p3113==1))||(i2.i1.i0.u44.p380==1))||((i19.u279.p2532==1)&&(i19.u280.p2534==1)))||((i1.i0.i1.u15.p151==1)&&(i1.i0.i2.u20.p171==1)))&&((i19.u288.p2591==1)||(i3.i1.i1.u67.p581==1))))))) U (!(!(EG(!((!(EG(!((((i3.i0.i3.u58.p483==1)||(i23.u332.p2967==1))||(i7.i0.i2.u108.p977==1))))) * ((((((i29.u419.p3734==1)||(i2.i0.i1.u39.p343==1))||(i6.i0.i0.u98.p857==1))||(i5.u91.p818==1))||(i25.i1.i2.u366.p3278==1))||((i19.u278.p2528==1)&&(i19.u285.p2564==1)))))))) * !((EG((((((((((i27.i1.i0.u393.p3491==1)||(i10.u159.p1431==1))||(i2.i0.i2.u36.p310==1))||(i28.i0.i0.u398.p3537==1))||((i12.i0.i2.u180.p1616==1)&&(i12.i0.i0.u184.p1668==1)))||((i26.u373.p3312==1)&&(i27.i0.i1.u384.p3422==1)))||(i13.i1.i0.u209.p1873==1))||(i14.i1.i2.u226.p2051==1))||((i9.u143.p1293==1)&&(i9.u151.p1355==1)))) + ((!((E(!((i1.i0.i0.u17.p156==1)) U (!((((((((((i28.i1.i2.u404.p4==1)||(i30.i1.i1.u437.p3885==1))||((i20.u289.p2602==1)&&(i20.u296.p2664==1)))||((i10.u156.p1383==1)&&(i10.u158.p1403==1)))||(i19.u287.p2588==1))||(i8.i0.i0.u132.p1181==1))||(i12.i1.i0.u192.p1732==1))||(i7.i1.i1.u123.p1087==1))||(i4.i0.i2.u75.p661==1))) * !((i1.i0.i0.u17.p156==1)))) + EG(!((i1.i0.i0.u17.p156==1))))) * (E(TRUE U ((i13.i0.i0.u197.p1769==1)&&(i13.i0.i2.u198.p1771==1))) + (((((((i10.u159.p1430==1)||(i18.i1.i1.u274.p2467==1))||(i1.i1.i2.u29.p252==1))||(i2.i1.i0.u49.p394==1))||(i18.i0.i0.u267.p2396==1))||((i8.i0.i1.u128.p1153==1)&&(i8.i0.i3.u129.p1155==1)))&&((((((((((i18.i0.i0.u267.p2403==1)||(i18.i0.i0.u260.p2370==1))||(i23.u325.p2911==1))||(i12.i1.i2.u190.p1696==1))||(i30.i1.i0.u435.p3874==1))||(i23.u324.p2909==1))||(i12.i0.i0.u184.p1665==1))||(i26.u375.p3341==1))||((i28.i1.i2.u409.p3624==1)&&(i28.i1.i1.u410.p3626==1)))||((i6.i0.i1.u95.p845==1)&&(i6.i0.i1.u95.p847==1)))))) * ((((i22.i0.i2.u314.p2783==1)||(i24.i1.i2.u342.p3057==1))||(i0.u8.p95==1))||(((((((i11.i1.i1.u175.p1575==1)||(i21.u305.p2703==1))||(i24.i1.i1.u350.p3113==1))||(i2.i1.i0.u44.p380==1))||((i19.u279.p2532==1)&&(i19.u280.p2534==1)))||((i1.i0.i1.u15.p151==1)&&(i1.i0.i2.u20.p171==1)))&&((i19.u288.p2591==1)||(i3.i1.i1.u67.p581==1))))))))) + EG(!((EG((((((((((i27.i1.i0.u393.p3491==1)||(i10.u159.p1431==1))||(i2.i0.i2.u36.p310==1))||(i28.i0.i0.u398.p3537==1))||((i12.i0.i2.u180.p1616==1)&&(i12.i0.i0.u184.p1668==1)))||((i26.u373.p3312==1)&&(i27.i0.i1.u384.p3422==1)))||(i13.i1.i0.u209.p1873==1))||(i14.i1.i2.u226.p2051==1))||((i9.u143.p1293==1)&&(i9.u151.p1355==1)))) + ((!((E(!((i1.i0.i0.u17.p156==1)) U (!((((((((((i28.i1.i2.u404.p4==1)||(i30.i1.i1.u437.p3885==1))||((i20.u289.p2602==1)&&(i20.u296.p2664==1)))||((i10.u156.p1383==1)&&(i10.u158.p1403==1)))||(i19.u287.p2588==1))||(i8.i0.i0.u132.p1181==1))||(i12.i1.i0.u192.p1732==1))||(i7.i1.i1.u123.p1087==1))||(i4.i0.i2.u75.p661==1))) * !((i1.i0.i0.u17.p156==1)))) + EG(!((i1.i0.i0.u17.p156==1))))) * (E(TRUE U ((i13.i0.i0.u197.p1769==1)&&(i13.i0.i2.u198.p1771==1))) + (((((((i10.u159.p1430==1)||(i18.i1.i1.u274.p2467==1))||(i1.i1.i2.u29.p252==1))||(i2.i1.i0.u49.p394==1))||(i18.i0.i0.u267.p2396==1))||((i8.i0.i1.u128.p1153==1)&&(i8.i0.i3.u129.p1155==1)))&&((((((((((i18.i0.i0.u267.p2403==1)||(i18.i0.i0.u260.p2370==1))||(i23.u325.p2911==1))||(i12.i1.i2.u190.p1696==1))||(i30.i1.i0.u435.p3874==1))||(i23.u324.p2909==1))||(i12.i0.i0.u184.p1665==1))||(i26.u375.p3341==1))||((i28.i1.i2.u409.p3624==1)&&(i28.i1.i1.u410.p3626==1)))||((i6.i0.i1.u95.p845==1)&&(i6.i0.i1.u95.p847==1)))))) * ((((i22.i0.i2.u314.p2783==1)||(i24.i1.i2.u342.p3057==1))||(i0.u8.p95==1))||(((((((i11.i1.i1.u175.p1575==1)||(i21.u305.p2703==1))||(i24.i1.i1.u350.p3113==1))||(i2.i1.i0.u44.p380==1))||((i19.u279.p2532==1)&&(i19.u280.p2534==1)))||((i1.i0.i1.u15.p151==1)&&(i1.i0.i2.u20.p171==1)))&&((i19.u288.p2591==1)||(i3.i1.i1.u67.p581==1))))))))))) * !(E(E(TRUE U ((i21.u297.p2677==1)||(i8.i1.i1.u135.p1221==1))) U ((((i16.u248.p2234==1)&&(i17.u258.p2344==1))||((i2.i0.i0.u34.p306==1)&&(i2.i0.i2.u35.p308==1)))||((i8.i1.i1.u135.p1219==1)&&(i8.i1.i0.u141.p1255==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t545, i0.t2, i0.t1, i0.t0, i0.u8.t196, i0.u1.t300, i1.i0.t3, i1.i0.i0.u17.t194, i1.i0.i1.t4, i1.i0.i3.u11.t306, i1.i1.t6, i1.i1.t7, i1.i1.t8, i1.i1.i2.u29.t192, i2.i0.t248, i2.i0.i0.t9, i2.i0.i0.u31.t316, i2.i0.i1.u38.t260, i2.i0.i2.u36.t191, i2.i1.t13, i2.i1.i0.u44.t189, i2.i1.i0.u49.t611, i2.i1.i0.u49.t612, i2.i1.i1.u41.t321, i2.i1.i2.t11, i3.i0.t14, i3.i0.t15, i3.i0.t16, i3.i0.i1.t630, i3.i0.i2.t631, i3.i0.i3.u58.t188, i3.i1.t17, i3.i1.t18, i3.i1.t19, i3.i1.i0.t638, i3.i1.i1.u60.t330, i3.i1.i1.u67.t187, i3.i1.i2.t641, i4.i0.t20, i4.i0.t21, i4.i0.t22, i4.i0.i2.u68.t336, i4.i0.i2.u75.t186, i4.i1.t23, i4.i1.t24, i4.i1.t25, i4.i1.i2.u76.t341, i5.t28, i5.t27, i5.t26, i5.u84.t346, i5.u91.t185, i6.i0.t30, i6.i0.i0.t29, i6.i0.i0.u98.t184, i6.i0.i1.u92.t351, i6.i0.i1.u95.t250, i6.i1.t31, i6.i1.t32, i6.i1.t33, i6.i1.i2.u100.t357, i7.i0.t34, i7.i0.t35, i7.i0.t36, i7.i0.t365, i7.i0.i2.u108.t363, i7.i1.t38, i7.i1.t39, i7.i1.i0.t37, i7.i1.i1.u123.t712, i7.i1.i2.u116.t369, i8.i0.t40, i8.i0.t41, i8.i0.t251, i8.i0.i0.u132.t375, i8.i1.t42, i8.i1.t43, i8.i1.t182, i8.i1.i0.u134.t380, i8.i1.i1.t270, i9.t179, i9.t46, i9.t45, i9.t44, i9.u143.t180, i10.t47, i10.u152.t392, i10.u159.t174, i10.u159.t175, i10.u157.t49, i10.u155.t48, i11.i0.t50, i11.i0.t51, i11.i0.t52, i11.i0.i2.u160.t397, i11.i1.t54, i11.i1.i0.u169.t53, i11.i1.i1.u174.t272, i11.i1.i2.u168.t402, i11.i1.i2.u172.t55, i12.i0.t56, i12.i0.i0.u177.t405, i12.i0.i0.u184.t170, i12.i0.i1.u183.t58, i12.i0.i2.t57, i12.i1.t59, i12.i1.t60, i12.i1.i0.u192.t800, i12.i1.i2.u185.t412, i12.i1.i2.u190.t169, i13.i0.t62, i13.i0.t63, i13.i0.t253, i13.i0.i2.u194.t417, i13.i1.t64, i13.i1.t65, i13.i1.t66, i13.i1.i0.u209.t168, i14.i0.t67, i14.i0.t68, i14.i0.t69, i14.i0.i2.u211.t426, i14.i1.t70, i14.i1.i0.t71, i14.i1.i1.t72, i14.i1.i2.u219.t430, i14.i1.i2.u226.t433, i15.t75, i15.t74, i15.t73, i15.u227.t437, i16.t445, i16.t277, i16.t80, i16.t79, i16.t78, i16.t77, i16.t76, i16.u235.t443, i16.u243.t449, i17.t83, i17.t82, i17.t81, i17.u251.t454, i18.i0.t84, i18.i0.t86, i18.i0.t163, i18.i0.i0.t164, i18.i0.i0.u261.t460, i18.i0.i0.u267.t900, i18.i0.i0.u267.t901, i18.i0.i0.u267.t902, i18.i0.i2.u264.t85, i18.i1.t87, i18.i1.t88, i18.i1.i1.t89, i18.i1.i2.u269.t464, i19.t160, i19.t92, i19.t91, i19.u277.t468, i19.u278.t161, i19.u288.t279, i20.t155, i20.t95, i20.t94, i20.t93, i20.u289.t156, i21.t477, i21.t153, i21.t98, i21.t97, i21.t96, i21.u298.t482, i21.u305.t255, i22.i0.t99, i22.i0.t100, i22.i0.t101, i22.i0.i1.u307.t487, i22.i0.i2.u314.t151, i22.i1.t102, i22.i1.t103, i22.i1.t104, i22.i1.i2.u316.t492, i23.t988, i23.t149, i23.t148, i23.t107, i23.t106, i23.t105, i23.u325.t150, i23.u325.t496, i23.u326.t980, i23.u332.t147, i24.i0.t108, i24.i0.t109, i24.i0.t110, i24.i0.i2.u334.t501, i24.i1.t111, i24.i1.t112, i24.i1.t113, i24.i1.t509, i24.i1.i1.u350.t145, i24.i1.i2.u343.t507, i25.i0.t114, i25.i0.t115, i25.i0.t116, i25.i0.i2.u352.t513, i25.i1.t117, i25.i1.i0.t119, i25.i1.i1.u363.t118, i25.i1.i2.u360.t518, i25.i1.i2.u366.t143, i26.t1043, i26.t522, i26.t283, i26.t121, i26.t120, i26.u368.t528, i26.u369.t1036, i26.u375.t256, i27.i0.t123, i28.i1.t132, i28.i1.t552, i29.t134, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/713/225/938
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 733 transitions
Trivial Post-agglo rules discarded 733 transitions
Performed 733 trivial Post agglomeration. Transition count delta: 733
Iterating post reduction 0 with 733 rules applied. Total rules applied 733 place count 3495 transition count 2412
Reduce places removed 733 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 735 rules applied. Total rules applied 1468 place count 2762 transition count 2410
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1470 place count 2760 transition count 2410
Performed 321 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 321 Pre rules applied. Total rules applied 1470 place count 2760 transition count 2089
Deduced a syphon composed of 321 places in 4 ms
Reduce places removed 321 places and 0 transitions.
Iterating global reduction 3 with 642 rules applied. Total rules applied 2112 place count 2439 transition count 2089
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 2213 place count 2338 transition count 1988
Iterating global reduction 3 with 101 rules applied. Total rules applied 2314 place count 2338 transition count 1988
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 2314 place count 2338 transition count 1911
Deduced a syphon composed of 77 places in 4 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 2468 place count 2261 transition count 1911
Performed 845 Post agglomeration using F-continuation condition.Transition count delta: 845
Deduced a syphon composed of 845 places in 1 ms
Reduce places removed 845 places and 0 transitions.
Iterating global reduction 3 with 1690 rules applied. Total rules applied 4158 place count 1416 transition count 1066
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4159 place count 1416 transition count 1065
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 4161 place count 1415 transition count 1064
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4363 place count 1314 transition count 1064
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 4455 place count 1268 transition count 1064
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 4456 place count 1268 transition count 1064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4457 place count 1267 transition count 1063
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4458 place count 1266 transition count 1063
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4458 place count 1266 transition count 1061
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4462 place count 1264 transition count 1061
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 4463 place count 1263 transition count 1060
Applied a total of 4463 rules in 885 ms. Remains 1263 /3496 variables (removed 2233) and now considering 1060/3146 (removed 2086) transitions.
[2021-06-05 21:17:39] [INFO ] Flatten gal took : 28 ms
[2021-06-05 21:17:40] [INFO ] Flatten gal took : 32 ms
[2021-06-05 21:17:40] [INFO ] Input system was already deterministic with 1060 transitions.
[2021-06-05 21:17:40] [INFO ] Flatten gal took : 30 ms
[2021-06-05 21:17:40] [INFO ] Flatten gal took : 31 ms
[2021-06-05 21:17:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3975296982244159318.gal : 2 ms
[2021-06-05 21:17:40] [INFO ] Time to serialize properties into /tmp/CTLFireability110730888544437369.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/CTLFireability3975296982244159318.gal, -t, CGAL, -ctl, /tmp/CTLFireability110730888544437369.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/CTLFireability3975296982244159318.gal -t CGAL -ctl /tmp/CTLFireability110730888544437369.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.96073e+181,2.41187,67804,2,5683,5,276959,6,0,6113,328741,0


Converting to forward existential form...Done !
original formula: AF((((((((((p1298==1)||(p209==1))||(p3266==1))||(p2342==1))||(p483==1))||(p1411==1))||(p3895==1))||(p3627==1))||((p151==1)&&(p171==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((((((p1298==1)||(p209==1))||(p3266==1))||(p2342==1))||(p483==1))||(p1411==1))||(p3895==1))||(p3627==1))||((p151==1)&&(p171==1)))))] = FALSE
Hit Full ! (commute/partial/dont) 1037/149/23
(forward)formula 0,0,15.9125,437776,1,0,9,2.99037e+06,20,3,31317,328741,8
FORMULA ShieldPPPt-PT-050B-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

[2021-06-05 21:17:56] [INFO ] Flatten gal took : 69 ms
[2021-06-05 21:17:56] [INFO ] Flatten gal took : 70 ms
[2021-06-05 21:17:56] [INFO ] Applying decomposition
[2021-06-05 21:17:56] [INFO ] Flatten gal took : 71 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/graph4351221111761404710.txt, -o, /tmp/graph4351221111761404710.bin, -w, /tmp/graph4351221111761404710.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/graph4351221111761404710.bin, -l, -1, -v, -w, /tmp/graph4351221111761404710.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-06-05 21:17:56] [INFO ] Decomposing Gal with order
[2021-06-05 21:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:17:57] [INFO ] Removed a total of 402 redundant transitions.
[2021-06-05 21:17:57] [INFO ] Flatten gal took : 150 ms
[2021-06-05 21:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2021-06-05 21:17:57] [INFO ] Time to serialize gal into /tmp/CTLFireability6784256332185764895.gal : 16 ms
[2021-06-05 21:17:57] [INFO ] Time to serialize properties into /tmp/CTLFireability1486345199867922208.ctl : 4 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/CTLFireability6784256332185764895.gal, -t, CGAL, -ctl, /tmp/CTLFireability1486345199867922208.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/CTLFireability6784256332185764895.gal -t CGAL -ctl /tmp/CTLFireability1486345199867922208.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-06-05 21:41:43] [INFO ] Applying decomposition
[2021-06-05 21:41:44] [INFO ] Flatten gal took : 365 ms
[2021-06-05 21:41:44] [INFO ] Decomposing Gal with order
[2021-06-05 21:41:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-06-05 21:41:49] [INFO ] Removed a total of 109 redundant transitions.
[2021-06-05 21:41:50] [INFO ] Flatten gal took : 465 ms
[2021-06-05 21:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 444 labels/synchronizations in 61 ms.
[2021-06-05 21:41:54] [INFO ] Time to serialize gal into /tmp/CTLFireability1849517205806178381.gal : 73 ms
[2021-06-05 21:41:54] [INFO ] Time to serialize properties into /tmp/CTLFireability538168760898893576.ctl : 14 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/CTLFireability1849517205806178381.gal, -t, CGAL, -ctl, /tmp/CTLFireability538168760898893576.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/CTLFireability1849517205806178381.gal -t CGAL -ctl /tmp/CTLFireability538168760898893576.ctl
No direction supplied, using forward translation only.
Parsed 13 CTL formulae.
Detected timeout of ITS tools.
[2021-06-05 22:05:27] [INFO ] Flatten gal took : 923 ms
[2021-06-05 22:05:34] [INFO ] Input system was already deterministic with 3146 transitions.
[2021-06-05 22:05:34] [INFO ] Transformed 3496 places.
[2021-06-05 22:05:35] [INFO ] Transformed 3146 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-06-05 22:05:36] [INFO ] Time to serialize gal into /tmp/CTLFireability4320874584951815810.gal : 9 ms
[2021-06-05 22:05:36] [INFO ] Time to serialize properties into /tmp/CTLFireability17011221848558697445.ctl : 3 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/CTLFireability4320874584951815810.gal, -t, CGAL, -ctl, /tmp/CTLFireability17011221848558697445.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/CTLFireability4320874584951815810.gal -t CGAL -ctl /tmp/CTLFireability17011221848558697445.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 13 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="ShieldPPPt-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 ShieldPPPt-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-162098205700871"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-050B.tgz
mv ShieldPPPt-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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;