fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989400020
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16245.636 3600000.00 3056077.00 300495.50 TFT????T???T??T? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989400020.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989400020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 293K May 5 16:51 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 ASLink-PT-01b-CTLFireability-00
FORMULA_NAME ASLink-PT-01b-CTLFireability-01
FORMULA_NAME ASLink-PT-01b-CTLFireability-02
FORMULA_NAME ASLink-PT-01b-CTLFireability-03
FORMULA_NAME ASLink-PT-01b-CTLFireability-04
FORMULA_NAME ASLink-PT-01b-CTLFireability-05
FORMULA_NAME ASLink-PT-01b-CTLFireability-06
FORMULA_NAME ASLink-PT-01b-CTLFireability-07
FORMULA_NAME ASLink-PT-01b-CTLFireability-08
FORMULA_NAME ASLink-PT-01b-CTLFireability-09
FORMULA_NAME ASLink-PT-01b-CTLFireability-10
FORMULA_NAME ASLink-PT-01b-CTLFireability-11
FORMULA_NAME ASLink-PT-01b-CTLFireability-12
FORMULA_NAME ASLink-PT-01b-CTLFireability-13
FORMULA_NAME ASLink-PT-01b-CTLFireability-14
FORMULA_NAME ASLink-PT-01b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620717695223

Running Version 0
[2021-05-11 07:21:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-11 07:21:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-11 07:21:37] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2021-05-11 07:21:37] [INFO ] Transformed 846 places.
[2021-05-11 07:21:37] [INFO ] Transformed 1148 transitions.
[2021-05-11 07:21:37] [INFO ] Found NUPN structural information;
[2021-05-11 07:21:37] [INFO ] Parsed PT model containing 846 places and 1148 transitions in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 438 out of 846 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 846/846 places, 1148/1148 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 821 transition count 1123
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 821 transition count 1123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 821 transition count 1122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 818 transition count 1119
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 818 transition count 1119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 818 transition count 1118
Applied a total of 58 rules in 135 ms. Remains 818 /846 variables (removed 28) and now considering 1118/1148 (removed 30) transitions.
// Phase 1: matrix 1118 rows 818 cols
[2021-05-11 07:21:37] [INFO ] Computed 82 place invariants in 64 ms
[2021-05-11 07:21:37] [INFO ] Implicit Places using invariants in 360 ms returned [648, 659, 678, 686, 702, 713, 721, 729, 740]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 388 ms to find 9 implicit places.
// Phase 1: matrix 1118 rows 809 cols
[2021-05-11 07:21:37] [INFO ] Computed 73 place invariants in 28 ms
[2021-05-11 07:21:38] [INFO ] Dead Transitions using invariants and state equation in 571 ms returned []
Starting structural reductions, iteration 1 : 809/846 places, 1118/1148 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 804 transition count 1113
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 804 transition count 1113
Applied a total of 10 rules in 38 ms. Remains 804 /809 variables (removed 5) and now considering 1113/1118 (removed 5) transitions.
// Phase 1: matrix 1113 rows 804 cols
[2021-05-11 07:21:38] [INFO ] Computed 73 place invariants in 12 ms
[2021-05-11 07:21:38] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 1113 rows 804 cols
[2021-05-11 07:21:38] [INFO ] Computed 73 place invariants in 10 ms
[2021-05-11 07:21:39] [INFO ] Implicit Places using invariants and state equation in 1016 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 804/846 places, 1113/1148 transitions.
[2021-05-11 07:21:39] [INFO ] Flatten gal took : 112 ms
[2021-05-11 07:21:39] [INFO ] Flatten gal took : 77 ms
[2021-05-11 07:21:40] [INFO ] Input system was already deterministic with 1113 transitions.
Incomplete random walk after 100000 steps, including 633 resets, run finished after 646 ms. (steps per millisecond=154 ) properties (out of 76) seen :67
Running SMT prover for 9 properties.
// Phase 1: matrix 1113 rows 804 cols
[2021-05-11 07:21:40] [INFO ] Computed 73 place invariants in 9 ms
[2021-05-11 07:21:40] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:21:40] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 18 ms returned sat
[2021-05-11 07:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:21:41] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2021-05-11 07:21:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:21:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2021-05-11 07:21:41] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 16 ms returned sat
[2021-05-11 07:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:21:42] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2021-05-11 07:21:42] [INFO ] Computed and/alt/rep : 904/2051/904 causal constraints (skipped 208 transitions) in 62 ms.
[2021-05-11 07:21:52] [INFO ] Deduced a trap composed of 138 places in 311 ms of which 5 ms to minimize.
[2021-05-11 07:21:52] [INFO ] Deduced a trap composed of 192 places in 208 ms of which 1 ms to minimize.
[2021-05-11 07:21:53] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2021-05-11 07:21:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1045 ms
[2021-05-11 07:21:53] [INFO ] Added : 694 causal constraints over 139 iterations in 11121 ms. Result :sat
[2021-05-11 07:21:53] [INFO ] [Real]Absence check using 19 positive place invariants in 19 ms returned sat
[2021-05-11 07:21:53] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 19 ms returned sat
[2021-05-11 07:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:21:54] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2021-05-11 07:21:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:21:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2021-05-11 07:21:54] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 19 ms returned sat
[2021-05-11 07:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:21:55] [INFO ] [Nat]Absence check using state equation in 1146 ms returned unsat
[2021-05-11 07:21:55] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:21:55] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 16 ms returned sat
[2021-05-11 07:21:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:21:56] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-11 07:21:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:21:56] [INFO ] [Nat]Absence check using 19 positive place invariants in 19 ms returned sat
[2021-05-11 07:21:56] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 52 ms returned sat
[2021-05-11 07:21:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:02] [INFO ] [Nat]Absence check using state equation in 6187 ms returned unknown
[2021-05-11 07:22:02] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:22:02] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 26 ms returned sat
[2021-05-11 07:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:03] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2021-05-11 07:22:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-11 07:22:03] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 32 ms returned sat
[2021-05-11 07:22:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:09] [INFO ] [Nat]Absence check using state equation in 6313 ms returned unknown
[2021-05-11 07:22:09] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2021-05-11 07:22:09] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 35 ms returned sat
[2021-05-11 07:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:10] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-11 07:22:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 39 ms returned sat
[2021-05-11 07:22:10] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 21 ms returned sat
[2021-05-11 07:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:17] [INFO ] [Nat]Absence check using state equation in 6413 ms returned unknown
[2021-05-11 07:22:17] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:22:17] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 23 ms returned sat
[2021-05-11 07:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:18] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2021-05-11 07:22:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:22:18] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 25 ms returned sat
[2021-05-11 07:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:19] [INFO ] [Nat]Absence check using state equation in 701 ms returned sat
[2021-05-11 07:22:19] [INFO ] Deduced a trap composed of 18 places in 201 ms of which 1 ms to minimize.
[2021-05-11 07:22:19] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 0 ms to minimize.
[2021-05-11 07:22:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2021-05-11 07:22:19] [INFO ] Computed and/alt/rep : 904/2051/904 causal constraints (skipped 208 transitions) in 68 ms.
[2021-05-11 07:22:32] [INFO ] Added : 810 causal constraints over 162 iterations in 12378 ms. Result :sat
[2021-05-11 07:22:32] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-11 07:22:32] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 16 ms returned sat
[2021-05-11 07:22:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:32] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2021-05-11 07:22:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2021-05-11 07:22:32] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 15 ms returned sat
[2021-05-11 07:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:38] [INFO ] [Nat]Absence check using state equation in 6140 ms returned unknown
[2021-05-11 07:22:38] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-11 07:22:39] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 17 ms returned sat
[2021-05-11 07:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:39] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2021-05-11 07:22:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2021-05-11 07:22:39] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 18 ms returned sat
[2021-05-11 07:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:40] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2021-05-11 07:22:40] [INFO ] Computed and/alt/rep : 904/2051/904 causal constraints (skipped 208 transitions) in 61 ms.
[2021-05-11 07:22:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2021-05-11 07:22:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2021-05-11 07:22:53] [INFO ] Added : 718 causal constraints over 144 iterations in 13030 ms. Result :sat
[2021-05-11 07:22:53] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2021-05-11 07:22:53] [INFO ] [Real]Absence check using 19 positive and 54 generalized place invariants in 40 ms returned sat
[2021-05-11 07:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-11 07:22:54] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2021-05-11 07:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-11 07:22:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2021-05-11 07:22:54] [INFO ] [Nat]Absence check using 19 positive and 54 generalized place invariants in 37 ms returned sat
[2021-05-11 07:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-11 07:23:00] [INFO ] [Nat]Absence check using state equation in 6501 ms returned unknown
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2021-05-11 07:23:00] [INFO ] Initial state test concluded for 1 properties.
FORMULA ASLink-PT-01b-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 803 transition count 955
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 321 place count 646 transition count 948
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 326 place count 644 transition count 945
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 328 place count 642 transition count 945
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 193 Pre rules applied. Total rules applied 328 place count 642 transition count 752
Deduced a syphon composed of 193 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 4 with 400 rules applied. Total rules applied 728 place count 435 transition count 752
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 11 rules applied. Total rules applied 739 place count 434 transition count 742
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 749 place count 424 transition count 742
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 749 place count 424 transition count 737
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 764 place count 414 transition count 737
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 764 place count 414 transition count 733
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 772 place count 410 transition count 733
Discarding 23 places :
Symmetric choice reduction at 6 with 23 rule applications. Total rules 795 place count 387 transition count 710
Iterating global reduction 6 with 23 rules applied. Total rules applied 818 place count 387 transition count 710
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 818 place count 387 transition count 704
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 830 place count 381 transition count 704
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 837 place count 374 transition count 684
Iterating global reduction 6 with 7 rules applied. Total rules applied 844 place count 374 transition count 684
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 844 place count 374 transition count 683
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 846 place count 373 transition count 683
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 849 place count 370 transition count 673
Iterating global reduction 6 with 3 rules applied. Total rules applied 852 place count 370 transition count 673
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 854 place count 368 transition count 664
Iterating global reduction 6 with 2 rules applied. Total rules applied 856 place count 368 transition count 664
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 857 place count 367 transition count 656
Iterating global reduction 6 with 1 rules applied. Total rules applied 858 place count 367 transition count 656
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 859 place count 366 transition count 648
Iterating global reduction 6 with 1 rules applied. Total rules applied 860 place count 366 transition count 648
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 861 place count 365 transition count 640
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 365 transition count 640
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 863 place count 364 transition count 632
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 364 transition count 632
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 865 place count 363 transition count 624
Iterating global reduction 6 with 1 rules applied. Total rules applied 866 place count 363 transition count 624
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 867 place count 362 transition count 616
Iterating global reduction 6 with 1 rules applied. Total rules applied 868 place count 362 transition count 616
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 869 place count 361 transition count 608
Iterating global reduction 6 with 1 rules applied. Total rules applied 870 place count 361 transition count 608
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 970 place count 311 transition count 558
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 973 place count 308 transition count 555
Ensure Unique test removed 1 places
Iterating global reduction 6 with 4 rules applied. Total rules applied 977 place count 307 transition count 555
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 979 place count 305 transition count 553
Iterating global reduction 6 with 2 rules applied. Total rules applied 981 place count 305 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 983 place count 305 transition count 551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 984 place count 304 transition count 551
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 986 place count 303 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 987 place count 302 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 988 place count 301 transition count 555
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 991 place count 299 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 992 place count 298 transition count 554
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 992 place count 298 transition count 551
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 999 place count 294 transition count 551
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 1001 place count 292 transition count 551
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 1001 place count 292 transition count 550
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1003 place count 291 transition count 550
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1009 place count 288 transition count 547
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1010 place count 287 transition count 546
Iterating global reduction 11 with 1 rules applied. Total rules applied 1011 place count 287 transition count 546
Applied a total of 1011 rules in 463 ms. Remains 287 /804 variables (removed 517) and now considering 546/1113 (removed 567) transitions.
[2021-05-11 07:23:01] [INFO ] Flatten gal took : 31 ms
[2021-05-11 07:23:01] [INFO ] Flatten gal took : 34 ms
[2021-05-11 07:23:01] [INFO ] Input system was already deterministic with 546 transitions.
[2021-05-11 07:23:01] [INFO ] Flatten gal took : 33 ms
[2021-05-11 07:23:01] [INFO ] Flatten gal took : 26 ms
[2021-05-11 07:23:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9814946742610973450.gal : 19 ms
[2021-05-11 07:23:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6606761224795245055.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/CTLFireability9814946742610973450.gal, -t, CGAL, -ctl, /tmp/CTLFireability6606761224795245055.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/CTLFireability9814946742610973450.gal -t CGAL -ctl /tmp/CTLFireability6606761224795245055.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.99385e+06,3.09308,85504,2,20361,5,218371,6,0,1697,234997,0


Converting to forward existential form...Done !
original formula: !(AF((((((p542==1)&&(p727==1))||((p112==1)&&(p494==1)))||(p755==1))||(p704==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((((p542==1)&&(p727==1))||((p112==1)&&(p494==1)))||(p755==1))||(p704==1))))] != FALSE
Hit Full ! (commute/partial/dont) 500/54/46
(forward)formula 0,1,14.6763,376312,1,0,10,1.23588e+06,20,4,10296,544190,8
FORMULA ASLink-PT-01b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 154 place count 803 transition count 958
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 161 rules applied. Total rules applied 315 place count 649 transition count 951
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 320 place count 647 transition count 948
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 5 rules applied. Total rules applied 325 place count 645 transition count 945
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 328 place count 642 transition count 945
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 189 Pre rules applied. Total rules applied 328 place count 642 transition count 756
Deduced a syphon composed of 189 places in 2 ms
Ensure Unique test removed 14 places
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 5 with 392 rules applied. Total rules applied 720 place count 439 transition count 756
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 731 place count 438 transition count 746
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 741 place count 428 transition count 746
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 741 place count 428 transition count 741
Deduced a syphon composed of 5 places in 3 ms
Ensure Unique test removed 4 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 755 place count 419 transition count 741
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 755 place count 419 transition count 738
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 761 place count 416 transition count 738
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 785 place count 392 transition count 714
Iterating global reduction 7 with 24 rules applied. Total rules applied 809 place count 392 transition count 714
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 809 place count 392 transition count 707
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 823 place count 385 transition count 707
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 832 place count 376 transition count 690
Iterating global reduction 7 with 9 rules applied. Total rules applied 841 place count 376 transition count 690
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 843 place count 374 transition count 681
Iterating global reduction 7 with 2 rules applied. Total rules applied 845 place count 374 transition count 681
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 847 place count 372 transition count 672
Iterating global reduction 7 with 2 rules applied. Total rules applied 849 place count 372 transition count 672
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 850 place count 371 transition count 664
Iterating global reduction 7 with 1 rules applied. Total rules applied 851 place count 371 transition count 664
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 852 place count 370 transition count 656
Iterating global reduction 7 with 1 rules applied. Total rules applied 853 place count 370 transition count 656
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 854 place count 369 transition count 648
Iterating global reduction 7 with 1 rules applied. Total rules applied 855 place count 369 transition count 648
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 856 place count 368 transition count 640
Iterating global reduction 7 with 1 rules applied. Total rules applied 857 place count 368 transition count 640
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 858 place count 367 transition count 632
Iterating global reduction 7 with 1 rules applied. Total rules applied 859 place count 367 transition count 632
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 860 place count 366 transition count 624
Iterating global reduction 7 with 1 rules applied. Total rules applied 861 place count 366 transition count 624
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 862 place count 365 transition count 616
Iterating global reduction 7 with 1 rules applied. Total rules applied 863 place count 365 transition count 616
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 864 place count 364 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 865 place count 364 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 866 place count 363 transition count 600
Iterating global reduction 7 with 1 rules applied. Total rules applied 867 place count 363 transition count 600
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 868 place count 362 transition count 592
Iterating global reduction 7 with 1 rules applied. Total rules applied 869 place count 362 transition count 592
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 870 place count 361 transition count 584
Iterating global reduction 7 with 1 rules applied. Total rules applied 871 place count 361 transition count 584
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 872 place count 360 transition count 576
Iterating global reduction 7 with 1 rules applied. Total rules applied 873 place count 360 transition count 576
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 874 place count 359 transition count 568
Iterating global reduction 7 with 1 rules applied. Total rules applied 875 place count 359 transition count 568
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 876 place count 358 transition count 560
Iterating global reduction 7 with 1 rules applied. Total rules applied 877 place count 358 transition count 560
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 975 place count 309 transition count 511
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 978 place count 306 transition count 508
Ensure Unique test removed 1 places
Iterating global reduction 7 with 4 rules applied. Total rules applied 982 place count 305 transition count 508
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 985 place count 302 transition count 505
Iterating global reduction 7 with 3 rules applied. Total rules applied 988 place count 302 transition count 505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 990 place count 302 transition count 503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 991 place count 301 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 993 place count 300 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 994 place count 299 transition count 508
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 997 place count 297 transition count 507
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 998 place count 296 transition count 507
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 998 place count 296 transition count 504
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 1005 place count 292 transition count 504
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 1007 place count 290 transition count 504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1007 place count 290 transition count 503
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1009 place count 289 transition count 503
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 1015 place count 286 transition count 500
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1016 place count 285 transition count 499
Iterating global reduction 12 with 1 rules applied. Total rules applied 1017 place count 285 transition count 499
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1018 place count 284 transition count 498
Iterating global reduction 12 with 1 rules applied. Total rules applied 1019 place count 284 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1020 place count 284 transition count 497
Applied a total of 1020 rules in 337 ms. Remains 284 /804 variables (removed 520) and now considering 497/1113 (removed 616) transitions.
[2021-05-11 07:23:16] [INFO ] Flatten gal took : 21 ms
[2021-05-11 07:23:16] [INFO ] Flatten gal took : 21 ms
[2021-05-11 07:23:16] [INFO ] Input system was already deterministic with 497 transitions.
[2021-05-11 07:23:16] [INFO ] Flatten gal took : 21 ms
[2021-05-11 07:23:16] [INFO ] Flatten gal took : 20 ms
[2021-05-11 07:23:16] [INFO ] Time to serialize gal into /tmp/CTLFireability15988090767433194044.gal : 4 ms
[2021-05-11 07:23:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4347872948391893845.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/CTLFireability15988090767433194044.gal, -t, CGAL, -ctl, /tmp/CTLFireability4347872948391893845.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/CTLFireability15988090767433194044.gal -t CGAL -ctl /tmp/CTLFireability4347872948391893845.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.56822e+07,3.51584,90960,2,19266,5,232645,6,0,1635,270346,0


Converting to forward existential form...Done !
original formula: EF(AG((((p531==1)&&(p713==1))&&(((((p309==1)||(p588==1))||(p11==1))||((p90==1)&&(p396==1)))||((p17==1)&&(p167==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p531==1)&&(p713==1))&&(((((p309==1)||(p588==1))||(p11==1))||((p90==1)&&(p396==1)))||((p17==1)&&(p167==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t195, t272, t282, t284, t286, t382, t383, t384, t385, t386, t425, t427, t428, t430, t431, t456, t457, t458, t461, t462, t463, t466, t468, t470, t492, t496, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :230/237/30/497
(forward)formula 0,0,23.0724,500140,1,0,449,1.37445e+06,786,244,13443,798661,774
FORMULA ASLink-PT-01b-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 803 transition count 964
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 155 rules applied. Total rules applied 303 place count 655 transition count 957
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 308 place count 653 transition count 954
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 311 place count 651 transition count 953
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 312 place count 650 transition count 953
Performed 184 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 184 Pre rules applied. Total rules applied 312 place count 650 transition count 769
Deduced a syphon composed of 184 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 5 with 380 rules applied. Total rules applied 692 place count 454 transition count 769
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 703 place count 453 transition count 759
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 713 place count 443 transition count 759
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 713 place count 443 transition count 756
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 722 place count 437 transition count 756
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 722 place count 437 transition count 754
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 726 place count 435 transition count 754
Discarding 25 places :
Symmetric choice reduction at 7 with 25 rule applications. Total rules 751 place count 410 transition count 729
Iterating global reduction 7 with 25 rules applied. Total rules applied 776 place count 410 transition count 729
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 776 place count 410 transition count 723
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 788 place count 404 transition count 723
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 799 place count 393 transition count 699
Iterating global reduction 7 with 11 rules applied. Total rules applied 810 place count 393 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 810 place count 393 transition count 698
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 812 place count 392 transition count 698
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 814 place count 390 transition count 696
Iterating global reduction 7 with 2 rules applied. Total rules applied 816 place count 390 transition count 696
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 389 transition count 695
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 389 transition count 695
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 916 place count 339 transition count 647
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 918 place count 337 transition count 645
Ensure Unique test removed 1 places
Iterating global reduction 7 with 3 rules applied. Total rules applied 921 place count 336 transition count 645
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 923 place count 334 transition count 643
Iterating global reduction 7 with 2 rules applied. Total rules applied 925 place count 334 transition count 643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 927 place count 334 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 928 place count 333 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 930 place count 332 transition count 647
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 931 place count 331 transition count 646
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 932 place count 330 transition count 645
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 935 place count 328 transition count 644
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 936 place count 327 transition count 644
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 936 place count 327 transition count 641
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 943 place count 323 transition count 641
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 945 place count 321 transition count 641
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 945 place count 321 transition count 640
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 947 place count 320 transition count 640
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 953 place count 317 transition count 637
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 954 place count 316 transition count 636
Iterating global reduction 12 with 1 rules applied. Total rules applied 955 place count 316 transition count 636
Applied a total of 955 rules in 176 ms. Remains 316 /804 variables (removed 488) and now considering 636/1113 (removed 477) transitions.
[2021-05-11 07:23:40] [INFO ] Flatten gal took : 28 ms
[2021-05-11 07:23:40] [INFO ] Flatten gal took : 25 ms
[2021-05-11 07:23:40] [INFO ] Input system was already deterministic with 636 transitions.
[2021-05-11 07:23:40] [INFO ] Flatten gal took : 24 ms
[2021-05-11 07:23:40] [INFO ] Flatten gal took : 24 ms
[2021-05-11 07:23:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5439945041480785088.gal : 3 ms
[2021-05-11 07:23:40] [INFO ] Time to serialize properties into /tmp/CTLFireability16869416081042590648.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/CTLFireability5439945041480785088.gal, -t, CGAL, -ctl, /tmp/CTLFireability16869416081042590648.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/CTLFireability5439945041480785088.gal -t CGAL -ctl /tmp/CTLFireability16869416081042590648.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.56919e+07,5.14853,141140,2,29740,5,368621,6,0,1902,406120,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 07:24:10] [INFO ] Flatten gal took : 26 ms
[2021-05-11 07:24:10] [INFO ] Applying decomposition
[2021-05-11 07:24:10] [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/graph6883890050428623248.txt, -o, /tmp/graph6883890050428623248.bin, -w, /tmp/graph6883890050428623248.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/graph6883890050428623248.bin, -l, -1, -v, -w, /tmp/graph6883890050428623248.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 07:24:10] [INFO ] Decomposing Gal with order
[2021-05-11 07:24:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:24:11] [INFO ] Removed a total of 1109 redundant transitions.
[2021-05-11 07:24:11] [INFO ] Flatten gal took : 86 ms
[2021-05-11 07:24:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 18 ms.
[2021-05-11 07:24:11] [INFO ] Time to serialize gal into /tmp/CTLFireability4147161423372091514.gal : 7 ms
[2021-05-11 07:24:11] [INFO ] Time to serialize properties into /tmp/CTLFireability10184847099976047841.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/CTLFireability4147161423372091514.gal, -t, CGAL, -ctl, /tmp/CTLFireability10184847099976047841.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/CTLFireability4147161423372091514.gal -t CGAL -ctl /tmp/CTLFireability10184847099976047841.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.56919e+07,2.15474,72576,1925,1065,91080,37540,1167,256122,273,159659,0


Converting to forward existential form...Done !
original formula: EF(((((((((((!(EF(((((((((i2.i0.u17.p109==1)&&(i2.i0.u55.p495==1))||((i5.u47.p150==1)&&(i5.u47.p423==1)))||((i2.i0.u17.p109==1)&&(i6.u50.p507==1)))||((i3.u21.p126==1)&&(i3.u38.p286==1)))||((i1.u4.p21==1)&&(i1.u26.p164==1)))||(i6.u82.p795==1))||(i4.i1.u39.p267==1)))) * (i4.i1.u42.p341==0)) * (i4.i1.u34.p261==0)) * (i4.i1.u43.p333==0)) * (i5.u74.p561==0)) * (i4.i1.u32.p205==0)) * (i6.u77.p660==0)) * ((i1.u9.p40==0)||(i1.u26.p163==0))) * ((i7.u66.p540==0)||(i7.u79.p723==0))) * ((i2.i1.u20.p120==0)||(i2.i1.u63.p521==0))) * ((i2.i1.u20.p121==0)||(i2.i0.u57.p501==0))))
=> equivalent forward existential formula: [(((((((((((FwdU(Init,TRUE) * ((i2.i1.u20.p121==0)||(i2.i0.u57.p501==0))) * ((i2.i1.u20.p120==0)||(i2.i1.u63.p521==0))) * ((i7.u66.p540==0)||(i7.u79.p723==0))) * ((i1.u9.p40==0)||(i1.u26.p163==0))) * (i6.u77.p660==0)) * (i4.i1.u32.p205==0)) * (i5.u74.p561==0)) * (i4.i1.u43.p333==0)) * (i4.i1.u34.p261==0)) * (i4.i1.u42.p341==0)) * !(E(TRUE U ((((((((i2.i0.u17.p109==1)&&(i2.i0.u55.p495==1))||((i5.u47.p150==1)&&(i5.u47.p423==1)))||((i2.i0.u17.p109==1)&&(i6.u50.p507==1)))||((i3.u21.p126==1)&&(i3.u38.p286==1)))||((i1.u4.p21==1)&&(i1.u26.p164==1)))||(i6.u82.p795==1))||(i4.i1.u39.p267==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t307, t404, t566, t569, t571, t574, t578, t592, t595, t596, t635, i4.t631, i4.i1.t374, i4.i1.t382, i4.i1.u33.t367, i4.i1.u33.t378, i6.t601, i6.t600, i6.t599, i6.t598, i6.t1, i7.u66.t0, i7.u66.t604, i7.u67.t531, i7.u68.t532, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :284/253/26/563
(forward)formula 0,1,3.33072,72960,1,0,91080,43967,7302,256122,2000,159659,455820
FORMULA ASLink-PT-01b-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Reduce places removed 1 places and 1 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 803 transition count 970
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 149 rules applied. Total rules applied 291 place count 661 transition count 963
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 296 place count 659 transition count 960
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 8 rules applied. Total rules applied 304 place count 657 transition count 954
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 310 place count 651 transition count 954
Performed 179 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 179 Pre rules applied. Total rules applied 310 place count 651 transition count 775
Deduced a syphon composed of 179 places in 0 ms
Ensure Unique test removed 14 places
Reduce places removed 193 places and 0 transitions.
Iterating global reduction 5 with 372 rules applied. Total rules applied 682 place count 458 transition count 775
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 5 with 11 rules applied. Total rules applied 693 place count 457 transition count 765
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 703 place count 447 transition count 765
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 703 place count 447 transition count 760
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 718 place count 437 transition count 760
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 718 place count 437 transition count 756
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 726 place count 433 transition count 756
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 749 place count 410 transition count 733
Iterating global reduction 7 with 23 rules applied. Total rules applied 772 place count 410 transition count 733
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 772 place count 410 transition count 728
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 782 place count 405 transition count 728
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 792 place count 395 transition count 705
Iterating global reduction 7 with 10 rules applied. Total rules applied 802 place count 395 transition count 705
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 804 place count 393 transition count 703
Iterating global reduction 7 with 2 rules applied. Total rules applied 806 place count 393 transition count 703
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 392 transition count 702
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 392 transition count 702
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 904 place count 344 transition count 654
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 906 place count 342 transition count 652
Iterating global reduction 7 with 2 rules applied. Total rules applied 908 place count 342 transition count 652
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 341 transition count 651
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 341 transition count 651
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 912 place count 340 transition count 657
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 913 place count 339 transition count 656
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 338 transition count 655
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 917 place count 336 transition count 654
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 918 place count 335 transition count 654
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 918 place count 335 transition count 651
Deduced a syphon composed of 3 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 7 rules applied. Total rules applied 925 place count 331 transition count 651
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 9 with 3 rules applied. Total rules applied 928 place count 328 transition count 651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 928 place count 328 transition count 650
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 930 place count 327 transition count 650
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 936 place count 324 transition count 647
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 937 place count 323 transition count 646
Iterating global reduction 10 with 1 rules applied. Total rules applied 938 place count 323 transition count 646
Applied a total of 938 rules in 163 ms. Remains 323 /804 variables (removed 481) and now considering 646/1113 (removed 467) transitions.
[2021-05-11 07:24:14] [INFO ] Flatten gal took : 59 ms
[2021-05-11 07:24:14] [INFO ] Flatten gal took : 24 ms
[2021-05-11 07:24:14] [INFO ] Input system was already deterministic with 646 transitions.
[2021-05-11 07:24:14] [INFO ] Flatten gal took : 28 ms
[2021-05-11 07:24:14] [INFO ] Flatten gal took : 40 ms
[2021-05-11 07:24:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6745883572462277316.gal : 7 ms
[2021-05-11 07:24:14] [INFO ] Time to serialize properties into /tmp/CTLFireability4880389403337772569.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/CTLFireability6745883572462277316.gal, -t, CGAL, -ctl, /tmp/CTLFireability4880389403337772569.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/CTLFireability6745883572462277316.gal -t CGAL -ctl /tmp/CTLFireability4880389403337772569.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.22714e+07,10.9869,263336,2,32114,5,685893,6,0,1939,930942,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 07:24:45] [INFO ] Flatten gal took : 31 ms
[2021-05-11 07:24:45] [INFO ] Applying decomposition
[2021-05-11 07:24:45] [INFO ] Flatten gal took : 52 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/graph8262563668524896126.txt, -o, /tmp/graph8262563668524896126.bin, -w, /tmp/graph8262563668524896126.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/graph8262563668524896126.bin, -l, -1, -v, -w, /tmp/graph8262563668524896126.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 07:24:45] [INFO ] Decomposing Gal with order
[2021-05-11 07:24:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:24:45] [INFO ] Removed a total of 1016 redundant transitions.
[2021-05-11 07:24:45] [INFO ] Flatten gal took : 111 ms
[2021-05-11 07:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 15 ms.
[2021-05-11 07:24:45] [INFO ] Time to serialize gal into /tmp/CTLFireability675919379091429931.gal : 4 ms
[2021-05-11 07:24:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8554069372365899412.ctl : 16 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/CTLFireability675919379091429931.gal, -t, CGAL, -ctl, /tmp/CTLFireability8554069372365899412.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/CTLFireability675919379091429931.gal -t CGAL -ctl /tmp/CTLFireability8554069372365899412.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.22714e+07,4.57604,114820,1786,1358,151253,59512,1137,423353,305,305220,0


Converting to forward existential form...Done !
original formula: AF((AG((!(EG(((((((((((i7.u74.p779==1)||((i5.i2.u13.p97==1)&&(i5.i4.u50.p513==1)))||((i2.u31.p360==1)&&(i3.u36.p437==1)))||((i5.i4.u19.p120==1)&&(i5.i0.u44.p491==1)))||((i3.u36.p138==1)&&(i3.u36.p423==1)))||(i4.i1.u32.p198==1))||((i0.u7.p33==1)&&(i0.u22.p158==1)))||((i0.u6.p28==1)&&(i0.u29.p178==1)))||(i7.u70.p662==1))||((i3.u34.p427==1)&&(i3.u66.p566==1))))) * ((((i4.i1.u39.p469==1)||((i5.i0.u15.p105==1)&&(i5.i5.u54.p525==1)))||((i5.i1.u17.p113==1)&&(i5.i3.u47.p501==1)))||((i4.i0.u12.p93==1)&&(i5.i0.u43.p489==1))))) * ((((((!(EG(A((i1.u10.p54==1) U (((((i5.i5.u53.p520==1)||((i5.i4.u18.p117==1)&&(i7.u40.p480==1)))||(i6.u72.p674==1))||((i5.i4.u18.p117==1)&&(i5.i0.u45.p495==1)))||((i0.u6.p28==1)&&(i0.u27.p172==1)))))) + (i5.i0.u43.p487==1)) + (i6.u69.p620==1)) + (i6.u68.p579==1)) + (i5.i0.u44.p490==1)) + ((i5.i4.u19.p121==1)&&(i5.i4.u52.p519==1))) + ((i5.i1.u17.p112==1)&&(i5.i3.u46.p497==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((!(EG(((((((((((i7.u74.p779==1)||((i5.i2.u13.p97==1)&&(i5.i4.u50.p513==1)))||((i2.u31.p360==1)&&(i3.u36.p437==1)))||((i5.i4.u19.p120==1)&&(i5.i0.u44.p491==1)))||((i3.u36.p138==1)&&(i3.u36.p423==1)))||(i4.i1.u32.p198==1))||((i0.u7.p33==1)&&(i0.u22.p158==1)))||((i0.u6.p28==1)&&(i0.u29.p178==1)))||(i7.u70.p662==1))||((i3.u34.p427==1)&&(i3.u66.p566==1))))) * ((((i4.i1.u39.p469==1)||((i5.i0.u15.p105==1)&&(i5.i5.u54.p525==1)))||((i5.i1.u17.p113==1)&&(i5.i3.u47.p501==1)))||((i4.i0.u12.p93==1)&&(i5.i0.u43.p489==1))))))) * ((((((!(EG(!((E(!((((((i5.i5.u53.p520==1)||((i5.i4.u18.p117==1)&&(i7.u40.p480==1)))||(i6.u72.p674==1))||((i5.i4.u18.p117==1)&&(i5.i0.u45.p495==1)))||((i0.u6.p28==1)&&(i0.u27.p172==1)))) U (!((i1.u10.p54==1)) * !((((((i5.i5.u53.p520==1)||((i5.i4.u18.p117==1)&&(i7.u40.p480==1)))||(i6.u72.p674==1))||((i5.i4.u18.p117==1)&&(i5.i0.u45.p495==1)))||((i0.u6.p28==1)&&(i0.u27.p172==1)))))) + EG(!((((((i5.i5.u53.p520==1)||((i5.i4.u18.p117==1)&&(i7.u40.p480==1)))||(i6.u72.p674==1))||((i5.i4.u18.p117==1)&&(i5.i0.u45.p495==1)))||((i0.u6.p28==1)&&(i0.u27.p172==1))))))))) + (i5.i0.u43.p487==1)) + (i6.u69.p620==1)) + (i6.u68.p579==1)) + (i5.i0.u44.p490==1)) + ((i5.i4.u19.p121==1)&&(i5.i4.u52.p519==1))) + ((i5.i1.u17.p112==1)&&(i5.i3.u46.p497==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t270, t428, t466, t580, t581, t582, t585, t600, t605, t610, t645, i2.u20.t588, i3.u36.t21, i4.t579, i4.i1.u30.t417, i4.i1.u30.t424, i4.i1.u30.t426, i4.i1.u32.t313, i6.t617, i6.t608, i6.t607, i6.t505, i6.u58.t0, i6.u58.t536, i6.u58.t616, i6.u68.t314, i6.u72.t8, i7.t612, i7.t611, i7.t534, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :252/257/31/540
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 803 transition count 976
Reduce places removed 136 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 143 rules applied. Total rules applied 279 place count 667 transition count 969
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 284 place count 665 transition count 966
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 3 with 8 rules applied. Total rules applied 292 place count 663 transition count 960
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 298 place count 657 transition count 960
Performed 187 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 187 Pre rules applied. Total rules applied 298 place count 657 transition count 773
Deduced a syphon composed of 187 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 5 with 386 rules applied. Total rules applied 684 place count 458 transition count 773
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 5 rules applied. Total rules applied 689 place count 457 transition count 769
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 6 with 9 rules applied. Total rules applied 698 place count 453 transition count 764
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 703 place count 448 transition count 764
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 703 place count 448 transition count 761
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 711 place count 443 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 711 place count 443 transition count 760
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 713 place count 442 transition count 760
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 736 place count 419 transition count 737
Iterating global reduction 8 with 23 rules applied. Total rules applied 759 place count 419 transition count 737
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 759 place count 419 transition count 735
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 763 place count 417 transition count 735
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 773 place count 407 transition count 712
Iterating global reduction 8 with 10 rules applied. Total rules applied 783 place count 407 transition count 712
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 784 place count 406 transition count 711
Iterating global reduction 8 with 1 rules applied. Total rules applied 785 place count 406 transition count 711
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 8 with 93 rules applied. Total rules applied 878 place count 359 transition count 665
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 880 place count 357 transition count 663
Iterating global reduction 8 with 2 rules applied. Total rules applied 882 place count 357 transition count 663
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 883 place count 356 transition count 662
Iterating global reduction 8 with 1 rules applied. Total rules applied 884 place count 356 transition count 662
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 886 place count 355 transition count 669
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 887 place count 355 transition count 669
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 354 transition count 668
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 889 place count 353 transition count 667
Applied a total of 889 rules in 108 ms. Remains 353 /804 variables (removed 451) and now considering 667/1113 (removed 446) transitions.
[2021-05-11 07:25:15] [INFO ] Flatten gal took : 28 ms
[2021-05-11 07:25:15] [INFO ] Flatten gal took : 25 ms
[2021-05-11 07:25:15] [INFO ] Input system was already deterministic with 667 transitions.
[2021-05-11 07:25:15] [INFO ] Flatten gal took : 24 ms
[2021-05-11 07:25:15] [INFO ] Flatten gal took : 25 ms
[2021-05-11 07:25:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13828870431327137994.gal : 3 ms
[2021-05-11 07:25:15] [INFO ] Time to serialize properties into /tmp/CTLFireability13731059843109678056.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/CTLFireability13828870431327137994.gal, -t, CGAL, -ctl, /tmp/CTLFireability13731059843109678056.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/CTLFireability13828870431327137994.gal -t CGAL -ctl /tmp/CTLFireability13731059843109678056.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,5.71307e+08,14.9715,338660,2,38198,5,991003,6,0,2080,1.11029e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2021-05-11 07:25:45] [INFO ] Flatten gal took : 24 ms
[2021-05-11 07:25:45] [INFO ] Applying decomposition
[2021-05-11 07:25:45] [INFO ] Flatten gal took : 24 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/graph13582879376018678008.txt, -o, /tmp/graph13582879376018678008.bin, -w, /tmp/graph13582879376018678008.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/graph13582879376018678008.bin, -l, -1, -v, -w, /tmp/graph13582879376018678008.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 07:25:45] [INFO ] Decomposing Gal with order
[2021-05-11 07:25:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:25:46] [INFO ] Removed a total of 1095 redundant transitions.
[2021-05-11 07:25:46] [INFO ] Flatten gal took : 41 ms
[2021-05-11 07:25:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 11 ms.
[2021-05-11 07:25:46] [INFO ] Time to serialize gal into /tmp/CTLFireability7048764555667958027.gal : 4 ms
[2021-05-11 07:25:46] [INFO ] Time to serialize properties into /tmp/CTLFireability14847077791177559108.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/CTLFireability7048764555667958027.gal, -t, CGAL, -ctl, /tmp/CTLFireability14847077791177559108.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/CTLFireability7048764555667958027.gal -t CGAL -ctl /tmp/CTLFireability14847077791177559108.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,5.71307e+08,12.6378,328000,2339,1181,447827,26382,1298,1.51377e+06,335,177765,0


Converting to forward existential form...Done !
original formula: EF(!(E(((((((i3.i0.u16.p96==1)&&(i3.i1.u60.p500==1))||(i8.i2.u84.p648==1))||((i3.i0.u18.p104==1)&&(i3.i1.u60.p503==1)))||(i4.i1.u38.p255==1))||((i6.u51.p218==1)&&(i6.u51.p461==1))) U (AG((((((((i8.i0.u83.p616==1)||((i3.i0.u18.p105==1)&&(i7.u53.p480==1)))||(i4.i0.u43.p397==1))||((i6.u34.p204==1)&&(i6.u50.p449==1)))||(i8.i0.u80.p629==1))||(i6.u50.p442==1))&&((i4.i0.u36.p182==1)||((i2.u15.p93==1)&&(i3.i0.u64.p519==1))))) + EF(((((((((((((((((((i0.u5.p25==1)&&(i0.u26.p158==1))||((i7.u78.p572==1)&&(i7.u86.p832==1)))||(i8.i1.u79.p587==1))||(i6.u35.p209==1))||((i3.i0.u16.p96==1)&&(i3.i0.u61.p509==1)))||(i4.i1.u37.p254==1))||(i1.u12.p76==1))||(i4.i0.u42.p343==1))||(i1.u10.p54==1))||(i4.i0.u40.p300==1))||((i3.i1.u23.p124==1)&&(i3.i1.u57.p491==1)))||(i8.i2.u84.p640==1))||((i0.u1.p9==1)&&(i0.u32.p179==1)))||((i5.u48.p435==1)&&(i5.u76.p562==1)))||(i8.i2.u81.p645==1))||(i4.i0.u36.p207==1))||((i0.u7.p32==1)&&(i0.u33.p181==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((((((i3.i0.u16.p96==1)&&(i3.i1.u60.p500==1))||(i8.i2.u84.p648==1))||((i3.i0.u18.p104==1)&&(i3.i1.u60.p503==1)))||(i4.i1.u38.p255==1))||((i6.u51.p218==1)&&(i6.u51.p461==1))) U (!(E(TRUE U !((((((((i8.i0.u83.p616==1)||((i3.i0.u18.p105==1)&&(i7.u53.p480==1)))||(i4.i0.u43.p397==1))||((i6.u34.p204==1)&&(i6.u50.p449==1)))||(i8.i0.u80.p629==1))||(i6.u50.p442==1))&&((i4.i0.u36.p182==1)||((i2.u15.p93==1)&&(i3.i0.u64.p519==1))))))) + E(TRUE U ((((((((((((((((((i0.u5.p25==1)&&(i0.u26.p158==1))||((i7.u78.p572==1)&&(i7.u86.p832==1)))||(i8.i1.u79.p587==1))||(i6.u35.p209==1))||((i3.i0.u16.p96==1)&&(i3.i0.u61.p509==1)))||(i4.i1.u37.p254==1))||(i1.u12.p76==1))||(i4.i0.u42.p343==1))||(i1.u10.p54==1))||(i4.i0.u40.p300==1))||((i3.i1.u23.p124==1)&&(i3.i1.u57.p491==1)))||(i8.i2.u84.p640==1))||((i0.u1.p9==1)&&(i0.u32.p179==1)))||((i5.u48.p435==1)&&(i5.u76.p562==1)))||(i8.i2.u81.p645==1))||(i4.i0.u36.p207==1))||((i0.u7.p32==1)&&(i0.u33.p181==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t256, t469, t584, t595, t622, t636, i4.i0.t406, i4.i0.t588, i4.i0.t591, i4.i0.u24.t593, i4.i0.u24.t594, i4.i0.u36.t22, i4.i0.u36.t394, i4.i0.u36.t397, i4.i0.u36.t586, i4.i0.u36.t587, i5.t597, i6.u35.t395, i6.u50.t18, i7.t638, i7.t637, i7.t555, i8.t632, i8.i0.t631, i8.i0.t633, i8.i0.t634, i8.i0.u69.t556, i8.i0.u70.t0, i8.i0.u70.t557, i8.i1.u79.t14, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :282/275/31/588
(forward)formula 0,1,15.8818,328000,1,0,447827,53506,8092,1.51377e+06,2402,213882,782506
FORMULA ASLink-PT-01b-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 153 rules applied. Total rules applied 153 place count 803 transition count 959
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 160 rules applied. Total rules applied 313 place count 650 transition count 952
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 318 place count 648 transition count 949
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 320 place count 646 transition count 949
Performed 193 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 193 Pre rules applied. Total rules applied 320 place count 646 transition count 756
Deduced a syphon composed of 193 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 4 with 399 rules applied. Total rules applied 719 place count 440 transition count 756
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 4 with 11 rules applied. Total rules applied 730 place count 439 transition count 746
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 740 place count 429 transition count 746
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 740 place count 429 transition count 742
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 752 place count 421 transition count 742
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 752 place count 421 transition count 739
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 758 place count 418 transition count 739
Discarding 24 places :
Symmetric choice reduction at 6 with 24 rule applications. Total rules 782 place count 394 transition count 715
Iterating global reduction 6 with 24 rules applied. Total rules applied 806 place count 394 transition count 715
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 806 place count 394 transition count 710
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 816 place count 389 transition count 710
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 827 place count 378 transition count 686
Iterating global reduction 6 with 11 rules applied. Total rules applied 838 place count 378 transition count 686
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 838 place count 378 transition count 685
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 840 place count 377 transition count 685
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 843 place count 374 transition count 675
Iterating global reduction 6 with 3 rules applied. Total rules applied 846 place count 374 transition count 675
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 848 place count 372 transition count 666
Iterating global reduction 6 with 2 rules applied. Total rules applied 850 place count 372 transition count 666
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 851 place count 371 transition count 658
Iterating global reduction 6 with 1 rules applied. Total rules applied 852 place count 371 transition count 658
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 853 place count 370 transition count 650
Iterating global reduction 6 with 1 rules applied. Total rules applied 854 place count 370 transition count 650
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 855 place count 369 transition count 642
Iterating global reduction 6 with 1 rules applied. Total rules applied 856 place count 369 transition count 642
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 857 place count 368 transition count 634
Iterating global reduction 6 with 1 rules applied. Total rules applied 858 place count 368 transition count 634
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 859 place count 367 transition count 626
Iterating global reduction 6 with 1 rules applied. Total rules applied 860 place count 367 transition count 626
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 861 place count 366 transition count 618
Iterating global reduction 6 with 1 rules applied. Total rules applied 862 place count 366 transition count 618
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 863 place count 365 transition count 610
Iterating global reduction 6 with 1 rules applied. Total rules applied 864 place count 365 transition count 610
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 6 with 105 rules applied. Total rules applied 969 place count 312 transition count 558
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 971 place count 310 transition count 556
Ensure Unique test removed 1 places
Iterating global reduction 6 with 3 rules applied. Total rules applied 974 place count 309 transition count 556
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 976 place count 307 transition count 554
Iterating global reduction 6 with 2 rules applied. Total rules applied 978 place count 307 transition count 554
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 980 place count 307 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 981 place count 306 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 983 place count 305 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 984 place count 304 transition count 557
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 985 place count 303 transition count 556
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 988 place count 301 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 989 place count 300 transition count 555
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 989 place count 300 transition count 552
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 7 rules applied. Total rules applied 996 place count 296 transition count 552
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 10 with 2 rules applied. Total rules applied 998 place count 294 transition count 552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 998 place count 294 transition count 551
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1000 place count 293 transition count 551
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1006 place count 290 transition count 548
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1007 place count 289 transition count 547
Iterating global reduction 11 with 1 rules applied. Total rules applied 1008 place count 289 transition count 547
Applied a total of 1008 rules in 163 ms. Remains 289 /804 variables (removed 515) and now considering 547/1113 (removed 566) transitions.
[2021-05-11 07:26:02] [INFO ] Flatten gal took : 25 ms
[2021-05-11 07:26:02] [INFO ] Flatten gal took : 28 ms
[2021-05-11 07:26:02] [INFO ] Input system was already deterministic with 547 transitions.
[2021-05-11 07:26:02] [INFO ] Flatten gal took : 18 ms
[2021-05-11 07:26:02] [INFO ] Flatten gal took : 18 ms
[2021-05-11 07:26:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17859758407173459560.gal : 3 ms
[2021-05-11 07:26:02] [INFO ] Time to serialize properties into /tmp/CTLFireability3165343232901708922.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/CTLFireability17859758407173459560.gal, -t, CGAL, -ctl, /tmp/CTLFireability3165343232901708922.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/CTLFireability17859758407173459560.gal -t CGAL -ctl /tmp/CTLFireability3165343232901708922.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.29254e+07,3.0846,87244,2,23008,5,226478,6,0,1705,241581,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((!(AF((((((((p666==1)||((p25==1)&&(p158==1)))||(p520==1))||(p50==1))||((p435==1)&&(p553==1)))||(p313==1))||((p116==1)&&(p494==1))))) + (p304==1)) + ((p435==1)&&(p562==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((!(!(EG(!((((((((p666==1)||((p25==1)&&(p158==1)))||(p520==1))||(p50==1))||((p435==1)&&(p553==1)))||(p313==1))||((p116==1)&&(p494==1))))))) + (p304==1)) + ((p435==1)&&(p562==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t7, t16, t156, t299, t300, t306, t311, t433, t434, t435, t471, t474, t476, t477, t502, t503, t504, t507, t508, t510, t511, t512, t515, t517, t519, t541, t546, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :273/245/29/547
Detected timeout of ITS tools.
[2021-05-11 07:26:32] [INFO ] Flatten gal took : 18 ms
[2021-05-11 07:26:32] [INFO ] Applying decomposition
[2021-05-11 07:26:32] [INFO ] Flatten gal took : 19 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/graph10425559477243826414.txt, -o, /tmp/graph10425559477243826414.bin, -w, /tmp/graph10425559477243826414.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/graph10425559477243826414.bin, -l, -1, -v, -w, /tmp/graph10425559477243826414.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 07:26:32] [INFO ] Decomposing Gal with order
[2021-05-11 07:26:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:26:32] [INFO ] Removed a total of 929 redundant transitions.
[2021-05-11 07:26:32] [INFO ] Flatten gal took : 35 ms
[2021-05-11 07:26:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2021-05-11 07:26:32] [INFO ] Time to serialize gal into /tmp/CTLFireability12017103980381238138.gal : 3 ms
[2021-05-11 07:26:32] [INFO ] Time to serialize properties into /tmp/CTLFireability248465789592955217.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/CTLFireability12017103980381238138.gal, -t, CGAL, -ctl, /tmp/CTLFireability248465789592955217.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/CTLFireability12017103980381238138.gal -t CGAL -ctl /tmp/CTLFireability248465789592955217.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.29254e+07,1.52562,46140,1704,1022,63220,15852,1036,125523,331,87332,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((!(AF((((((((i7.u61.p666==1)||((i0.u4.p25==1)&&(i0.u21.p158==1)))||(i2.u48.p520==1))||(i1.u9.p50==1))||((i5.i0.u37.p435==1)&&(i5.i1.u55.p553==1)))||(i4.u32.p313==1))||((i2.u17.p116==1)&&(i2.u45.p494==1))))) + (i3.u31.p304==1)) + ((i5.i0.u37.p435==1)&&(i5.i1.u58.p562==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((!(!(EG(!((((((((i7.u61.p666==1)||((i0.u4.p25==1)&&(i0.u21.p158==1)))||(i2.u48.p520==1))||(i1.u9.p50==1))||((i5.i0.u37.p435==1)&&(i5.i1.u55.p553==1)))||(i4.u32.p313==1))||((i2.u17.p116==1)&&(i2.u45.p494==1))))))) + (i3.u31.p304==1)) + ((i5.i0.u37.p435==1)&&(i5.i1.u58.p562==1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t299, t471, t474, t477, t502, t504, t541, t546, i1.t16, i2.t156, i2.t7, i3.t311, i3.t300, i3.u30.t306, i4.t476, i6.u51.t0, i6.u51.t435, i6.u51.t507, i6.u51.t508, i6.u51.t515, i6.u51.t517, i6.u51.t519, i6.u52.t434, i7.t512, i7.t511, i7.t510, i7.t433, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :273/225/28/526
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,24.6917,602444,1,0,901327,59865,7705,2.53125e+06,2631,313059,2065198
FORMULA ASLink-PT-01b-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2021-05-11 07:26:57] [INFO ] Flatten gal took : 71 ms
[2021-05-11 07:26:57] [INFO ] Flatten gal took : 34 ms
[2021-05-11 07:26:57] [INFO ] Applying decomposition
[2021-05-11 07:26:57] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8985404447121393522.txt, -o, /tmp/graph8985404447121393522.bin, -w, /tmp/graph8985404447121393522.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/graph8985404447121393522.bin, -l, -1, -v, -w, /tmp/graph8985404447121393522.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-11 07:26:57] [INFO ] Decomposing Gal with order
[2021-05-11 07:26:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:26:57] [INFO ] Removed a total of 996 redundant transitions.
[2021-05-11 07:26:58] [INFO ] Flatten gal took : 121 ms
[2021-05-11 07:26:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 5 ms.
[2021-05-11 07:26:58] [INFO ] Time to serialize gal into /tmp/CTLFireability15858831522850175930.gal : 7 ms
[2021-05-11 07:26:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14778995094157559731.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/CTLFireability15858831522850175930.gal, -t, CGAL, -ctl, /tmp/CTLFireability14778995094157559731.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/CTLFireability15858831522850175930.gal -t CGAL -ctl /tmp/CTLFireability14778995094157559731.ctl
No direction supplied, using forward translation only.
Parsed 10 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.69548e+14,183.146,2301624,18034,205,3.50508e+06,2973,1922,7.60002e+06,143,7000,0


Converting to forward existential form...Done !
original formula: A((((!(E(((((i10.u64.p388==1)&&(i3.u147.p395==1))||(i9.u163.p440==1))&&((((i11.u216.p587==1)||((i1.u10.p32==1)&&(i1.u58.p169==1)))||(i7.u124.p338==1))||(i0.i1.i1.u16.p43==1))) U (AF((((((((((i16.u238.p633==1)||(i14.i1.i1.u228.p621==1))||((i3.u32.p90==1)&&(i3.u86.p251==1)))||(i1.u4.p10==1))||((i13.u37.p109==1)&&(i13.u181.p483==1)))||(i13.u38.p111==1))||(i12.i0.i1.u171.p458==1))||(i10.u75.p220==1))||(i16.u287.p803==1))) + EX((((((((i11.u281.p779==1)||((i12.i0.i1.u149.p403==1)&&(i12.i0.i1.u168.p453==1)))||((i13.u36.p104==1)&&(i13.u194.p518==1)))||(i11.u284.p791==1))||((i1.u9.p28==1)&&(i1.u61.p178==1)))||((i13.u34.p96==1)&&(i13.u184.p491==1)))||(i13.u33.p94==1)))))) + (i14.i0.i0.u201.p536==1)) + (i2.u28.p79==1)) + ((i0.i0.i1.u15.p47==1)&&(i0.i0.i2.u21.p61==1))) U ((AG((!(EX(((((((((((i13.u195.p520==1)||(i2.u29.p82==1))||((i13.u35.p101==1)&&(i13.u193.p516==1)))||((i10.u113.p328==1)&&(i9.u161.p423==1)))||(i14.i1.i0.u227.p607==1))||((i13.u35.p100==1)&&(i13.u192.p512==1)))||(i0.i0.i3.u20.p59==1))||(i15.u263.p708==1))||(i11.u223.p598==1))||((i13.u35.p101==1)&&(i13.u191.p510==1))))) + EF(((((((((i17.u291.p813==1)||(i15.u257.p687==1))||(i16.u241.p639==1))||(i14.i0.i1.u226.p622==1))||(i16.u245.p658==1))||((i9.u161.p435==1)&&(i9.u205.p547==1)))||(i12.i0.i1.u172.p462==1))||(i9.u134.p361==1))))) + ((((((i13.u180.p479==1)||(i17.u290.p823==1))||((i13.u36.p105==1)&&(i13.u196.p525==1)))||((i11.u179.p478==1)&&(i11.u224.p600==1)))||((i13.u40.p120==1)&&(i13.u196.p524==1))) * (EG(((i1.u5.p13==1)&&(i1.u57.p167==1))) + AX((((((((i5.i1.i1.u119.p324==1)||((i13.u40.p120==1)&&(i13.u184.p491==1)))||(i17.u292.p811==1))||((i1.u10.p33==1)&&(i1.u60.p176==1)))||((i13.u40.p121==1)&&(i13.u180.p480==1)))||((i15.u203.p542==1)&&(i15.u256.p684==1)))||(i10.u75.p220==1)))))) + (EX(EF(((((((((i11.u224.p601==0)&&((i13.u39.p116==0)||(i13.u183.p488==0)))&&((i13.u39.p117==0)||(i13.u187.p501==0)))&&((i10.u77.p230==0)||(i9.u161.p423==0)))&&((i15.u202.p540==0)||(i15.u271.p742==0)))&&((i14.i0.i0.u201.p537==0)||(i14.i0.i1.u244.p763==0)))&&(i1.u10.p30==0))&&(i11.u223.p598==0)))) * E(((((((((((((((((((EF((((((i15.u267.p729==1)||(i5.i0.i1.u102.p288==1))||((i9.u163.p441==1)&&(i9.u208.p556==1)))||((i13.u35.p101==1)&&(i13.u184.p492==1)))||(i5.i0.i0.u94.p270==1))) + ((i13.u34.p97==1)&&(i13.u186.p498==1))) + (i12.i1.i1.u70.p209==1)) + (i11.u285.p795==1)) + (i16.u245.p658==1)) + (i11.u179.p477==1)) + ((i0.i1.i1.u16.p49==1)&&(i0.i0.i1.u15.p67==1))) + (i13.u190.p506==1)) + (i16.u269.p628==1)) + (i0.i0.i2.u21.p62==1)) + (i15.u266.p724==1)) + (i16.u277.p648==1)) + ((i13.u35.p100==1)&&(i13.u195.p521==1))) + ((i16.u245.p818==1)&&(i11.u294.p827==1))) + ((i11.u213.p577==1)&&(i11.u247.p830==1))) + ((i13.u36.p105==1)&&(i13.u182.p486==1))) + ((i11.u219.p586==1)&&(i11.u279.p772==1))) + ((i13.u33.p92==1)&&(i10.u75.p219==1))) + ((((i12.i0.i1.u153.p416==1)&&(i12.i0.i1.u153.p420==1))||(i0.i1.i0.u18.p76==1))&&((((((i15.u204.p544==1)&&(i15.u231.p693==1))||((i13.u41.p124==1)&&(i13.u195.p521==1)))||(i2.u144.p384==1))||(i1.u12.p39==1))||((i13.u38.p112==1)&&(i13.u183.p488==1))))) U (((((((((i13.u35.p100==1)&&(i13.u184.p491==1))||(i12.i0.i1.u172.p451==1))||(i3.u32.p89==1))||((i13.u35.p100==1)&&(i13.u193.p515==1)))||(i15.u278.p770==1))||(i1.u4.p10==1))||((i1.u9.p29==1)&&(i1.u54.p158==1)))||(i11.u247.p662==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !((!(EX(((((((((((i13.u195.p520==1)||(i2.u29.p82==1))||((i13.u35.p101==1)&&(i13.u193.p516==1)))||((i10.u113.p328==1)&&(i9.u161.p423==1)))||(i14.i1.i0.u227.p607==1))||((i13.u35.p100==1)&&(i13.u192.p512==1)))||(i0.i0.i3.u20.p59==1))||(i15.u263.p708==1))||(i11.u223.p598==1))||((i13.u35.p101==1)&&(i13.u191.p510==1))))) + E(TRUE U ((((((((i17.u291.p813==1)||(i15.u257.p687==1))||(i16.u241.p639==1))||(i14.i0.i1.u226.p622==1))||(i16.u245.p658==1))||((i9.u161.p435==1)&&(i9.u205.p547==1)))||(i12.i0.i1.u172.p462==1))||(i9.u134.p361==1))))))) + ((((((i13.u180.p479==1)||(i17.u290.p823==1))||((i13.u36.p105==1)&&(i13.u196.p525==1)))||((i11.u179.p478==1)&&(i11.u224.p600==1)))||((i13.u40.p120==1)&&(i13.u196.p524==1))) * (EG(((i1.u5.p13==1)&&(i1.u57.p167==1))) + !(EX(!((((((((i5.i1.i1.u119.p324==1)||((i13.u40.p120==1)&&(i13.u184.p491==1)))||(i17.u292.p811==1))||((i1.u10.p33==1)&&(i1.u60.p176==1)))||((i13.u40.p121==1)&&(i13.u180.p480==1)))||((i15.u203.p542==1)&&(i15.u256.p684==1)))||(i10.u75.p220==1)))))))) + (EX(E(TRUE U ((((((((i11.u224.p601==0)&&((i13.u39.p116==0)||(i13.u183.p488==0)))&&((i13.u39.p117==0)||(i13.u187.p501==0)))&&((i10.u77.p230==0)||(i9.u161.p423==0)))&&((i15.u202.p540==0)||(i15.u271.p742==0)))&&((i14.i0.i0.u201.p537==0)||(i14.i0.i1.u244.p763==0)))&&(i1.u10.p30==0))&&(i11.u223.p598==0)))) * E(((((((((((((((((((E(TRUE U (((((i15.u267.p729==1)||(i5.i0.i1.u102.p288==1))||((i9.u163.p441==1)&&(i9.u208.p556==1)))||((i13.u35.p101==1)&&(i13.u184.p492==1)))||(i5.i0.i0.u94.p270==1))) + ((i13.u34.p97==1)&&(i13.u186.p498==1))) + (i12.i1.i1.u70.p209==1)) + (i11.u285.p795==1)) + (i16.u245.p658==1)) + (i11.u179.p477==1)) + ((i0.i1.i1.u16.p49==1)&&(i0.i0.i1.u15.p67==1))) + (i13.u190.p506==1)) + (i16.u269.p628==1)) + (i0.i0.i2.u21.p62==1)) + (i15.u266.p724==1)) + (i16.u277.p648==1)) + ((i13.u35.p100==1)&&(i13.u195.p521==1))) + ((i16.u245.p818==1)&&(i11.u294.p827==1))) + ((i11.u213.p577==1)&&(i11.u247.p830==1))) + ((i13.u36.p105==1)&&(i13.u182.p486==1))) + ((i11.u219.p586==1)&&(i11.u279.p772==1))) + ((i13.u33.p92==1)&&(i10.u75.p219==1))) + ((((i12.i0.i1.u153.p416==1)&&(i12.i0.i1.u153.p420==1))||(i0.i1.i0.u18.p76==1))&&((((((i15.u204.p544==1)&&(i15.u231.p693==1))||((i13.u41.p124==1)&&(i13.u195.p521==1)))||(i2.u144.p384==1))||(i1.u12.p39==1))||((i13.u38.p112==1)&&(i13.u183.p488==1))))) U (((((((((i13.u35.p100==1)&&(i13.u184.p491==1))||(i12.i0.i1.u172.p451==1))||(i3.u32.p89==1))||((i13.u35.p100==1)&&(i13.u193.p515==1)))||(i15.u278.p770==1))||(i1.u4.p10==1))||((i1.u9.p29==1)&&(i1.u54.p158==1)))||(i11.u247.p662==1))))))))) * !(E(!(((!(E(TRUE U !((!(EX(((((((((((i13.u195.p520==1)||(i2.u29.p82==1))||((i13.u35.p101==1)&&(i13.u193.p516==1)))||((i10.u113.p328==1)&&(i9.u161.p423==1)))||(i14.i1.i0.u227.p607==1))||((i13.u35.p100==1)&&(i13.u192.p512==1)))||(i0.i0.i3.u20.p59==1))||(i15.u263.p708==1))||(i11.u223.p598==1))||((i13.u35.p101==1)&&(i13.u191.p510==1))))) + E(TRUE U ((((((((i17.u291.p813==1)||(i15.u257.p687==1))||(i16.u241.p639==1))||(i14.i0.i1.u226.p622==1))||(i16.u245.p658==1))||((i9.u161.p435==1)&&(i9.u205.p547==1)))||(i12.i0.i1.u172.p462==1))||(i9.u134.p361==1))))))) + ((((((i13.u180.p479==1)||(i17.u290.p823==1))||((i13.u36.p105==1)&&(i13.u196.p525==1)))||((i11.u179.p478==1)&&(i11.u224.p600==1)))||((i13.u40.p120==1)&&(i13.u196.p524==1))) * (EG(((i1.u5.p13==1)&&(i1.u57.p167==1))) + !(EX(!((((((((i5.i1.i1.u119.p324==1)||((i13.u40.p120==1)&&(i13.u184.p491==1)))||(i17.u292.p811==1))||((i1.u10.p33==1)&&(i1.u60.p176==1)))||((i13.u40.p121==1)&&(i13.u180.p480==1)))||((i15.u203.p542==1)&&(i15.u256.p684==1)))||(i10.u75.p220==1)))))))) + (EX(E(TRUE U ((((((((i11.u224.p601==0)&&((i13.u39.p116==0)||(i13.u183.p488==0)))&&((i13.u39.p117==0)||(i13.u187.p501==0)))&&((i10.u77.p230==0)||(i9.u161.p423==0)))&&((i15.u202.p540==0)||(i15.u271.p742==0)))&&((i14.i0.i0.u201.p537==0)||(i14.i0.i1.u244.p763==0)))&&(i1.u10.p30==0))&&(i11.u223.p598==0)))) * E(((((((((((((((((((E(TRUE U (((((i15.u267.p729==1)||(i5.i0.i1.u102.p288==1))||((i9.u163.p441==1)&&(i9.u208.p556==1)))||((i13.u35.p101==1)&&(i13.u184.p492==1)))||(i5.i0.i0.u94.p270==1))) + ((i13.u34.p97==1)&&(i13.u186.p498==1))) + (i12.i1.i1.u70.p209==1)) + (i11.u285.p795==1)) + (i16.u245.p658==1)) + (i11.u179.p477==1)) + ((i0.i1.i1.u16.p49==1)&&(i0.i0.i1.u15.p67==1))) + (i13.u190.p506==1)) + (i16.u269.p628==1)) + (i0.i0.i2.u21.p62==1)) + (i15.u266.p724==1)) + (i16.u277.p648==1)) + ((i13.u35.p100==1)&&(i13.u195.p521==1))) + ((i16.u245.p818==1)&&(i11.u294.p827==1))) + ((i11.u213.p577==1)&&(i11.u247.p830==1))) + ((i13.u36.p105==1)&&(i13.u182.p486==1))) + ((i11.u219.p586==1)&&(i11.u279.p772==1))) + ((i13.u33.p92==1)&&(i10.u75.p219==1))) + ((((i12.i0.i1.u153.p416==1)&&(i12.i0.i1.u153.p420==1))||(i0.i1.i0.u18.p76==1))&&((((((i15.u204.p544==1)&&(i15.u231.p693==1))||((i13.u41.p124==1)&&(i13.u195.p521==1)))||(i2.u144.p384==1))||(i1.u12.p39==1))||((i13.u38.p112==1)&&(i13.u183.p488==1))))) U (((((((((i13.u35.p100==1)&&(i13.u184.p491==1))||(i12.i0.i1.u172.p451==1))||(i3.u32.p89==1))||((i13.u35.p100==1)&&(i13.u193.p515==1)))||(i15.u278.p770==1))||(i1.u4.p10==1))||((i1.u9.p29==1)&&(i1.u54.p158==1)))||(i11.u247.p662==1)))))) U (!((((!(E(((((i10.u64.p388==1)&&(i3.u147.p395==1))||(i9.u163.p440==1))&&((((i11.u216.p587==1)||((i1.u10.p32==1)&&(i1.u58.p169==1)))||(i7.u124.p338==1))||(i0.i1.i1.u16.p43==1))) U (!(EG(!((((((((((i16.u238.p633==1)||(i14.i1.i1.u228.p621==1))||((i3.u32.p90==1)&&(i3.u86.p251==1)))||(i1.u4.p10==1))||((i13.u37.p109==1)&&(i13.u181.p483==1)))||(i13.u38.p111==1))||(i12.i0.i1.u171.p458==1))||(i10.u75.p220==1))||(i16.u287.p803==1))))) + EX((((((((i11.u281.p779==1)||((i12.i0.i1.u149.p403==1)&&(i12.i0.i1.u168.p453==1)))||((i13.u36.p104==1)&&(i13.u194.p518==1)))||(i11.u284.p791==1))||((i1.u9.p28==1)&&(i1.u61.p178==1)))||((i13.u34.p96==1)&&(i13.u184.p491==1)))||(i13.u33.p94==1)))))) + (i14.i0.i0.u201.p536==1)) + (i2.u28.p79==1)) + ((i0.i0.i1.u15.p47==1)&&(i0.i0.i2.u21.p61==1)))) * !(((!(E(TRUE U !((!(EX(((((((((((i13.u195.p520==1)||(i2.u29.p82==1))||((i13.u35.p101==1)&&(i13.u193.p516==1)))||((i10.u113.p328==1)&&(i9.u161.p423==1)))||(i14.i1.i0.u227.p607==1))||((i13.u35.p100==1)&&(i13.u192.p512==1)))||(i0.i0.i3.u20.p59==1))||(i15.u263.p708==1))||(i11.u223.p598==1))||((i13.u35.p101==1)&&(i13.u191.p510==1))))) + E(TRUE U ((((((((i17.u291.p813==1)||(i15.u257.p687==1))||(i16.u241.p639==1))||(i14.i0.i1.u226.p622==1))||(i16.u245.p658==1))||((i9.u161.p435==1)&&(i9.u205.p547==1)))||(i12.i0.i1.u172.p462==1))||(i9.u134.p361==1))))))) + ((((((i13.u180.p479==1)||(i17.u290.p823==1))||((i13.u36.p105==1)&&(i13.u196.p525==1)))||((i11.u179.p478==1)&&(i11.u224.p600==1)))||((i13.u40.p120==1)&&(i13.u196.p524==1))) * (EG(((i1.u5.p13==1)&&(i1.u57.p167==1))) + !(EX(!((((((((i5.i1.i1.u119.p324==1)||((i13.u40.p120==1)&&(i13.u184.p491==1)))||(i17.u292.p811==1))||((i1.u10.p33==1)&&(i1.u60.p176==1)))||((i13.u40.p121==1)&&(i13.u180.p480==1)))||((i15.u203.p542==1)&&(i15.u256.p684==1)))||(i10.u75.p220==1)))))))) + (EX(E(TRUE U ((((((((i11.u224.p601==0)&&((i13.u39.p116==0)||(i13.u183.p488==0)))&&((i13.u39.p117==0)||(i13.u187.p501==0)))&&((i10.u77.p230==0)||(i9.u161.p423==0)))&&((i15.u202.p540==0)||(i15.u271.p742==0)))&&((i14.i0.i0.u201.p537==0)||(i14.i0.i1.u244.p763==0)))&&(i1.u10.p30==0))&&(i11.u223.p598==0)))) * E(((((((((((((((((((E(TRUE U (((((i15.u267.p729==1)||(i5.i0.i1.u102.p288==1))||((i9.u163.p441==1)&&(i9.u208.p556==1)))||((i13.u35.p101==1)&&(i13.u184.p492==1)))||(i5.i0.i0.u94.p270==1))) + ((i13.u34.p97==1)&&(i13.u186.p498==1))) + (i12.i1.i1.u70.p209==1)) + (i11.u285.p795==1)) + (i16.u245.p658==1)) + (i11.u179.p477==1)) + ((i0.i1.i1.u16.p49==1)&&(i0.i0.i1.u15.p67==1))) + (i13.u190.p506==1)) + (i16.u269.p628==1)) + (i0.i0.i2.u21.p62==1)) + (i15.u266.p724==1)) + (i16.u277.p648==1)) + ((i13.u35.p100==1)&&(i13.u195.p521==1))) + ((i16.u245.p818==1)&&(i11.u294.p827==1))) + ((i11.u213.p577==1)&&(i11.u247.p830==1))) + ((i13.u36.p105==1)&&(i13.u182.p486==1))) + ((i11.u219.p586==1)&&(i11.u279.p772==1))) + ((i13.u33.p92==1)&&(i10.u75.p219==1))) + ((((i12.i0.i1.u153.p416==1)&&(i12.i0.i1.u153.p420==1))||(i0.i1.i0.u18.p76==1))&&((((((i15.u204.p544==1)&&(i15.u231.p693==1))||((i13.u41.p124==1)&&(i13.u195.p521==1)))||(i2.u144.p384==1))||(i1.u12.p39==1))||((i13.u38.p112==1)&&(i13.u183.p488==1))))) U (((((((((i13.u35.p100==1)&&(i13.u184.p491==1))||(i12.i0.i1.u172.p451==1))||(i3.u32.p89==1))||((i13.u35.p100==1)&&(i13.u193.p515==1)))||(i15.u278.p770==1))||(i1.u4.p10==1))||((i1.u9.p29==1)&&(i1.u54.p158==1)))||(i11.u247.p662==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t110, t163, t360, t372, t390, t967, t1025, i0.i0.t1109, i0.i0.i0.u19.t402, i0.i0.i1.u2.t415, i0.i0.i2.u21.t404, i0.i0.i3.u152.t235, i0.i1.i1.t410, i0.i1.i1.u16.t412, i0.i1.i1.u16.t414, i2.t218, i2.u166.t221, i5.i0.t325, i5.i0.i0.u95.t322, i5.i1.i0.t370, i5.i1.i1.t452, i5.i1.i1.t305, i5.i1.i2.t287, i5.i1.i2.u131.t442, i9.t229, i10.t348, i10.t326, i10.t290, i10.t238, i10.t204, i10.u64.t347, i10.u75.t246, i10.u174.t202, i10.u176.t206, i11.t199, i11.t189, i11.t153, i11.t23, i11.t22, i11.t21, i11.u213.t159, i11.u246.t43, i11.u247.t73, i11.u219.t155, i11.u219.t157, i12.i0.i1.t209, i12.i0.i1.u171.t211, i12.i0.i1.u171.t213, i12.i0.i1.u171.t215, i12.i1.i0.u53.t359, i12.i1.i1.t259, i12.i1.i1.t252, i12.i1.i1.t244, i14.t135, i14.i0.t1018, i14.i0.i1.t150, i14.i0.i2.t148, i14.i0.i2.u251.t84, i14.i0.i2.u251.t98, i14.i1.i0.t133, i15.t996, i15.t992, i15.t978, i15.t965, i15.t175, i15.u203.t179, i15.u262.t103, i15.u262.t122, i15.u262.t125, i16.t109, i16.t32, i16.t24, i16.u240.t91, i16.u269.t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :343/674/77/1094
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
[2021-05-11 07:48:44] [INFO ] Applying decomposition
[2021-05-11 07:48:44] [INFO ] Flatten gal took : 48 ms
[2021-05-11 07:48:44] [INFO ] Decomposing Gal with order
[2021-05-11 07:48:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-11 07:48:44] [INFO ] Removed a total of 915 redundant transitions.
[2021-05-11 07:48:44] [INFO ] Flatten gal took : 74 ms
[2021-05-11 07:48:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 909 labels/synchronizations in 76 ms.
[2021-05-11 07:48:44] [INFO ] Time to serialize gal into /tmp/CTLFireability1656018246398105830.gal : 4 ms
[2021-05-11 07:48:44] [INFO ] Time to serialize properties into /tmp/CTLFireability11850951798921864691.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/CTLFireability1656018246398105830.gal, -t, CGAL, -ctl, /tmp/CTLFireability11850951798921864691.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/CTLFireability1656018246398105830.gal -t CGAL -ctl /tmp/CTLFireability11850951798921864691.ctl
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Detected timeout of ITS tools.
[2021-05-11 08:10:32] [INFO ] Flatten gal took : 327 ms
[2021-05-11 08:10:33] [INFO ] Input system was already deterministic with 1113 transitions.
[2021-05-11 08:10:33] [INFO ] Transformed 804 places.
[2021-05-11 08:10:33] [INFO ] Transformed 1113 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-11 08:11:03] [INFO ] Time to serialize gal into /tmp/CTLFireability12132082274518256162.gal : 15 ms
[2021-05-11 08:11:03] [INFO ] Time to serialize properties into /tmp/CTLFireability6810640386387514300.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability12132082274518256162.gal, -t, CGAL, -ctl, /tmp/CTLFireability6810640386387514300.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/CTLFireability12132082274518256162.gal -t CGAL -ctl /tmp/CTLFireability6810640386387514300.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 10 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="ASLink-PT-01b"
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 ASLink-PT-01b, 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 r007-tall-162037989400020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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