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

About the Execution of ITS-Tools for CANConstruction-PT-005

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
952.447 37593.00 44244.00 328.50 TTTTTTTFTFTFTFFF 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.r292-tall-162124155800002.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 CANConstruction-PT-005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155800002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 167K May 12 08:13 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 CANConstruction-PT-005-CTLFireability-00
FORMULA_NAME CANConstruction-PT-005-CTLFireability-01
FORMULA_NAME CANConstruction-PT-005-CTLFireability-02
FORMULA_NAME CANConstruction-PT-005-CTLFireability-03
FORMULA_NAME CANConstruction-PT-005-CTLFireability-04
FORMULA_NAME CANConstruction-PT-005-CTLFireability-05
FORMULA_NAME CANConstruction-PT-005-CTLFireability-06
FORMULA_NAME CANConstruction-PT-005-CTLFireability-07
FORMULA_NAME CANConstruction-PT-005-CTLFireability-08
FORMULA_NAME CANConstruction-PT-005-CTLFireability-09
FORMULA_NAME CANConstruction-PT-005-CTLFireability-10
FORMULA_NAME CANConstruction-PT-005-CTLFireability-11
FORMULA_NAME CANConstruction-PT-005-CTLFireability-12
FORMULA_NAME CANConstruction-PT-005-CTLFireability-13
FORMULA_NAME CANConstruction-PT-005-CTLFireability-14
FORMULA_NAME CANConstruction-PT-005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621242820105

Running Version 0
[2021-05-17 09:13:41] [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-17 09:13:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 09:13:41] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2021-05-17 09:13:41] [INFO ] Transformed 112 places.
[2021-05-17 09:13:41] [INFO ] Transformed 140 transitions.
[2021-05-17 09:13:41] [INFO ] Parsed PT model containing 112 places and 140 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2021-05-17 09:13:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 09:13:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 09:13:41] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 09:13:41] [INFO ] Reduced 1 identical enabling conditions.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 112/112 places, 140/140 transitions.
Applied a total of 0 rules in 10 ms. Remains 112 /112 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 112 cols
[2021-05-17 09:13:41] [INFO ] Computed 11 place invariants in 12 ms
[2021-05-17 09:13:41] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 140 rows 112 cols
[2021-05-17 09:13:41] [INFO ] Computed 11 place invariants in 13 ms
[2021-05-17 09:13:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2021-05-17 09:13:41] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 112 cols
[2021-05-17 09:13:41] [INFO ] Computed 11 place invariants in 5 ms
[2021-05-17 09:13:42] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 1 iterations. Remains : 112/112 places, 140/140 transitions.
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 37 ms
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 17 ms
[2021-05-17 09:13:42] [INFO ] Input system was already deterministic with 140 transitions.
Finished random walk after 2880 steps, including 36 resets, run visited all 85 properties in 19 ms. (steps per millisecond=151 )
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 112 transition count 125
Reduce places removed 15 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 21 rules applied. Total rules applied 36 place count 97 transition count 119
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 91 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 42 place count 91 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 46 place count 89 transition count 117
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 58 place count 77 transition count 93
Iterating global reduction 3 with 12 rules applied. Total rules applied 70 place count 77 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 75 transition count 91
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 82 place count 71 transition count 97
Applied a total of 82 rules in 34 ms. Remains 71 /112 variables (removed 41) and now considering 97/140 (removed 43) transitions.
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:42] [INFO ] Input system was already deterministic with 97 transitions.
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:42] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12272304241850549032.gal : 3 ms
[2021-05-17 09:13:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15643173298615689086.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/CTLFireability12272304241850549032.gal, -t, CGAL, -ctl, /tmp/CTLFireability15643173298615689086.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/CTLFireability12272304241850549032.gal -t CGAL -ctl /tmp/CTLFireability15643173298615689086.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,15024,0.116299,8880,2,2666,5,19344,6,0,366,14473,0


Converting to forward existential form...Done !
original formula: EF(!(EF(AG(A(((((((((Node0ID>=1)||((Node3IsInserted>=1)&&(Node4Request>=1)))||(Node4DHTinfo>=1))||(Node2GiveAnswer3>=1))||(Node3DHTinfo>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node0IsNonInsertedNode>=1))||(Node4GiveAnswer2>=1)) U (((((((Node2ID>=1)||(Node3GiveAnswer4>=1))||(Node2JoinMsg>=1))||(Node0ID2>=1))||(Node2IsNonInsertedNode>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((Node4WaitAnswer>=1)&&(Node4NOshare>=1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(!((E(!((((((((Node2ID>=1)||(Node3GiveAnswer4>=1))||(Node2JoinMsg>=1))||(Node0ID2>=1))||(Node2IsNonInsertedNode>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((Node4WaitAnswer>=1)&&(Node4NOshare>=1)))) U (!(((((((((Node0ID>=1)||((Node3IsInserted>=1)&&(Node4Request>=1)))||(Node4DHTinfo>=1))||(Node2GiveAnswer3>=1))||(Node3DHTinfo>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node0IsNonInsertedNode>=1))||(Node4GiveAnswer2>=1))) * !((((((((Node2ID>=1)||(Node3GiveAnswer4>=1))||(Node2JoinMsg>=1))||(Node0ID2>=1))||(Node2IsNonInsertedNode>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((Node4WaitAnswer>=1)&&(Node4NOshare>=1)))))) + EG(!((((((((Node2ID>=1)||(Node3GiveAnswer4>=1))||(Node2JoinMsg>=1))||(Node0ID2>=1))||(Node2IsNonInsertedNode>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((Node4WaitAnswer>=1)&&(Node4NOshare>=1)))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t8, t13, t17, t18, t21, t22, t28, t29, t39, t40, t48, t49, t54, t55, t57, t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/79/18/97
(forward)formula 0,1,2.29494,78200,1,0,364,429019,226,180,2388,317666,439
FORMULA CANConstruction-PT-005-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 112 transition count 135
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 9 rules applied. Total rules applied 14 place count 107 transition count 131
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 18 place count 103 transition count 131
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 103 transition count 129
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 101 transition count 129
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 24 place count 99 transition count 125
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 99 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 98 transition count 124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 32 place count 96 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 96 transition count 124
Applied a total of 33 rules in 20 ms. Remains 96 /112 variables (removed 16) and now considering 124/140 (removed 16) transitions.
[2021-05-17 09:13:44] [INFO ] Flatten gal took : 7 ms
[2021-05-17 09:13:44] [INFO ] Flatten gal took : 7 ms
[2021-05-17 09:13:44] [INFO ] Input system was already deterministic with 124 transitions.
[2021-05-17 09:13:44] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:44] [INFO ] Flatten gal took : 5 ms
[2021-05-17 09:13:44] [INFO ] Time to serialize gal into /tmp/CTLFireability13918092957576987260.gal : 2 ms
[2021-05-17 09:13:44] [INFO ] Time to serialize properties into /tmp/CTLFireability16956973511362296248.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/CTLFireability13918092957576987260.gal, -t, CGAL, -ctl, /tmp/CTLFireability16956973511362296248.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/CTLFireability13918092957576987260.gal -t CGAL -ctl /tmp/CTLFireability16956973511362296248.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,56873,0.125137,9312,2,3433,5,18001,6,0,493,18131,0


Converting to forward existential form...Done !
original formula: ((!(EG(((((((((!(A((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1)) U ((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1)))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))) + !(EF((((((((((((AG((((((((((((Node3WaitAnswer>=1)&&(Node3NOshare>=1))||(Node1GiveAnswer3>=1))||(Node1ID2>=1))||((InsertedCount>=1)&&(Node0ReadyToInsert>=1)))||((EmptyCAN>=1)&&(Node3ReadyToInsert>=1)))||(Node2GiveAnswer1>=1))||(Node0JoinMsg>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||(Node0GiveAnswer4>=1))&&(((Node1GiveAnswer4>=1)||(Node0GiveAnswer3>=1))||(Node3ID>=1)))) + (Node0DHTinfo2>=1)) + ((Node0Request>=1)&&(Node3IsInserted>=1))) + ((EmptyCAN>=1)&&(Node0ReadyToInsert>=1))) + ((EmptyCAN>=1)&&(Node1ReadyToInsert>=1))) + ((Node0Request>=1)&&(Node4IsInserted>=1))) + (Node0JoinMsg>=1)) + (Node2GiveAnswer1>=1)) + (Node0GiveAnswer2>=1)) + (Node3ResZone>=1)) + ((Node1IsInserted>=1)&&(Node4Request>=1))) + ((Node3IsInserted>=1)&&(Node1requestsent3>=1)))))) + !(AG(EF(((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))
=> equivalent forward existential formula: ((((((((((([(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * !(E(TRUE U !((((((((((((Node3WaitAnswer>=1)&&(Node3NOshare>=1))||(Node1GiveAnswer3>=1))||(Node1ID2>=1))||((InsertedCount>=1)&&(Node0ReadyToInsert>=1)))||((EmptyCAN>=1)&&(Node3ReadyToInsert>=1)))||(Node2GiveAnswer1>=1))||(Node0JoinMsg>=1))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||(Node0GiveAnswer4>=1))&&(((Node1GiveAnswer4>=1)||(Node0GiveAnswer3>=1))||(Node3ID>=1)))))))] = FALSE * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * (Node0DHTinfo2>=1))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((Node0Request>=1)&&(Node3IsInserted>=1)))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((EmptyCAN>=1)&&(Node0ReadyToInsert>=1)))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((EmptyCAN>=1)&&(Node1ReadyToInsert>=1)))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((Node0Request>=1)&&(Node4IsInserted>=1)))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * (Node0JoinMsg>=1))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * (Node2GiveAnswer1>=1))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * (Node0GiveAnswer2>=1))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * (Node3ResZone>=1))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((Node1IsInserted>=1)&&(Node4Request>=1)))] = FALSE) * [(FwdU(((Init * !(!(!(E(TRUE U !(E(TRUE U ((((((((((((((((((((Node4ID2>=1)||(Node4JoinMsg>=1))||(Node0ResZone>=1))||(Node1GiveAnswer4>=1))||(Node0DHTinfo2>=1))||(Node3IsNonInsertedNode>=1))||(Node4GiveAnswer1>=1))||(Node3DHTinfo>=1))||(Node4ID>=1))||((Node3WaitAnswer>=1)&&(Node3OKshare>=1)))||(Node3GiveAnswer2>=1))||(Node4IsNonInsertedNode>=1))||((Node2Request>=1)&&(Node3IsInserted>=1)))||(Node4DHTinfo2>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))||(Node0IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node4Request>=1)))||((Node2IsInserted>=1)&&(Node3Request>=1)))||(Node2GiveAnswer0>=1))||(Node0ID2>=1))))))))) * !(!(EG(((((((((!(!((E(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))) U (!((((Node2Bootstrap>=1)||(Node1DHTinfo2>=1))||(Node4GiveAnswer1>=1))) * !(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))) + EG(!(((Node1GiveAnswer0>=1)||(Node4GiveAnswer3>=1))))))) + (Node1WaitAnswer<1)) + (Node1NOshare<1)) * ((Node3IsInserted<1)||(Node0requestsent3<1))) * (Node0ID2<1)) * (Node0GiveAnswer1<1)) * (Node4ResZone<1)) * ((Node1Request<1)||(Node2IsInserted<1))) * (Node2GiveAnswer4<1)))))),TRUE) * ((Node3IsInserted>=1)&&(Node1requestsent3>=1)))] = FALSE)
Reverse transition relation is NOT exact ! Due to transitions t2, t7, t11, t14, t18, t21, t27, t28, t35, t40, t45, t46, t49, t50, t53, t54, t57, t58, t61, t62, t66, t67, t70, t71, t74, t75, t78, t79, t82, t83, t86, t87, t91, t94, t95, t100, t101, t105, t106, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/85/39/124
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.16902,277596,1,0,770,1.5395e+06,308,429,3150,1.68867e+06,828
FORMULA CANConstruction-PT-005-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 112 transition count 120
Reduce places removed 20 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 92 transition count 115
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 87 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 50 place count 87 transition count 113
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 85 transition count 113
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 66 place count 73 transition count 89
Iterating global reduction 3 with 12 rules applied. Total rules applied 78 place count 73 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 71 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 67 transition count 94
Applied a total of 90 rules in 15 ms. Remains 67 /112 variables (removed 45) and now considering 94/140 (removed 46) transitions.
[2021-05-17 09:13:54] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:54] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:54] [INFO ] Input system was already deterministic with 94 transitions.
[2021-05-17 09:13:54] [INFO ] Flatten gal took : 5 ms
[2021-05-17 09:13:54] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability3488694222823524254.gal : 1 ms
[2021-05-17 09:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability14001966407408967060.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/CTLFireability3488694222823524254.gal, -t, CGAL, -ctl, /tmp/CTLFireability14001966407408967060.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/CTLFireability3488694222823524254.gal -t CGAL -ctl /tmp/CTLFireability14001966407408967060.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,12177,0.105964,8588,2,3410,5,17368,6,0,347,15398,0


Converting to forward existential form...Done !
original formula: !(AF(AG(((((((((Node0IsInserted>=1)&&(Node2requestsent0>=1))||(Node3DHTinfo>=1))||(Node2DHTinfo>=1))&&(((((Node3DHTinfo2>=1)||((Node3Request>=1)&&(Node4IsInserted>=1)))||(Node3GiveAnswer4>=1))||(Node0GiveAnswer1>=1))||(Node2GiveAnswer4>=1)))&&(Node1DHTinfo<1))&&((Node0Request<1)||(Node3IsInserted<1)))&&((Node4WaitAnswer<1)||(Node4NOshare<1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((Node0IsInserted>=1)&&(Node2requestsent0>=1))||(Node3DHTinfo>=1))||(Node2DHTinfo>=1))&&(((((Node3DHTinfo2>=1)||((Node3Request>=1)&&(Node4IsInserted>=1)))||(Node3GiveAnswer4>=1))||(Node0GiveAnswer1>=1))||(Node2GiveAnswer4>=1)))&&(Node1DHTinfo<1))&&((Node0Request<1)||(Node3IsInserted<1)))&&((Node4WaitAnswer<1)||(Node4NOshare<1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t6, t8, t11, t13, t18, t19, t22, t23, t28, t29, t40, t41, t47, t48, t53, t54, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/76/18/94
(forward)formula 0,1,0.837477,35836,1,0,163,104595,214,78,2355,97603,207
FORMULA CANConstruction-PT-005-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 112 transition count 116
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 88 transition count 110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 82 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 60 place count 82 transition count 108
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 80 transition count 108
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 76 place count 68 transition count 84
Iterating global reduction 3 with 12 rules applied. Total rules applied 88 place count 68 transition count 84
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 3 with 6 rules applied. Total rules applied 94 place count 65 transition count 81
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 102 place count 61 transition count 87
Applied a total of 102 rules in 14 ms. Remains 61 /112 variables (removed 51) and now considering 87/140 (removed 53) transitions.
[2021-05-17 09:13:55] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:55] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:55] [INFO ] Input system was already deterministic with 87 transitions.
[2021-05-17 09:13:55] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:55] [INFO ] Flatten gal took : 4 ms
[2021-05-17 09:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability317630890952283747.gal : 1 ms
[2021-05-17 09:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability9367738326589337222.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/CTLFireability317630890952283747.gal, -t, CGAL, -ctl, /tmp/CTLFireability9367738326589337222.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/CTLFireability317630890952283747.gal -t CGAL -ctl /tmp/CTLFireability9367738326589337222.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,10210,0.095955,8312,2,2174,5,14399,6,0,316,13254,0


Converting to forward existential form...Done !
original formula: !(A(!(AG((((EmptyCAN>=1)&&(Node1ReadyToInsert>=1))||(Node1GiveAnswer2>=1)))) U (((((((Node1GiveAnswer2>=1)||(Node3GiveAnswer4>=1))||(Node3IsNonInsertedNode>=1))||((Node2WaitAnswer>=1)&&(Node2NOshare>=1)))||((Node1Request>=1)&&(Node2IsInserted>=1)))||(Node4GiveAnswer3>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!((((((((Node1GiveAnswer2>=1)||(Node3GiveAnswer4>=1))||(Node3IsNonInsertedNode>=1))||((Node2WaitAnswer>=1)&&(Node2NOshare>=1)))||((Node1Request>=1)&&(Node2IsInserted>=1)))||(Node4GiveAnswer3>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1))))) * !((((((((Node1GiveAnswer2>=1)||(Node3GiveAnswer4>=1))||(Node3IsNonInsertedNode>=1))||((Node2WaitAnswer>=1)&&(Node2NOshare>=1)))||((Node1Request>=1)&&(Node2IsInserted>=1)))||(Node4GiveAnswer3>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1))))) * !(E(TRUE U !((((EmptyCAN>=1)&&(Node1ReadyToInsert>=1))||(Node1GiveAnswer2>=1))))))] != FALSE + [FwdG(Init,!((((((((Node1GiveAnswer2>=1)||(Node3GiveAnswer4>=1))||(Node3IsNonInsertedNode>=1))||((Node2WaitAnswer>=1)&&(Node2NOshare>=1)))||((Node1Request>=1)&&(Node2IsInserted>=1)))||(Node4GiveAnswer3>=1))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t7, t8, t10, t14, t15, t21, t22, t35, t36, t43, t44, t45, t49, t50, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/18/87
Hit Full ! (commute/partial/dont) 43/190/44
(forward)formula 0,1,0.797995,32284,1,0,160,115475,207,77,2184,111940,196
FORMULA CANConstruction-PT-005-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 112 transition count 134
Reduce places removed 6 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 16 place count 106 transition count 130
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 102 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 102 transition count 128
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 100 transition count 128
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 32 place count 92 transition count 112
Iterating global reduction 3 with 8 rules applied. Total rules applied 40 place count 92 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 89 transition count 113
Applied a total of 46 rules in 12 ms. Remains 89 /112 variables (removed 23) and now considering 113/140 (removed 27) transitions.
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 5 ms
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:56] [INFO ] Input system was already deterministic with 113 transitions.
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 14 ms
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 6 ms
[2021-05-17 09:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability1069973858986931878.gal : 1 ms
[2021-05-17 09:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability3617294187594318812.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/CTLFireability1069973858986931878.gal, -t, CGAL, -ctl, /tmp/CTLFireability3617294187594318812.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/CTLFireability1069973858986931878.gal -t CGAL -ctl /tmp/CTLFireability3617294187594318812.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,38766,0.080606,7420,2,2069,5,11400,6,0,454,11083,0


Converting to forward existential form...Done !
original formula: E(((((((((((AF(((Node4GiveAnswer3<1)||((((Node4Bootstrap<1)&&((Node3WaitAnswer<1)||(Node3OKshare<1)))&&((Node4IsInserted<1)||(Node3requestsent4<1)))&&((Node1Request<1)||(Node2IsInserted<1))))) * (Node0ID<1)) * (Node0ResZone<1)) * (Node1GiveAnswer4<1)) * (Node0GiveAnswer1<1)) * (Node2GiveAnswer3<1)) * (Node4DHTinfo2<1)) * (Node0GiveAnswer4<1)) * ((Node1IsInserted<1)||(Node2Request<1))) * ((Node2IsInserted<1)||(Node4requestsent2<1))) * ((InsertedCount<1)||(Node4ReadyToInsert<1))) U EF(((AG(((((((Node0IsInserted>=1)&&(Node4Request>=1))||(Node2ID2>=1))||((Node3IsInserted>=1)&&(Node0requestsent3>=1)))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))&&((((((Node1DHTinfo>=1)||(Node4IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node0requestsent2>=1)))||(Node0Bootstrap>=1))||(Node4GiveAnswer1>=1))||((Node0Request>=1)&&(Node2IsInserted>=1))))) * EF(((((((((((Node2ID>=1)||((EmptyCAN>=1)&&(Node1ReadyToInsert>=1)))||(Node1ID>=1))||(Node1GiveAnswer2>=1))||((Node0WaitAnswer>=1)&&(Node0NOshare>=1)))||((Node0IsInserted>=1)&&(Node2Request>=1)))||((Node3IsInserted>=1)&&(Node2requestsent3>=1)))||((Node4IsInserted>=1)&&(Node0requestsent4>=1)))||((Node3IsInserted>=1)&&(Node1requestsent3>=1)))||(Node3ID>=1)))) * ((((((((Node3DHTinfo2>=1)||(Node2GiveAnswer3>=1))||((Node3IsInserted>=1)&&(Node4requestsent3>=1)))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((InsertedCount>=1)&&(Node4ReadyToInsert>=1)))||((Node1IsInserted>=1)&&(Node2requestsent1>=1)))||((Node0Request>=1)&&(Node1IsInserted>=1)))||((Node1Request>=1)&&(Node3IsInserted>=1))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(FwdU(Init,((((((((((!(EG(!(((Node4GiveAnswer3<1)||((((Node4Bootstrap<1)&&((Node3WaitAnswer<1)||(Node3OKshare<1)))&&((Node4IsInserted<1)||(Node3requestsent4<1)))&&((Node1Request<1)||(Node2IsInserted<1))))))) * (Node0ID<1)) * (Node0ResZone<1)) * (Node1GiveAnswer4<1)) * (Node0GiveAnswer1<1)) * (Node2GiveAnswer3<1)) * (Node4DHTinfo2<1)) * (Node0GiveAnswer4<1)) * ((Node1IsInserted<1)||(Node2Request<1))) * ((Node2IsInserted<1)||(Node4requestsent2<1))) * ((InsertedCount<1)||(Node4ReadyToInsert<1)))),TRUE) * ((((((((Node3DHTinfo2>=1)||(Node2GiveAnswer3>=1))||((Node3IsInserted>=1)&&(Node4requestsent3>=1)))||((Node4IsInserted>=1)&&(Node2requestsent4>=1)))||((InsertedCount>=1)&&(Node4ReadyToInsert>=1)))||((Node1IsInserted>=1)&&(Node2requestsent1>=1)))||((Node0Request>=1)&&(Node1IsInserted>=1)))||((Node1Request>=1)&&(Node3IsInserted>=1)))) * !(E(TRUE U !(((((((Node0IsInserted>=1)&&(Node4Request>=1))||(Node2ID2>=1))||((Node3IsInserted>=1)&&(Node0requestsent3>=1)))||((Node1IsInserted>=1)&&(Node4requestsent1>=1)))&&((((((Node1DHTinfo>=1)||(Node4IsNonInsertedNode>=1))||((Node2IsInserted>=1)&&(Node0requestsent2>=1)))||(Node0Bootstrap>=1))||(Node4GiveAnswer1>=1))||((Node0Request>=1)&&(Node2IsInserted>=1)))))))),TRUE) * ((((((((((Node2ID>=1)||((EmptyCAN>=1)&&(Node1ReadyToInsert>=1)))||(Node1ID>=1))||(Node1GiveAnswer2>=1))||((Node0WaitAnswer>=1)&&(Node0NOshare>=1)))||((Node0IsInserted>=1)&&(Node2Request>=1)))||((Node3IsInserted>=1)&&(Node2requestsent3>=1)))||((Node4IsInserted>=1)&&(Node0requestsent4>=1)))||((Node3IsInserted>=1)&&(Node1requestsent3>=1)))||(Node3ID>=1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t7, t12, t13, t19, t22, t28, t30, t34, t39, t44, t45, t49, t50, t53, t54, t61, t62, t67, t68, t74, t75, t86, t87, t91, t92, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/87/26/113
(forward)formula 0,0,0.640815,29044,1,0,186,97120,249,96,2728,92960,237
FORMULA CANConstruction-PT-005-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 09:13:56] [INFO ] Flatten gal took : 13 ms
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 8 ms
[2021-05-17 09:13:56] [INFO ] Applying decomposition
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 7 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/graph8761289295133891405.txt, -o, /tmp/graph8761289295133891405.bin, -w, /tmp/graph8761289295133891405.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/graph8761289295133891405.bin, -l, -1, -v, -w, /tmp/graph8761289295133891405.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 09:13:56] [INFO ] Decomposing Gal with order
[2021-05-17 09:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 09:13:56] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-17 09:13:56] [INFO ] Flatten gal took : 38 ms
[2021-05-17 09:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2021-05-17 09:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8274771973560116281.gal : 3 ms
[2021-05-17 09:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11939348017988670548.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/CTLFireability8274771973560116281.gal, -t, CGAL, -ctl, /tmp/CTLFireability11939348017988670548.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/CTLFireability8274771973560116281.gal -t CGAL -ctl /tmp/CTLFireability11939348017988670548.ctl
No direction supplied, using forward translation only.
Parsed 11 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,97527,0.159423,11476,927,99,14479,869,392,19312,72,3318,0


Converting to forward existential form...Done !
original formula: (A((AF((((((i4.u10.Node2ResZone<1)&&((i2.u27.Node4IsInserted<1)||(i10.u28.Node1requestsent4<1)))&&(i9.u24.Node3GiveAnswer4<1))&&(i1.u3.Node0JoinMsg<1))&&(i5.u14.Node4GiveAnswer2<1))) + ((AG(E(((((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0NOshare>=1))||((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3Request>=1)))||(i1.u2.Node0IsNonInsertedNode>=1)) U (((((((i6.u17.Node3ID2>=1)||(i4.u12.Node2DHTinfo2>=1))||((i0.u0.EmptyCAN>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i7.u26.Node4GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1))))) * ((((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2NOshare>=1)))||(i7.u26.Node4GiveAnswer3>=1))) * AG((((((((((i2.u5.Node3GiveAnswer0>=1)||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||(i3.u8.Node1ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i7.u26.Node4GiveAnswer3>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1)))))) U EG(EX((((((((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i7.u26.Node4GiveAnswer3>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||(i0.u16.Node3ResZone>=1))||(i4.u10.Node2DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u3.Node0JoinMsg>=1))||(i8.u21.Node4DHTinfo2>=1))))) + EX(EG(AF((i0.u16.Node3DHTinfo>=1)))))
=> equivalent forward existential formula: ([((Init * !(EG(!(EG(EX((((((((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i7.u26.Node4GiveAnswer3>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||(i0.u16.Node3ResZone>=1))||(i4.u10.Node2DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u3.Node0JoinMsg>=1))||(i8.u21.Node4DHTinfo2>=1)))))))) * !(E(!(EG(EX((((((((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i7.u26.Node4GiveAnswer3>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||(i0.u16.Node3ResZone>=1))||(i4.u10.Node2DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u3.Node0JoinMsg>=1))||(i8.u21.Node4DHTinfo2>=1))))) U (!((!(EG(!((((((i4.u10.Node2ResZone<1)&&((i2.u27.Node4IsInserted<1)||(i10.u28.Node1requestsent4<1)))&&(i9.u24.Node3GiveAnswer4<1))&&(i1.u3.Node0JoinMsg<1))&&(i5.u14.Node4GiveAnswer2<1))))) + ((!(E(TRUE U !(E(((((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0NOshare>=1))||((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3Request>=1)))||(i1.u2.Node0IsNonInsertedNode>=1)) U (((((((i6.u17.Node3ID2>=1)||(i4.u12.Node2DHTinfo2>=1))||((i0.u0.EmptyCAN>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i7.u26.Node4GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1))))))) * ((((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2NOshare>=1)))||(i7.u26.Node4GiveAnswer3>=1))) * !(E(TRUE U !((((((((((i2.u5.Node3GiveAnswer0>=1)||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||(i3.u8.Node1ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i7.u26.Node4GiveAnswer3>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1))))))))) * !(EG(EX((((((((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i7.u26.Node4GiveAnswer3>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||(i0.u16.Node3ResZone>=1))||(i4.u10.Node2DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u3.Node0JoinMsg>=1))||(i8.u21.Node4DHTinfo2>=1)))))))))] != FALSE + [FwdG(EY(Init),!(EG(!((i0.u16.Node3DHTinfo>=1)))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t16, t21, t28, t33, t40, t45, t52, t57, i2.u5.t78, i2.u5.t79, i2.u5.t94, i2.u5.t95, i2.u5.t110, i2.u5.t111, i2.u5.t126, i2.u5.t127, i5.u14.t66, i5.u14.t67, i5.u14.t82, i5.u14.t83, i5.u14.t118, i5.u14.t119, i5.u14.t134, i5.u14.t135, i7.u26.t70, i7.u26.t71, i7.u26.t86, i7.u26.t87, i7.u26.t102, i7.u26.t103, i7.u26.t138, i7.u26.t139, i9.u24.t74, i9.u24.t75, i9.u24.t90, i9.u24.t91, i9.u24.t106, i9.u24.t107, i9.u24.t122, i9.u24.t123, i10.t99, i10.t62, i10.u9.t98, i10.u9.t130, i10.u25.t63, i10.u25.t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/48/138
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 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
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,2.54061,114756,1,0,255377,1561,2257,309195,392,5460,509949
FORMULA CANConstruction-PT-005-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG(((((i0.u0.EmptyCAN<1)||(i8.u21.Node4ReadyToInsert<1)) + (!(AX(E(((((((i6.u19.Node3DHTinfo2>=1)||(i7.u26.Node1GiveAnswer3>=1))||(i3.u8.Node1JoinMsg>=1))||(i7.u26.Node0GiveAnswer3>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i10.u15.Node3IsInserted>=1))) U ((((((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2NOshare>=1)))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))))) * (!(EG(((((((((i4.u10.Node2ID>=1)||(i2.u5.Node3GiveAnswer0>=1))||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||(i4.u13.Node2ID2>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1))))) + !(E((((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node1GiveAnswer0>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3ResZone>=1)) U ((((((i2.u5.Node3GiveAnswer0>=1)||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i3.u6.Node1DHTinfo>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2OKshare>=1)))))))) * (AF((((((((((((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1))||((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1)))||(i3.u6.Node1DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i8.u20.Node4ResZone>=1))||(i8.u21.Node4DHTinfo2>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1)))) + AX((!(EX(((((((((i2.u5.Node3GiveAnswer0>=1)||(i0.u0.Node0DHTinfo>=1))||(i7.u26.Node1GiveAnswer3>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||(i1.u3.Node0Bootstrap>=1))||(i1.u3.Node0JoinMsg>=1))||(i1.u2.Node0IsNonInsertedNode>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1))))) + ((((((((((i5.u14.Node3GiveAnswer2<1)&&((i1.u3.Node0WaitAnswer<1)||(i2.u5.Node0NOshare<1)))&&((i7.u30.Node0IsInserted<1)||(i9.u23.Node4requestsent0<1)))&&(i9.u24.Node3GiveAnswer4<1))&&(i10.u25.Node0GiveAnswer1<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i5.u29.Node2Request<1)||(i10.u15.Node3IsInserted<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1))) * AX((((((i6.u19.Node3DHTinfo2>=1)||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1)))||(i7.u26.Node0GiveAnswer3>=1)))))))))
=> equivalent forward existential formula: [FwdG(Init,((((i0.u0.EmptyCAN<1)||(i8.u21.Node4ReadyToInsert<1)) + (!(!(EX(!(E(((((((i6.u19.Node3DHTinfo2>=1)||(i7.u26.Node1GiveAnswer3>=1))||(i3.u8.Node1JoinMsg>=1))||(i7.u26.Node0GiveAnswer3>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i10.u15.Node3IsInserted>=1))) U ((((((i0.u0.EmptyCAN>=1)&&(i3.u6.Node1ReadyToInsert>=1))||(i8.u21.Node4IsNonInsertedNode>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2NOshare>=1)))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))))))) * (!(EG(((((((((i4.u10.Node2ID>=1)||(i2.u5.Node3GiveAnswer0>=1))||(i3.u6.Node1ResZone>=1))||(i4.u13.Node2Bootstrap>=1))||(i4.u13.Node2ID2>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1))))) + !(E((((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node1GiveAnswer0>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3ResZone>=1)) U ((((((i2.u5.Node3GiveAnswer0>=1)||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i3.u6.Node1DHTinfo>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2OKshare>=1)))))))) * (!(EG(!((((((((((((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1))||((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1)))||(i3.u6.Node1DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i8.u20.Node4ResZone>=1))||(i8.u21.Node4DHTinfo2>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1)))))) + !(EX(!((!(EX(((((((((i2.u5.Node3GiveAnswer0>=1)||(i0.u0.Node0DHTinfo>=1))||(i7.u26.Node1GiveAnswer3>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||(i1.u3.Node0Bootstrap>=1))||(i1.u3.Node0JoinMsg>=1))||(i1.u2.Node0IsNonInsertedNode>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1))))) + ((((((((((i5.u14.Node3GiveAnswer2<1)&&((i1.u3.Node0WaitAnswer<1)||(i2.u5.Node0NOshare<1)))&&((i7.u30.Node0IsInserted<1)||(i9.u23.Node4requestsent0<1)))&&(i9.u24.Node3GiveAnswer4<1))&&(i10.u25.Node0GiveAnswer1<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i5.u29.Node2Request<1)||(i10.u15.Node3IsInserted<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1))) * !(EX(!((((((i6.u19.Node3DHTinfo2>=1)||(i4.u13.Node2Bootstrap>=1))||(i3.u7.Node1DHTinfo2>=1))||((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1)))||(i7.u26.Node0GiveAnswer3>=1)))))))))))))] != FALSE
(forward)formula 1,1,4.84195,201088,1,0,460301,1609,2572,533233,401,5833,884620
FORMULA CANConstruction-PT-005-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((((((((((((((i3.u6.Node1DHTinfo>=1)||(i6.u17.Node3Bootstrap>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||(i7.u26.Node4GiveAnswer3>=1)) + E(E(((((((((i2.u5.Node1GiveAnswer0>=1)||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i6.u17.Node3Bootstrap>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i4.u13.Node2JoinMsg>=1))||((i2.u4.Node0Request>=1)&&(i2.u27.Node4IsInserted>=1)))||(i3.u8.Node1JoinMsg>=1))||((i10.u28.Node1Request>=1)&&(i10.u15.Node3IsInserted>=1))) U (((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))) U AX((((((((((((i3.u7.Node1WaitAnswer>=1)&&(i10.u9.Node1OKshare>=1))||(i8.u22.Node4JoinMsg>=1))||(i1.u2.Node0ID2>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||(i3.u8.Node1JoinMsg>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))||(i9.u24.Node0GiveAnswer4>=1))))) + AF(E(((((((((((i10.u25.Node3GiveAnswer1>=1)||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||(i2.u5.Node4GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i10.u15.Node3IsInserted>=1)&&(i10.u15.Node1requestsent3>=1)))||(i1.u2.Node0IsNonInsertedNode>=1))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1))) U ((((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1))||((i0.u0.EmptyCAN>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1)))))) + ((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4requestsent0>=1))) + ((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1))) + ((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1))) + ((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1))) + (!(AF(((((i10.u28.Node1Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i3.u6.Node1ResZone>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1))))) * !(AG((((((((((i8.u22.Node4Bootstrap>=1)||(i3.u6.Node1ID>=1))||(i3.u8.Node1ID2>=1))||(i10.u25.Node0GiveAnswer1>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node0GiveAnswer4>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||(i9.u24.Node2GiveAnswer4>=1)))))) + (EF(((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2requestsent1>=1))) * EG((i10.u25.Node3GiveAnswer1>=1)))) U EF(EG(A((((i4.u10.Node2ResZone<1)&&(i3.u7.Node1IsNonInsertedNode<1))&&((i4.u12.InsertedCount<1)||(i0.u16.Node3ReadyToInsert<1))) U ((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG(!((E(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))) U (!((((i4.u10.Node2ResZone<1)&&(i3.u7.Node1IsNonInsertedNode<1))&&((i4.u12.InsertedCount<1)||(i0.u16.Node3ReadyToInsert<1)))) * !(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))) + EG(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1))))))))))))) * !(E(!(E(TRUE U EG(!((E(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))) U (!((((i4.u10.Node2ResZone<1)&&(i3.u7.Node1IsNonInsertedNode<1))&&((i4.u12.InsertedCount<1)||(i0.u16.Node3ReadyToInsert<1)))) * !(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))) + EG(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))))))) U (!((((((((((((((i3.u6.Node1DHTinfo>=1)||(i6.u17.Node3Bootstrap>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||(i7.u26.Node4GiveAnswer3>=1)) + E(E(((((((((i2.u5.Node1GiveAnswer0>=1)||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||(i6.u17.Node3Bootstrap>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i4.u13.Node2JoinMsg>=1))||((i2.u4.Node0Request>=1)&&(i2.u27.Node4IsInserted>=1)))||(i3.u8.Node1JoinMsg>=1))||((i10.u28.Node1Request>=1)&&(i10.u15.Node3IsInserted>=1))) U (((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))) U !(EX(!((((((((((((i3.u7.Node1WaitAnswer>=1)&&(i10.u9.Node1OKshare>=1))||(i8.u22.Node4JoinMsg>=1))||(i1.u2.Node0ID2>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||(i3.u8.Node1JoinMsg>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))||(i9.u24.Node0GiveAnswer4>=1))))))) + !(EG(!(E(((((((((((i10.u25.Node3GiveAnswer1>=1)||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i1.u3.Node0JoinMsg>=1))||(i2.u5.Node4GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i10.u15.Node3IsInserted>=1)&&(i10.u15.Node1requestsent3>=1)))||(i1.u2.Node0IsNonInsertedNode>=1))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1))) U ((((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1))||((i0.u0.EmptyCAN>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1)))))))) + ((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4requestsent0>=1))) + ((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1))) + ((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1))) + ((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1))) + (!(!(EG(!(((((i10.u28.Node1Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i3.u6.Node1ResZone>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1))))))) * !(!(E(TRUE U !((((((((((i8.u22.Node4Bootstrap>=1)||(i3.u6.Node1ID>=1))||(i3.u8.Node1ID2>=1))||(i10.u25.Node0GiveAnswer1>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node0GiveAnswer4>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||(i9.u24.Node2GiveAnswer4>=1)))))))) + (E(TRUE U ((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2requestsent1>=1))) * EG((i10.u25.Node3GiveAnswer1>=1))))) * !(E(TRUE U EG(!((E(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))) U (!((((i4.u10.Node2ResZone<1)&&(i3.u7.Node1IsNonInsertedNode<1))&&((i4.u12.InsertedCount<1)||(i0.u16.Node3ReadyToInsert<1)))) * !(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))) + EG(!(((((((((((((((((i2.u5.Node3GiveAnswer0>=1)||(i9.u24.Node1GiveAnswer4>=1))||(i2.u5.Node2GiveAnswer0>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||(i8.u20.Node4ID>=1))||(i0.u0.Node0DHTinfo>=1))||(i0.u1.Node0ID>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i4.u10.Node2DHTinfo>=1))||((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||((i0.u0.EmptyCAN>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1))))))))))))))] != FALSE
(forward)formula 2,1,10.4732,421592,1,0,961380,1662,2892,1.11688e+06,405,6182,1645524
FORMULA CANConstruction-PT-005-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EG((((((((((((((((i6.u17.Node3JoinMsg<1)&&((i2.u31.Node1IsInserted<1)||(i9.u23.Node4Request<1)))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&(i2.u5.Node4GiveAnswer0<1))&&(i7.u26.Node0GiveAnswer3<1))&&((i8.u22.Node4WaitAnswer<1)||(i9.u24.Node4OKshare<1)))&&((i2.u4.Node0Request<1)||(i9.u11.Node2IsInserted<1)))&&((i7.u30.Node0IsInserted<1)||(i10.u28.Node1requestsent0<1)))&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2requestsent1<1)))&&(i8.u22.Node4JoinMsg<1))&&(i10.u25.Node0GiveAnswer1<1))&&(i7.u26.Node4GiveAnswer3<1))&&(i9.u24.Node0GiveAnswer4<1))||(((i10.u15.Node3IsInserted<1)||(i10.u15.Node2requestsent3<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))) * !(EX((((((((((i2.u5.Node1GiveAnswer0>=1)||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i10.u25.Node3GiveAnswer1>=1))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4Request>=1)))||((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0OKshare>=1)))||(i3.u8.Node1JoinMsg>=1))||(i1.u3.Node0JoinMsg>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i1.u2.Node0IsNonInsertedNode>=1)))))) + AG(EX((i4.u10.Node2ID>=1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG((((((((((((((((i6.u17.Node3JoinMsg<1)&&((i2.u31.Node1IsInserted<1)||(i9.u23.Node4Request<1)))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&(i2.u5.Node4GiveAnswer0<1))&&(i7.u26.Node0GiveAnswer3<1))&&((i8.u22.Node4WaitAnswer<1)||(i9.u24.Node4OKshare<1)))&&((i2.u4.Node0Request<1)||(i9.u11.Node2IsInserted<1)))&&((i7.u30.Node0IsInserted<1)||(i10.u28.Node1requestsent0<1)))&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2requestsent1<1)))&&(i8.u22.Node4JoinMsg<1))&&(i10.u25.Node0GiveAnswer1<1))&&(i7.u26.Node4GiveAnswer3<1))&&(i9.u24.Node0GiveAnswer4<1))||(((i10.u15.Node3IsInserted<1)||(i10.u15.Node2requestsent3<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))) * !(EX((((((((((i2.u5.Node1GiveAnswer0>=1)||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i10.u25.Node3GiveAnswer1>=1))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4Request>=1)))||((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0OKshare>=1)))||(i3.u8.Node1JoinMsg>=1))||(i1.u3.Node0JoinMsg>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i1.u2.Node0IsNonInsertedNode>=1)))))) + !(E(TRUE U !(EX((i4.u10.Node2ID>=1)))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 3,1,11.1297,446308,1,0,1.0211e+06,1668,2992,1.17223e+06,411,6231,1759820
FORMULA CANConstruction-PT-005-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((AX((((((((((((((((A((((((((((((i2.u5.Node3GiveAnswer0>=1)||((i3.u7.Node1WaitAnswer>=1)&&(i10.u9.Node1OKshare>=1)))||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1Request>=1)))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i1.u3.Node0Bootstrap>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))&&((((((i6.u17.Node3JoinMsg>=1)||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i10.u9.Node2GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i0.u16.Node3ID>=1))) U ((((((((i0.u0.Node0DHTinfo<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&((i0.u0.EmptyCAN<1)||(i0.u16.Node3ReadyToInsert<1)))&&(i1.u3.Node0JoinMsg<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u31.Node1IsInserted<1)||(i2.u31.Node0requestsent1<1)))&&(i9.u24.Node0GiveAnswer4<1))) + (i8.u22.Node4Bootstrap>=1)) + ((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3requestsent1>=1))) + (i9.u24.Node3GiveAnswer4>=1)) + ((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0OKshare>=1))) + ((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1))) + ((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3Request>=1))) + (i3.u8.Node1Bootstrap>=1)) + ((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1))) + (i3.u8.Node1JoinMsg>=1)) + (i10.u9.Node2GiveAnswer1>=1)) + ((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1))) + ((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1))) + ((((((((((i8.u22.Node4Bootstrap>=1)||(i3.u6.Node1DHTinfo>=1))||(i10.u25.Node3GiveAnswer1>=1))||(i6.u17.Node3ID2>=1))||(i8.u22.Node4JoinMsg>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i10.u25.Node0GiveAnswer1>=1))||((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1)))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))&&((((((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1Request>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node0GiveAnswer3>=1))||((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1)))||(i0.u16.Node3ID>=1)))) + EF((i9.u24.Node0GiveAnswer4>=1))) + ((((((i4.u12.Node2DHTinfo2>=1)||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i8.u20.Node4ID>=1))||(i9.u24.Node2GiveAnswer4>=1))&&(((((((((i3.u6.Node1ID>=1)||((i2.u27.Node4IsInserted>=1)&&(i7.u18.Node3requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i3.u8.Node1ID2>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||(i7.u26.Node4GiveAnswer3>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||(i9.u24.Node2GiveAnswer4>=1))))) + ((((i1.u2.Node0DHTinfo2<1)&&(i6.u19.Node3IsNonInsertedNode<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u27.Node4IsInserted<1)||(i2.u27.Node0requestsent4<1)))))
=> equivalent forward existential formula: [FwdG(Init,(!(EX(!((((((((((((((((!((E(!(((((((((i0.u0.Node0DHTinfo<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&((i0.u0.EmptyCAN<1)||(i0.u16.Node3ReadyToInsert<1)))&&(i1.u3.Node0JoinMsg<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u31.Node1IsInserted<1)||(i2.u31.Node0requestsent1<1)))&&(i9.u24.Node0GiveAnswer4<1))) U (!((((((((((((i2.u5.Node3GiveAnswer0>=1)||((i3.u7.Node1WaitAnswer>=1)&&(i10.u9.Node1OKshare>=1)))||(i8.u22.Node4JoinMsg>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1Request>=1)))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i1.u3.Node0Bootstrap>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))&&((((((i6.u17.Node3JoinMsg>=1)||((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1)))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i10.u9.Node2GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i0.u16.Node3ID>=1)))) * !(((((((((i0.u0.Node0DHTinfo<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&((i0.u0.EmptyCAN<1)||(i0.u16.Node3ReadyToInsert<1)))&&(i1.u3.Node0JoinMsg<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u31.Node1IsInserted<1)||(i2.u31.Node0requestsent1<1)))&&(i9.u24.Node0GiveAnswer4<1))))) + EG(!(((((((((i0.u0.Node0DHTinfo<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i4.u12.Node2WaitAnswer<1)||(i5.u14.Node2OKshare<1)))&&((i0.u0.EmptyCAN<1)||(i0.u16.Node3ReadyToInsert<1)))&&(i1.u3.Node0JoinMsg<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u31.Node1IsInserted<1)||(i2.u31.Node0requestsent1<1)))&&(i9.u24.Node0GiveAnswer4<1)))))) + (i8.u22.Node4Bootstrap>=1)) + ((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3requestsent1>=1))) + (i9.u24.Node3GiveAnswer4>=1)) + ((i1.u3.Node0WaitAnswer>=1)&&(i2.u5.Node0OKshare>=1))) + ((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1))) + ((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3Request>=1))) + (i3.u8.Node1Bootstrap>=1)) + ((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1))) + (i3.u8.Node1JoinMsg>=1)) + (i10.u9.Node2GiveAnswer1>=1)) + ((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1))) + ((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1))) + ((((((((((i8.u22.Node4Bootstrap>=1)||(i3.u6.Node1DHTinfo>=1))||(i10.u25.Node3GiveAnswer1>=1))||(i6.u17.Node3ID2>=1))||(i8.u22.Node4JoinMsg>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i10.u25.Node0GiveAnswer1>=1))||((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1)))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))&&((((((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1Request>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node0GiveAnswer3>=1))||((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1)))||(i0.u16.Node3ID>=1)))) + E(TRUE U (i9.u24.Node0GiveAnswer4>=1))) + ((((((i4.u12.Node2DHTinfo2>=1)||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i8.u20.Node4ID>=1))||(i9.u24.Node2GiveAnswer4>=1))&&(((((((((i3.u6.Node1ID>=1)||((i2.u27.Node4IsInserted>=1)&&(i7.u18.Node3requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4requestsent3>=1)))||(i3.u8.Node1ID2>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||(i7.u26.Node4GiveAnswer3>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||(i9.u24.Node2GiveAnswer4>=1))))))) + ((((i1.u2.Node0DHTinfo2<1)&&(i6.u19.Node3IsNonInsertedNode<1))&&(i2.u5.Node4GiveAnswer0<1))&&((i2.u27.Node4IsInserted<1)||(i2.u27.Node0requestsent4<1)))))] != FALSE
(forward)formula 4,1,11.9658,479308,1,0,1.09773e+06,1673,3164,1.25071e+06,415,6256,1921543
FORMULA CANConstruction-PT-005-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A((AF((((((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i4.u12.Node2DHTinfo2>=1))||((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1)))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4requestsent0>=1)))||(i10.u9.Node4GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u1.Node0ID>=1))||(i7.u26.Node1GiveAnswer3>=1))||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))) * EX(AG(((((((i2.u5.Node1GiveAnswer0<1)&&(i4.u13.Node2ID2<1))&&((i10.u15.Node3IsInserted<1)||(i9.u23.Node4requestsent3<1)))&&((i2.u31.Node1IsInserted<1)||(i7.u18.Node3requestsent1<1)))&&(i4.u13.Node2JoinMsg<1)) + AF((((i10.u25.Node3GiveAnswer1>=1)||(i9.u24.Node3GiveAnswer4>=1))||(i10.u9.Node2GiveAnswer1>=1))))))) U EX((!(E(AX(((((((i5.u14.Node3GiveAnswer2>=1)||(i3.u8.Node1ID2>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i8.u20.Node4ResZone>=1))) U (((((((((i10.u25.Node3GiveAnswer1<1)&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2Request<1)))&&((i4.u12.InsertedCount<1)||(i3.u6.Node1ReadyToInsert<1)))&&(i2.u5.Node4GiveAnswer0<1))&&((i4.u12.InsertedCount<1)||(i4.u10.Node2ReadyToInsert<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))&&(i9.u24.Node2GiveAnswer4<1))&&(i4.u10.Node2DHTinfo<1)))) * ((((i3.u8.Node1Bootstrap>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX((!(E(!(EX(!(((((((i5.u14.Node3GiveAnswer2>=1)||(i3.u8.Node1ID2>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i8.u20.Node4ResZone>=1))))) U (((((((((i10.u25.Node3GiveAnswer1<1)&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2Request<1)))&&((i4.u12.InsertedCount<1)||(i3.u6.Node1ReadyToInsert<1)))&&(i2.u5.Node4GiveAnswer0<1))&&((i4.u12.InsertedCount<1)||(i4.u10.Node2ReadyToInsert<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))&&(i9.u24.Node2GiveAnswer4<1))&&(i4.u10.Node2DHTinfo<1)))) * ((((i3.u8.Node1Bootstrap>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))))))))) * !(E(!(EX((!(E(!(EX(!(((((((i5.u14.Node3GiveAnswer2>=1)||(i3.u8.Node1ID2>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i8.u20.Node4ResZone>=1))))) U (((((((((i10.u25.Node3GiveAnswer1<1)&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2Request<1)))&&((i4.u12.InsertedCount<1)||(i3.u6.Node1ReadyToInsert<1)))&&(i2.u5.Node4GiveAnswer0<1))&&((i4.u12.InsertedCount<1)||(i4.u10.Node2ReadyToInsert<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))&&(i9.u24.Node2GiveAnswer4<1))&&(i4.u10.Node2DHTinfo<1)))) * ((((i3.u8.Node1Bootstrap>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))))) U (!((!(EG(!((((((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i4.u12.Node2DHTinfo2>=1))||((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1)))||((i7.u30.Node0IsInserted>=1)&&(i9.u23.Node4requestsent0>=1)))||(i10.u9.Node4GiveAnswer1>=1))||(i5.u14.Node0GiveAnswer2>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||((i3.u7.Node1WaitAnswer>=1)&&(i10.u25.Node1NOshare>=1)))||(i0.u1.Node0ID>=1))||(i7.u26.Node1GiveAnswer3>=1))||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))))) * EX(!(E(TRUE U !(((((((i2.u5.Node1GiveAnswer0<1)&&(i4.u13.Node2ID2<1))&&((i10.u15.Node3IsInserted<1)||(i9.u23.Node4requestsent3<1)))&&((i2.u31.Node1IsInserted<1)||(i7.u18.Node3requestsent1<1)))&&(i4.u13.Node2JoinMsg<1)) + !(EG(!((((i10.u25.Node3GiveAnswer1>=1)||(i9.u24.Node3GiveAnswer4>=1))||(i10.u9.Node2GiveAnswer1>=1)))))))))))) * !(EX((!(E(!(EX(!(((((((i5.u14.Node3GiveAnswer2>=1)||(i3.u8.Node1ID2>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i8.u20.Node4ResZone>=1))))) U (((((((((i10.u25.Node3GiveAnswer1<1)&&((i2.u31.Node1IsInserted<1)||(i5.u29.Node2Request<1)))&&((i4.u12.InsertedCount<1)||(i3.u6.Node1ReadyToInsert<1)))&&(i2.u5.Node4GiveAnswer0<1))&&((i4.u12.InsertedCount<1)||(i4.u10.Node2ReadyToInsert<1)))&&(i3.u7.Node1IsNonInsertedNode<1))&&((i10.u15.Node3IsInserted<1)||(i10.u15.Node1requestsent3<1)))&&(i9.u24.Node2GiveAnswer4<1))&&(i4.u10.Node2DHTinfo<1)))) * ((((i3.u8.Node1Bootstrap>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i0.u16.Node3DHTinfo>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))))))))))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 5,0,15.7598,619228,1,0,1.40959e+06,1686,3299,1.59516e+06,417,6329,2374560
FORMULA CANConstruction-PT-005-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(AF(!(E(EF(((((((((i10.u28.Node1Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i4.u13.Node2JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i1.u3.Node0JoinMsg>=1))||(i7.u26.Node2GiveAnswer3>=1))||((i10.u15.Node3IsInserted>=1)&&(i10.u15.Node1requestsent3>=1)))) U (((((((((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2requestsent0>=1)))||(i9.u24.Node1GiveAnswer4>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2OKshare>=1)))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i8.u20.Node4ID>=1))||(i0.u16.Node3ResZone>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(!(E(E(TRUE U ((((((((i10.u28.Node1Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i5.u14.Node3GiveAnswer2>=1))||(i4.u13.Node2JoinMsg>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i1.u3.Node0JoinMsg>=1))||(i7.u26.Node2GiveAnswer3>=1))||((i10.u15.Node3IsInserted>=1)&&(i10.u15.Node1requestsent3>=1)))) U (((((((((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1))||((i7.u30.Node0IsInserted>=1)&&(i5.u29.Node2requestsent0>=1)))||(i9.u24.Node1GiveAnswer4>=1))||((i4.u12.Node2WaitAnswer>=1)&&(i5.u14.Node2OKshare>=1)))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i8.u20.Node4ID>=1))||(i0.u16.Node3ResZone>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))))))] = FALSE
(forward)formula 6,0,16.4886,643780,1,0,1.4634e+06,1691,3330,1.65628e+06,417,6353,2460624
FORMULA CANConstruction-PT-005-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((((i10.u15.Node3IsInserted<1)||(i9.u23.Node4Request<1))||(i4.u10.Node2ID>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1))) U EG(((((i4.u12.Node2IsNonInsertedNode<1) * !(EG((((((((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i0.u1.Node0ResZone>=1))||((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3requestsent1>=1)))||(i9.u24.Node1GiveAnswer4>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1)))))) * EX(((((i8.u22.Node4Bootstrap>=1)||(i4.u13.Node2Bootstrap>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1)))&&((((((((i5.u14.Node1GiveAnswer2>=1)||((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1)))||(i10.u25.Node0GiveAnswer1>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||((i5.u29.Node2Request>=1)&&(i10.u15.Node3IsInserted>=1)))||(i8.u21.Node4DHTinfo2>=1))))) * AX(((((((((i10.u15.Node3IsInserted<1)||(i2.u4.Node0requestsent3<1))&&(i8.u20.Node4DHTinfo<1))&&(i0.u16.Node3ID<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1)))&&(i7.u30.Node0IsInserted>=1))&&(i5.u29.Node2Request>=1))&&((((i4.u10.Node2ResZone>=1)||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i0.u16.Node3ResZone>=1))||(i5.u14.Node4GiveAnswer2>=1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,((((i10.u15.Node3IsInserted<1)||(i9.u23.Node4Request<1))||(i4.u10.Node2ID>=1))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))),((((i4.u12.Node2IsNonInsertedNode<1) * !(EG((((((((i7.u18.Node3Request>=1)&&(i2.u27.Node4IsInserted>=1))||(i0.u1.Node0ResZone>=1))||((i2.u31.Node1IsInserted>=1)&&(i7.u18.Node3requestsent1>=1)))||(i9.u24.Node1GiveAnswer4>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))||((i2.u4.Node0Request>=1)&&(i2.u31.Node1IsInserted>=1)))))) * EX(((((i8.u22.Node4Bootstrap>=1)||(i4.u13.Node2Bootstrap>=1))||((i0.u0.EmptyCAN>=1)&&(i8.u21.Node4ReadyToInsert>=1)))&&((((((((i5.u14.Node1GiveAnswer2>=1)||((i9.u11.Node2IsInserted>=1)&&(i7.u18.Node3requestsent2>=1)))||(i10.u25.Node0GiveAnswer1>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||((i4.u12.InsertedCount>=1)&&(i8.u21.Node4ReadyToInsert>=1)))||((i5.u29.Node2Request>=1)&&(i10.u15.Node3IsInserted>=1)))||(i8.u21.Node4DHTinfo2>=1))))) * !(EX(!(((((((((i10.u15.Node3IsInserted<1)||(i2.u4.Node0requestsent3<1))&&(i8.u20.Node4DHTinfo<1))&&(i0.u16.Node3ID<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1)))&&(i7.u30.Node0IsInserted>=1))&&(i5.u29.Node2Request>=1))&&((((i4.u10.Node2ResZone>=1)||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i0.u16.Node3ResZone>=1))||(i5.u14.Node4GiveAnswer2>=1))))))))] != FALSE
(forward)formula 7,0,17.2798,655328,1,0,1.48655e+06,1864,3564,1.68179e+06,444,7488,2521249
FORMULA CANConstruction-PT-005-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(A(((((((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i3.u7.Node1IsNonInsertedNode>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))||(i9.u24.Node2GiveAnswer4>=1)) U AX((((((((((((i3.u6.Node1ID>=1)||(i8.u22.Node4JoinMsg>=1))||(i3.u6.Node1ResZone>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u2.Node0ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||(i8.u20.Node4ID>=1))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1))&&(((((((i9.u11.Node2IsInserted>=1)&&(i10.u28.Node1requestsent2>=1))||((i2.u27.Node4IsInserted>=1)&&(i10.u28.Node1requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i0.u16.Node3ID>=1))||(i5.u14.Node4GiveAnswer2>=1))||(i1.u2.Node0IsNonInsertedNode>=1)))))) * (EG(((((((((((!(AX(((((((((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1))||(i3.u6.Node1ID>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i4.u13.Node2ID2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i5.u14.Node0GiveAnswer2>=1))||((i7.u30.Node0IsInserted>=1)&&(i7.u30.Node3requestsent0>=1))))) + (i8.u22.Node4Bootstrap>=1)) + (i2.u5.Node3GiveAnswer0>=1)) + ((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1))) + (i5.u14.Node1GiveAnswer2>=1)) + (i4.u13.Node2JoinMsg>=1)) + ((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1))) + (i1.u2.Node0IsNonInsertedNode>=1)) + A((((i9.u24.Node3GiveAnswer4>=1)||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i1.u2.Node0ID2>=1)) U (((i7.u26.Node1GiveAnswer3>=1)||(i6.u17.Node3JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1))))) + A(EX(((((i1.u2.Node0DHTinfo2>=1)||((i7.u30.Node0IsInserted>=1)&&(i7.u30.Node3requestsent0>=1)))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1))) U (((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||(i9.u24.Node0GiveAnswer4>=1)))) + !(EX(((((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2requestsent1>=1))))))) + !(E((((((((((i10.u25.Node3GiveAnswer1>=1)||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i10.u25.Node0GiveAnswer1>=1))||(i8.u20.Node4DHTinfo>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i0.u1.Node0ResZone>=1))&&((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node1GiveAnswer0>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||(i3.u8.Node1ID2>=1))||(i9.u24.Node1GiveAnswer4>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1))))&&(((((((((((((((i3.u6.Node1DHTinfo>=1)||(i6.u17.Node3Bootstrap>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||(i9.u24.Node0GiveAnswer4>=1))||(i9.u24.Node2GiveAnswer4>=1))&&(i4.u12.Node2IsNonInsertedNode>=1))&&((i3.u8.Node1ID2>=1)||(i7.u26.Node2GiveAnswer3>=1)))||(i8.u22.Node4Bootstrap>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||(i0.u1.Node0ID>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i0.u16.Node3DHTinfo>=1))||(i9.u24.Node2GiveAnswer4>=1))) U (((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1requestsent0>=1)))))))
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EX(!((((((((((((i3.u6.Node1ID>=1)||(i8.u22.Node4JoinMsg>=1))||(i3.u6.Node1ResZone>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u2.Node0ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||(i8.u20.Node4ID>=1))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1))&&(((((((i9.u11.Node2IsInserted>=1)&&(i10.u28.Node1requestsent2>=1))||((i2.u27.Node4IsInserted>=1)&&(i10.u28.Node1requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i0.u16.Node3ID>=1))||(i5.u14.Node4GiveAnswer2>=1))||(i1.u2.Node0IsNonInsertedNode>=1)))))))))) * !(E(!(!(EX(!((((((((((((i3.u6.Node1ID>=1)||(i8.u22.Node4JoinMsg>=1))||(i3.u6.Node1ResZone>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u2.Node0ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||(i8.u20.Node4ID>=1))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1))&&(((((((i9.u11.Node2IsInserted>=1)&&(i10.u28.Node1requestsent2>=1))||((i2.u27.Node4IsInserted>=1)&&(i10.u28.Node1requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i0.u16.Node3ID>=1))||(i5.u14.Node4GiveAnswer2>=1))||(i1.u2.Node0IsNonInsertedNode>=1))))))) U (!(((((((i2.u27.Node4IsInserted>=1)&&(i2.u27.Node0requestsent4>=1))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4OKshare>=1)))||(i3.u7.Node1IsNonInsertedNode>=1))||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4requestsent1>=1)))||(i9.u24.Node2GiveAnswer4>=1))) * !(!(EX(!((((((((((((i3.u6.Node1ID>=1)||(i8.u22.Node4JoinMsg>=1))||(i3.u6.Node1ResZone>=1))||((i4.u12.InsertedCount>=1)&&(i3.u6.Node1ReadyToInsert>=1)))||(i1.u2.Node0ID2>=1))||((i4.u12.InsertedCount>=1)&&(i0.u16.Node3ReadyToInsert>=1)))||(i2.u5.Node4GiveAnswer0>=1))||(i8.u20.Node4ID>=1))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1))&&(((((((i9.u11.Node2IsInserted>=1)&&(i10.u28.Node1requestsent2>=1))||((i2.u27.Node4IsInserted>=1)&&(i10.u28.Node1requestsent4>=1)))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i0.u16.Node3ID>=1))||(i5.u14.Node4GiveAnswer2>=1))||(i1.u2.Node0IsNonInsertedNode>=1)))))))))))] = FALSE * [(FwdU((Init * !(EG(((((((((((!(!(EX(!(((((((((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1))||(i3.u6.Node1ID>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i4.u13.Node2ID2>=1))||(i9.u24.Node3GiveAnswer4>=1))||(i5.u14.Node0GiveAnswer2>=1))||((i7.u30.Node0IsInserted>=1)&&(i7.u30.Node3requestsent0>=1))))))) + (i8.u22.Node4Bootstrap>=1)) + (i2.u5.Node3GiveAnswer0>=1)) + ((i7.u30.Node0IsInserted>=1)&&(i7.u18.Node3Request>=1))) + (i5.u14.Node1GiveAnswer2>=1)) + (i4.u13.Node2JoinMsg>=1)) + ((i9.u11.Node2IsInserted>=1)&&(i2.u4.Node0requestsent2>=1))) + (i1.u2.Node0IsNonInsertedNode>=1)) + !((E(!((((i7.u26.Node1GiveAnswer3>=1)||(i6.u17.Node3JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))) U (!((((i9.u24.Node3GiveAnswer4>=1)||((i2.u31.Node1IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i1.u2.Node0ID2>=1))) * !((((i7.u26.Node1GiveAnswer3>=1)||(i6.u17.Node3JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))))) + EG(!((((i7.u26.Node1GiveAnswer3>=1)||(i6.u17.Node3JoinMsg>=1))||((i5.u29.Node2Request>=1)&&(i2.u27.Node4IsInserted>=1)))))))) + !((E(!((((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||(i9.u24.Node0GiveAnswer4>=1))) U (!(EX(((((i1.u2.Node0DHTinfo2>=1)||((i7.u30.Node0IsInserted>=1)&&(i7.u30.Node3requestsent0>=1)))||(i8.u21.Node4DHTinfo2>=1))||(i9.u24.Node0GiveAnswer4>=1)))) * !((((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||(i9.u24.Node0GiveAnswer4>=1))))) + EG(!((((((((((((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1))||(i5.u14.Node1GiveAnswer2>=1))||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i5.u14.Node3GiveAnswer2>=1))||(i9.u24.Node1GiveAnswer4>=1))||(i0.u16.Node3DHTinfo>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i3.u7.Node1IsNonInsertedNode>=1))||(i9.u24.Node0GiveAnswer4>=1))))))) + !(EX(((((i9.u11.Node2IsInserted>=1)&&(i9.u11.Node4requestsent2>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2requestsent1>=1))))))))),(((((((((i10.u25.Node3GiveAnswer1>=1)||(i6.u17.Node3ID2>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i10.u25.Node0GiveAnswer1>=1))||(i8.u20.Node4DHTinfo>=1))||((i9.u11.Node2IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i0.u1.Node0ResZone>=1))&&((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node1GiveAnswer0>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||(i3.u8.Node1ID2>=1))||(i9.u24.Node1GiveAnswer4>=1))||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1))))&&(((((((((((((((i3.u6.Node1DHTinfo>=1)||(i6.u17.Node3Bootstrap>=1))||(i5.u14.Node3GiveAnswer2>=1))||((i10.u28.Node1Request>=1)&&(i9.u11.Node2IsInserted>=1)))||(i9.u24.Node0GiveAnswer4>=1))||(i9.u24.Node2GiveAnswer4>=1))&&(i4.u12.Node2IsNonInsertedNode>=1))&&((i3.u8.Node1ID2>=1)||(i7.u26.Node2GiveAnswer3>=1)))||(i8.u22.Node4Bootstrap>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3OKshare>=1)))||(i0.u1.Node0ID>=1))||(i7.u26.Node0GiveAnswer3>=1))||(i7.u26.Node2GiveAnswer3>=1))||(i0.u16.Node3DHTinfo>=1))||(i9.u24.Node2GiveAnswer4>=1)))) * (((i0.u0.EmptyCAN>=1)&&(i4.u10.Node2ReadyToInsert>=1))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1requestsent0>=1))))] = FALSE)
Using saturation style SCC detection
(forward)formula 8,1,19.3979,731360,1,0,1.6474e+06,1865,3791,1.85861e+06,445,7509,2763575
FORMULA CANConstruction-PT-005-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(!(E(AF((((i4.u13.Node2JoinMsg<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1)))) U !(EF(((((((i2.u5.Node2GiveAnswer0<1)&&(i10.u9.Node4GiveAnswer1<1))&&(i8.u20.Node4ResZone<1))&&(i8.u20.Node4ID<1))&&(i9.u24.Node2GiveAnswer4<1))&&((i0.u0.EmptyCAN<1)||(i8.u21.Node4ReadyToInsert<1))))))) U AG(((A(((((((((((i2.u5.Node3GiveAnswer0>=1)||(i8.u22.Node4Bootstrap>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i5.u29.Node2Request>=1)&&(i10.u15.Node3IsInserted>=1)))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1requestsent0>=1)))||(i9.u24.Node0GiveAnswer4>=1)) U EF(((((i6.u17.Node3Bootstrap>=1)||(i4.u12.Node2DHTinfo2>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1)))) * EX(AG((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1DHTinfo>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i9.u24.Node3GiveAnswer4>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))||(i4.u10.Node2DHTinfo>=1))))) * (((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i10.u9.Node2GiveAnswer1>=1))||(i9.u24.Node2GiveAnswer4>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i2.u31.Node1IsInserted>=1)&&(i2.u31.Node0requestsent1>=1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(!(EG(!((((i4.u13.Node2JoinMsg<1)&&(i2.u5.Node2GiveAnswer0<1))&&((i10.u28.Node1Request<1)||(i10.u15.Node3IsInserted<1)))))) U !(E(TRUE U ((((((i2.u5.Node2GiveAnswer0<1)&&(i10.u9.Node4GiveAnswer1<1))&&(i8.u20.Node4ResZone<1))&&(i8.u20.Node4ID<1))&&(i9.u24.Node2GiveAnswer4<1))&&((i0.u0.EmptyCAN<1)||(i8.u21.Node4ReadyToInsert<1)))))))) * !(E(TRUE U !(((!((E(!(E(TRUE U ((((i6.u17.Node3Bootstrap>=1)||(i4.u12.Node2DHTinfo2>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1)))) U (!(((((((((((i2.u5.Node3GiveAnswer0>=1)||(i8.u22.Node4Bootstrap>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||(i0.u0.Node0DHTinfo>=1))||(i3.u8.Node1JoinMsg>=1))||(i10.u9.Node2GiveAnswer1>=1))||((i5.u29.Node2Request>=1)&&(i10.u15.Node3IsInserted>=1)))||((i2.u27.Node4IsInserted>=1)&&(i5.u29.Node2requestsent4>=1)))||((i7.u30.Node0IsInserted>=1)&&(i10.u28.Node1requestsent0>=1)))||(i9.u24.Node0GiveAnswer4>=1))) * !(E(TRUE U ((((i6.u17.Node3Bootstrap>=1)||(i4.u12.Node2DHTinfo2>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1)))))) + EG(!(E(TRUE U ((((i6.u17.Node3Bootstrap>=1)||(i4.u12.Node2DHTinfo2>=1))||(i10.u25.Node0GiveAnswer1>=1))||(i7.u26.Node0GiveAnswer3>=1))))))) * EX(!(E(TRUE U !((((((((((i2.u5.Node3GiveAnswer0>=1)||(i3.u6.Node1DHTinfo>=1))||((i2.u31.Node1IsInserted>=1)&&(i5.u29.Node2Request>=1)))||(i9.u24.Node3GiveAnswer4>=1))||(i10.u9.Node4GiveAnswer1>=1))||((i10.u15.Node3IsInserted>=1)&&(i9.u23.Node4Request>=1)))||(i7.u26.Node2GiveAnswer3>=1))||(i9.u24.Node2GiveAnswer4>=1))||(i4.u10.Node2DHTinfo>=1))))))) * (((((((i2.u5.Node3GiveAnswer0>=1)||(i2.u5.Node2GiveAnswer0>=1))||(i10.u9.Node2GiveAnswer1>=1))||(i9.u24.Node2GiveAnswer4>=1))||((i6.u19.Node3WaitAnswer>=1)&&(i7.u26.Node3NOshare>=1)))||((i4.u12.InsertedCount>=1)&&(i0.u0.Node0ReadyToInsert>=1)))||((i2.u31.Node1IsInserted>=1)&&(i2.u31.Node0requestsent1>=1))))))))] != FALSE
(forward)formula 9,0,19.422,732152,1,0,1.64865e+06,1865,3823,1.86055e+06,445,7509,2766644
FORMULA CANConstruction-PT-005-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AG(!(AX(((((((i10.u25.Node3GiveAnswer1>=1)||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||(i0.u16.Node3ID>=1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(!(!(EX(!(((((((i10.u25.Node3GiveAnswer1>=1)||((i10.u15.Node3IsInserted>=1)&&(i2.u4.Node0requestsent3>=1)))||(i9.u24.Node3GiveAnswer4>=1))||((i4.u12.InsertedCount>=1)&&(i4.u10.Node2ReadyToInsert>=1)))||((i8.u22.Node4WaitAnswer>=1)&&(i9.u24.Node4NOshare>=1)))||(i0.u16.Node3ID>=1))))))))))] != FALSE
(forward)formula 10,0,19.6509,740600,1,0,1.66765e+06,1865,3831,1.884e+06,445,7516,2800560
FORMULA CANConstruction-PT-005-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621242857698

--------------------
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="CANConstruction-PT-005"
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 CANConstruction-PT-005, 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 r292-tall-162124155800002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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