Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291300018.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircadianClock-PT-000100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291300018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620799267681

Running Version 0
[2021-05-12 06:01:10] [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-12 06:01:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:01:10] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-12 06:01:10] [INFO ] Transformed 14 places.
[2021-05-12 06:01:10] [INFO ] Transformed 16 transitions.
[2021-05-12 06:01:10] [INFO ] Parsed PT model containing 14 places and 16 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 14/14 places, 16/16 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:10] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-12 06:01:10] [INFO ] Implicit Places using invariants in 111 ms returned []
[2021-05-12 06:01:10] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:10] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 06:01:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-12 06:01:11] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2021-05-12 06:01:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:01:11] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
[2021-05-12 06:01:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2021-05-12 06:01:11] [INFO ] Flatten gal took : 41 ms
FORMULA CircadianClock-PT-000100-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000100-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:01:11] [INFO ] Flatten gal took : 7 ms
[2021-05-12 06:01:11] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100056 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=1588 ) properties (out of 71) seen :55
Running SMT prover for 16 properties.
[2021-05-12 06:01:11] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:11] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 13 simplifications.
[2021-05-12 06:01:12] [INFO ] Initial state test concluded for 1 properties.
FORMULA CircadianClock-PT-000100-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Applied a total of 0 rules in 4 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:12] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:12] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:12] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:12] [INFO ] Time to serialize gal into /tmp/CTLFireability6981313566266685417.gal : 1 ms
[2021-05-12 06:01:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14664284330696420320.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/CTLFireability6981313566266685417.gal, -t, CGAL, -ctl, /tmp/CTLFireability14664284330696420320.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/CTLFireability6981313566266685417.gal -t CGAL -ctl /tmp/CTLFireability14664284330696420320.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20404e+10,1.30923,43300,2,517,5,235094,6,0,75,262885,0


Converting to forward existential form...Done !
original formula: !(AG(((((((((da_a>=1)&&(ma_cap>=1))||((dr_a>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))||((c>=1)&&(r_cap>=1)))||((da>=1)&&(ma_cap>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(((((((((da_a>=1)&&(ma_cap>=1))||((dr_a>=1)&&(mr_cap>=1)))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||((dr_a>=1)&&(a_cap>=1)))||((c>=1)&&(r_cap>=1)))||((da>=1)&&(ma_cap>=1)))))] != FALSE
(forward)formula 0,1,1.31549,43300,1,0,8,235094,9,2,814,262885,1
FORMULA CircadianClock-PT-000100-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:13] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize gal into /tmp/CTLFireability6377139415010586358.gal : 1 ms
[2021-05-12 06:01:13] [INFO ] Time to serialize properties into /tmp/CTLFireability1587532849822290751.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/CTLFireability6377139415010586358.gal, -t, CGAL, -ctl, /tmp/CTLFireability1587532849822290751.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/CTLFireability6377139415010586358.gal -t CGAL -ctl /tmp/CTLFireability1587532849822290751.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20404e+10,1.66411,43300,2,517,5,235094,6,0,75,262885,0


Converting to forward existential form...Done !
original formula: !(EF((((((((((a>=1)||((a>=1)&&(dr>=1)))||(mr>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||(r>=1))||((ma>=1)&&(a_cap>=1)))||((c>=1)&&(r_cap>=1))) * EG((((((a>=1)||((a>=1)&&(dr>=1)))||((dr>=1)&&(mr_cap>=1)))||(mr>=1))||((da_a>=1)&&(a_cap>=1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * ((((((((a>=1)||((a>=1)&&(dr>=1)))||(mr>=1))||((a>=1)&&(da>=1)))||((mr>=1)&&(r_cap>=1)))||(r>=1))||((ma>=1)&&(a_cap>=1)))||((c>=1)&&(r_cap>=1)))),(((((a>=1)||((a>=1)&&(dr>=1)))||((dr>=1)&&(mr_cap>=1)))||(mr>=1))||((da_a>=1)&&(a_cap>=1))))] = FALSE
Hit Full ! (commute/partial/dont) 4/0/12
(forward)formula 0,0,1.69301,43300,1,0,8,235094,20,2,1368,262885,9
FORMULA CircadianClock-PT-000100-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Applied a total of 0 rules in 5 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:15] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:15] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:15] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:15] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:15] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13510560220822853540.gal : 4 ms
[2021-05-12 06:01:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11906944325916368631.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/CTLFireability13510560220822853540.gal, -t, CGAL, -ctl, /tmp/CTLFireability11906944325916368631.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/CTLFireability13510560220822853540.gal -t CGAL -ctl /tmp/CTLFireability11906944325916368631.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20404e+10,2.22108,43368,2,517,5,235094,6,0,75,262885,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((mr>=1)||((dr>=1)&&(mr_cap>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((mr>=1)||((dr>=1)&&(mr_cap>=1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,3.16922,43752,1,0,6,237938,18,1,1358,264590,10
FORMULA CircadianClock-PT-000100-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Applied a total of 0 rules in 35 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 2 ms
FORMULA CircadianClock-PT-000100-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:18] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 21 ms
FORMULA CircadianClock-PT-000100-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 17 ms
[2021-05-12 06:01:18] [INFO ] Applying decomposition
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 3 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/graph1689470741428396384.txt, -o, /tmp/graph1689470741428396384.bin, -w, /tmp/graph1689470741428396384.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/graph1689470741428396384.bin, -l, -1, -v, -w, /tmp/graph1689470741428396384.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:01:18] [INFO ] Decomposing Gal with order
[2021-05-12 06:01:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:01:18] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-12 06:01:18] [INFO ] Flatten gal took : 41 ms
[2021-05-12 06:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2021-05-12 06:01:18] [INFO ] Time to serialize gal into /tmp/CTLFireability4039704327971984850.gal : 1 ms
[2021-05-12 06:01:18] [INFO ] Time to serialize properties into /tmp/CTLFireability16365902755975280156.ctl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability4039704327971984850.gal, -t, CGAL, -ctl, /tmp/CTLFireability16365902755975280156.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/CTLFireability4039704327971984850.gal -t CGAL -ctl /tmp/CTLFireability16365902755975280156.ctl
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.20404e+10,3.88565,73408,11,104,96523,51764,49,245106,13,244781,0


Converting to forward existential form...Done !
original formula: AF(AX((EF(((((((u6.a<1)||(i2.u1.dr<1))&&(((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))&&(i0.u2.ma<1))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))&&((i0.u0.da_a<1)||(u6.a_cap<1)))) + ((((EF(((((((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))&&((((((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1))))) * EF(((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))) * (i2.u3.mr<1)) * ((u6.a<1)||(i2.u1.dr<1))) * (((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((E(TRUE U ((((((u6.a<1)||(i2.u1.dr<1))&&(((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))&&(i0.u2.ma<1))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))&&((i0.u0.da_a<1)||(u6.a_cap<1)))) + ((((E(TRUE U ((((((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))&&((((((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1))))) * E(TRUE U ((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))) * (i2.u3.mr<1)) * ((u6.a<1)||(i2.u1.dr<1))) * (((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,4.1572,73408,1,0,96523,51764,306,245106,256,244781,3023
FORMULA CircadianClock-PT-000100-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(((AG(((((((E(((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))) U ((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (i0.u2.ma>=1)) + (i2.u3.mr>=1)) + ((u6.a>=1)&&(i0.u0.da>=1))) + ((i2.u3.mr>=1)&&(i3.u4.r_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))) + ((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) * E((((((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))||(u6.a>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||(((((i2.u1.dr<1)||(i2.u3.mr_cap<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u2.ma<1)||(u6.a_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) U ((((((((E(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i3.u4.r>=1))) + (u6.a>=1)) + ((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) + ((u6.a>=1)&&(i2.u1.dr>=1))) + ((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))) + ((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))) + (i3.u4.r>=1)) + ((i0.u2.ma>=1)&&(u6.a_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))))) * EF((((EX((((((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i2.u3.mr>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (((((u6.a<1)&&(i2.u3.mr<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i3.u5.c<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) + ((((u6.a<1)&&((i0.u0.da_a<1)||(i0.u2.ma_cap<1)))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))) + ((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))))
=> equivalent forward existential formula: ((([(EY(FwdU((EY(Init) * (!(E(TRUE U !(((((((E(((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))) U ((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (i0.u2.ma>=1)) + (i2.u3.mr>=1)) + ((u6.a>=1)&&(i0.u0.da>=1))) + ((i2.u3.mr>=1)&&(i3.u4.r_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))) + ((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))) * E((((((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))||(u6.a>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||(((((i2.u1.dr<1)||(i2.u3.mr_cap<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u2.ma<1)||(u6.a_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) U ((((((((E(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i3.u4.r>=1))) + (u6.a>=1)) + ((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) + ((u6.a>=1)&&(i2.u1.dr>=1))) + ((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))) + ((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))) + (i3.u4.r>=1)) + ((i0.u2.ma>=1)&&(u6.a_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))))),TRUE)) * (((((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i2.u3.mr>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))] != FALSE + [(FwdU((EY(Init) * (!(E(TRUE U !(((((((E(((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))) U ((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (i0.u2.ma>=1)) + (i2.u3.mr>=1)) + ((u6.a>=1)&&(i0.u0.da>=1))) + ((i2.u3.mr>=1)&&(i3.u4.r_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))) + ((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))) * E((((((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))||(u6.a>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||(((((i2.u1.dr<1)||(i2.u3.mr_cap<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u2.ma<1)||(u6.a_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) U ((((((((E(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i3.u4.r>=1))) + (u6.a>=1)) + ((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) + ((u6.a>=1)&&(i2.u1.dr>=1))) + ((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))) + ((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))) + (i3.u4.r>=1)) + ((i0.u2.ma>=1)&&(u6.a_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))))),TRUE) * (((((u6.a<1)&&(i2.u3.mr<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i3.u5.c<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1))))] != FALSE) + [(FwdU((EY(Init) * (!(E(TRUE U !(((((((E(((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))) U ((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (i0.u2.ma>=1)) + (i2.u3.mr>=1)) + ((u6.a>=1)&&(i0.u0.da>=1))) + ((i2.u3.mr>=1)&&(i3.u4.r_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))) + ((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))) * E((((((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))||(u6.a>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||(((((i2.u1.dr<1)||(i2.u3.mr_cap<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u2.ma<1)||(u6.a_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) U ((((((((E(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i3.u4.r>=1))) + (u6.a>=1)) + ((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) + ((u6.a>=1)&&(i2.u1.dr>=1))) + ((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))) + ((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))) + (i3.u4.r>=1)) + ((i0.u2.ma>=1)&&(u6.a_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))))),TRUE) * ((((u6.a<1)&&((i0.u0.da_a<1)||(i0.u2.ma_cap<1)))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1))))] != FALSE) + [(FwdU((EY(Init) * (!(E(TRUE U !(((((((E(((((((((u6.a>=1)&&(i2.u1.dr>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))) U ((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + (i0.u2.ma>=1)) + (i2.u3.mr>=1)) + ((u6.a>=1)&&(i0.u0.da>=1))) + ((i2.u3.mr>=1)&&(i3.u4.r_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1))) + ((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))) * E((((((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))||(u6.a>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||(((((i2.u1.dr<1)||(i2.u3.mr_cap<1))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u2.ma<1)||(u6.a_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))) U ((((((((E(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i3.u4.r>=1))) + (u6.a>=1)) + ((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) + ((u6.a>=1)&&(i2.u1.dr>=1))) + ((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))) + ((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))) + (i3.u4.r>=1)) + ((i0.u2.ma>=1)&&(u6.a_cap>=1))) + ((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))))),TRUE) * ((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))] != FALSE)
(forward)formula 1,1,7.73663,139320,1,0,202570,162203,418,369019,257,467592,58510
FORMULA CircadianClock-PT-000100-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(((AX(AF(((((((u6.a>=1)&&(i2.u1.dr>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i2.u3.mr>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1))))) * AF(EX(((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i0.u2.ma>=1))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))) * EF((((((i3.u4.r>=1)||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))&&((((((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))&&((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))&&((((((((((u6.a>=1)||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))))
=> equivalent forward existential formula: (([FwdG(EY(FwdU(Init,TRUE)),!(((((((u6.a>=1)&&(i2.u1.dr>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i2.u3.mr>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))))] = FALSE * [FwdG(FwdU(Init,TRUE),!(EX(((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||(i0.u2.ma>=1))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))))] = FALSE) * [(FwdU(Init,TRUE) * !(E(TRUE U (((((i3.u4.r>=1)||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))&&((((((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))&&((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))&&((((((((((u6.a>=1)||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))))] = FALSE)
(forward)formula 2,0,8.08477,144072,1,0,216932,162303,464,372641,257,467863,65889
FORMULA CircadianClock-PT-000100-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG(AX(EX(((((((u6.a>=1)||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))&&((((((i0.u2.ma>=1)||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(((((((u6.a>=1)||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))&&((((((i0.u2.ma>=1)||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))))] = FALSE
(forward)formula 3,1,8.08848,144600,1,0,217009,162303,476,372769,257,467865,66013
FORMULA CircadianClock-PT-000100-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(AX((((((u6.a<1)&&(i0.u2.ma<1))&&((i2.u1.dr_a<1)||(i2.u3.mr_cap<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((((((u6.a<1)&&(i0.u2.ma<1))&&((i2.u1.dr_a<1)||(i2.u3.mr_cap<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))))))))] = FALSE
(forward)formula 4,0,8.09042,144600,1,0,217049,162303,490,372840,257,467865,66071
FORMULA CircadianClock-PT-000100-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((((((((u6.a>=1)||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) * EG(((!(AF(EX(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))))) * (((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1))) * (i2.u3.mr<1))))
=> equivalent forward existential formula: ([FwdG(Init,!(((((((((((u6.a>=1)||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1)))||(i0.u2.ma>=1))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))] = FALSE * [(Init * !(EG(((!(!(EG(!(EX(((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))))))) * (((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1))) * (i2.u3.mr<1)))))] = FALSE)
(forward)formula 5,0,8.09387,144600,1,0,217090,162303,500,372924,257,467867,66135
FORMULA CircadianClock-PT-000100-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (!(E(((((((((((((((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((u6.a>=1)&&(i2.u1.dr>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))&&((((((u6.a<1)||(i2.u1.dr<1))&&(((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))&&(i2.u3.mr<1))&&(i3.u4.r<1))||((((((((((((((((i0.u0.da_a<1)||(i0.u2.ma_cap<1))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))&&(u6.a<1))&&((u6.a<1)||(i2.u1.dr<1)))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&((i2.u1.dr_a<1)||(i2.u3.mr_cap<1)))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&(i3.u4.r<1))&&((i3.u5.c<1)||(i3.u4.r_cap<1)))&&((i2.u1.dr_a<1)||(u6.a_cap<1))))) + ((E(((u6.a>=1)||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))) * ((i0.u0.da_a<1)||(i0.u2.ma_cap<1))) * ((i0.u0.da<1)||(i0.u2.ma_cap<1)))) + !(EG(((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))) + EG(((((u6.a>=1)||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1))))) U (AX((EX(((((u6.a>=1)||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + EF((((((u6.a>=1)&&(i2.u1.dr>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))))) + AX((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1))))))) * (AF((((((u6.a<1)||(i2.u1.dr<1))&&(i0.u2.ma<1))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))) + ((!(EF((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))))) * EG(EF((((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i3.u4.r>=1))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))))) * EX(TRUE))))
=> equivalent forward existential formula: (([(FwdU(Init,((((((((((((((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((u6.a>=1)&&(i2.u1.dr>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))&&((((((u6.a<1)||(i2.u1.dr<1))&&(((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))&&(i2.u3.mr<1))&&(i3.u4.r<1))||((((((((((((((((i0.u0.da_a<1)||(i0.u2.ma_cap<1))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))&&(u6.a<1))&&((u6.a<1)||(i2.u1.dr<1)))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&((i2.u1.dr_a<1)||(i2.u3.mr_cap<1)))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&(i3.u4.r<1))&&((i3.u5.c<1)||(i3.u4.r_cap<1)))&&((i2.u1.dr_a<1)||(u6.a_cap<1))))) + ((E(((u6.a>=1)||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))) * ((i0.u0.da_a<1)||(i0.u2.ma_cap<1))) * ((i0.u0.da<1)||(i0.u2.ma_cap<1)))) + !(EG(((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))) + EG(((((u6.a>=1)||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))))) * !(EX(!((EX(((((u6.a>=1)||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||(i3.u4.r>=1))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))) + E(TRUE U (((((u6.a>=1)&&(i2.u1.dr>=1))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))))))))] = FALSE * [(FwdU(Init,((((((((((((((((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((u6.a>=1)&&(i2.u1.dr>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||(i0.u2.ma>=1))||(i2.u3.mr>=1))||(i3.u4.r>=1))||((i2.u3.mr>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))&&((((((u6.a<1)||(i2.u1.dr<1))&&(((u6.a<1)||(i3.u4.r<1))||(i3.u5.c_cap<1)))&&(i2.u3.mr<1))&&(i3.u4.r<1))||((((((((((((((((i0.u0.da_a<1)||(i0.u2.ma_cap<1))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&((i0.u0.da<1)||(i0.u2.ma_cap<1)))&&(u6.a<1))&&((u6.a<1)||(i2.u1.dr<1)))&&((i2.u1.dr<1)||(i2.u3.mr_cap<1)))&&((i2.u1.dr_a<1)||(i2.u3.mr_cap<1)))&&((u6.a<1)||(i0.u0.da<1)))&&((i2.u3.mr<1)||(i3.u4.r_cap<1)))&&(i3.u4.r<1))&&((i3.u5.c<1)||(i3.u4.r_cap<1)))&&((i2.u1.dr_a<1)||(u6.a_cap<1))))) + ((E(((u6.a>=1)||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1))) U (((i2.u1.dr_a>=1)&&(i2.u3.mr_cap>=1))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))) * ((i0.u0.da_a<1)||(i0.u2.ma_cap<1))) * ((i0.u0.da<1)||(i0.u2.ma_cap<1)))) + !(EG(((i0.u0.da>=1)&&(i0.u2.ma_cap>=1))))) + EG(((((u6.a>=1)||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||(((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))))) * !(EX(!((((((((((u6.a>=1)||((u6.a>=1)&&(i2.u1.dr>=1)))||((i0.u0.da_a>=1)&&(i0.u2.ma_cap>=1)))||((i2.u1.dr>=1)&&(i2.u3.mr_cap>=1)))||((u6.a>=1)&&(i0.u0.da>=1)))||(i3.u4.r>=1))||((i2.u1.dr_a>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))||((i0.u0.da_a>=1)&&(u6.a_cap>=1)))))))] = FALSE) * (([(FwdU((Init * !(!(EG(!((((((u6.a<1)||(i2.u1.dr<1))&&(i0.u2.ma<1))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))))))),TRUE) * (((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1))))] = FALSE * [((Init * !(!(EG(!((((((u6.a<1)||(i2.u1.dr<1))&&(i0.u2.ma<1))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))))))) * !(EG(E(TRUE U (((((((((u6.a>=1)&&(i3.u4.r>=1))&&(i3.u5.c_cap>=1))||(i0.u2.ma>=1))||((u6.a>=1)&&(i0.u0.da>=1)))||(i3.u4.r>=1))||((i3.u5.c>=1)&&(i3.u4.r_cap>=1)))||((i0.u2.ma>=1)&&(u6.a_cap>=1)))||((i0.u0.da>=1)&&(i0.u2.ma_cap>=1)))))))] = FALSE) * [((Init * !(!(EG(!((((((u6.a<1)||(i2.u1.dr<1))&&(i0.u2.ma<1))&&(i2.u3.mr<1))&&((u6.a<1)||(i0.u0.da<1)))))))) * !(EX(TRUE)))] = FALSE))
(forward)formula 6,0,182.421,596456,1,0,847714,181970,649,2.53668e+06,257,583806,109909
FORMULA CircadianClock-PT-000100-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620799461839

--------------------
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="CircadianClock-PT-000100"
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 CircadianClock-PT-000100, 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 r045-oct2-162038291300018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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