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-162038291300002.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-000001, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291300002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 98K 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.2K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 19K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.7K Mar 22 12:29 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 12K 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-000001-CTLFireability-00
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-01
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-02
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-03
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-04
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-05
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-06
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-07
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-08
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-09
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-10
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-11
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-12
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-13
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-14
FORMULA_NAME CircadianClock-PT-000001-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1620799265526

Running Version 0
[2021-05-12 06:01:07] [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:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 06:01:07] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-12 06:01:07] [INFO ] Transformed 14 places.
[2021-05-12 06:01:07] [INFO ] Transformed 16 transitions.
[2021-05-12 06:01:07] [INFO ] Found NUPN structural information;
[2021-05-12 06:01:07] [INFO ] Parsed PT model containing 14 places and 16 transitions in 62 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 16 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:08] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-12 06:01:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2021-05-12 06:01:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:08] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-12 06:01:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-12 06:01:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2021-05-12 06:01:08] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:08] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 06:01:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/14 places, 16/16 transitions.
[2021-05-12 06:01:08] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-12 06:01:08] [INFO ] Flatten gal took : 24 ms
FORMULA CircadianClock-PT-000001-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:01:08] [INFO ] Flatten gal took : 7 ms
[2021-05-12 06:01:08] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=194 ) properties (out of 83) seen :67
Running SMT prover for 16 properties.
[2021-05-12 06:01:09] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-12 06:01:09] [INFO ] Computed 7 place invariants in 13 ms
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 22 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 52 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 49 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-12 06:01:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 0 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 06:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 8 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 06:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 06:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-12 06:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 06:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 06:01:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 06:01:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 06:01:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned unsat
Successfully simplified 16 atomic propositions for a total of 14 simplifications.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 2 ms
[2021-05-12 06:01:10] [INFO ] Input system was already deterministic with 16 transitions.
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 1 ms
[2021-05-12 06:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13151939764698588346.gal : 1 ms
[2021-05-12 06:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability836853356490431024.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/CTLFireability13151939764698588346.gal, -t, CGAL, -ctl, /tmp/CTLFireability836853356490431024.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/CTLFireability13151939764698588346.gal -t CGAL -ctl /tmp/CTLFireability836853356490431024.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,128,0.007093,4320,2,22,5,256,6,0,75,210,0


Converting to forward existential form...Done !
original formula: A(AF((((a==0)||(r==0))||(c_cap==0))) U AF(((ma==1)||((da_a==1)&&(a_cap==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(((ma==1)||((da_a==1)&&(a_cap==1)))))))))) * !(E(!(!(EG(!(((ma==1)||((da_a==1)&&(a_cap==1))))))) U (!(!(EG(!((((a==0)||(r==0))||(c_cap==0)))))) * !(!(EG(!(((ma==1)||((da_a==1)&&(a_cap==1)))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.012282,4972,1,0,18,897,32,11,377,844,18
FORMULA CircadianClock-PT-000001-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-12 06:01:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 5 ms
FORMULA CircadianClock-PT-000001-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-CTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 3 ms
[2021-05-12 06:01:10] [INFO ] Applying decomposition
[2021-05-12 06:01:10] [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/graph6504496982462649755.txt, -o, /tmp/graph6504496982462649755.bin, -w, /tmp/graph6504496982462649755.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/graph6504496982462649755.bin, -l, -1, -v, -w, /tmp/graph6504496982462649755.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 06:01:10] [INFO ] Decomposing Gal with order
[2021-05-12 06:01:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 06:01:10] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-12 06:01:10] [INFO ] Flatten gal took : 42 ms
[2021-05-12 06:01:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2021-05-12 06:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability15879293693622586493.gal : 3 ms
[2021-05-12 06:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability11360261992996448727.ctl : 7 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/CTLFireability15879293693622586493.gal, -t, CGAL, -ctl, /tmp/CTLFireability11360261992996448727.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/CTLFireability15879293693622586493.gal -t CGAL -ctl /tmp/CTLFireability11360261992996448727.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,128,0.004222,4456,8,4,91,18,48,101,13,15,0


Converting to forward existential form...Done !
original formula: !(AX((!(AF(AX(((((((((((u6.a==1)||((u6.a==1)&&(i1.u2.dr==1)))||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))))) * EF((((((u6.a==1)||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EG(!(!(EX(!(((((((((((u6.a==1)||((u6.a==1)&&(i1.u2.dr==1)))||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1))))))))))] != FALSE + [(EY(Init) * !(E(TRUE U (((((u6.a==1)||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1))))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,0.00787,4956,1,0,145,20,202,174,46,15,359
FORMULA CircadianClock-PT-000001-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (((!(EF(((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1))))) + AF(((((((u6.a==1)&&(i1.u2.dr==1))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))&&(((i1.u3.mr==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))) + !(AX(AX((((((u6.a==1)||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1))))))) + !(AX(((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))))
=> equivalent forward existential formula: [FwdG((((Init * !(!(!(EX(!(((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))))))) * !(!(!(EX(!(!(EX(!((((((u6.a==1)||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))))))))))) * !(!(E(TRUE U ((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1))))))),!(((((((u6.a==1)&&(i1.u2.dr==1))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))&&(((i1.u3.mr==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))))] = FALSE
(forward)formula 1,1,0.012033,5220,1,0,275,20,306,327,48,15,649
FORMULA CircadianClock-PT-000001-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))) + AG(((((((AF((EX(((u6.a==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))) + EX((((((((u6.a==1)||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))) + A((EF((((((i2.u5.ma==1)||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))) + EX(((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))) U (((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1))))) + ((u6.a==1)&&(i1.u2.dr==1))) + ((i1.u2.dr==1)&&(i1.u3.mr_cap==1))) + (i2.u5.ma==1)) + ((u6.a==1)&&(i2.u1.da==1))) + ((i2.u1.da_a==1)&&(u6.a_cap==1)))))
=> equivalent forward existential formula: [FwdG(((((((FwdU((Init * !(E(TRUE U ((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))),TRUE) * !(((i2.u1.da_a==1)&&(u6.a_cap==1)))) * !(((u6.a==1)&&(i2.u1.da==1)))) * !((i2.u5.ma==1))) * !(((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))) * !(((u6.a==1)&&(i1.u2.dr==1)))) * !(!((E(!((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))) U (!((E(TRUE U (((((i2.u5.ma==1)||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))) + EX(((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))) * !((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))))) + EG(!((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i0.u4.r==1))||((i1.u2.dr_a==1)&&(u6.a_cap==1))))))))),!((EX(((u6.a==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))) + EX((((((((u6.a==1)||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))))] = FALSE
(forward)formula 2,1,0.023848,5220,1,0,350,20,353,424,49,15,832
FORMULA CircadianClock-PT-000001-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EX(EG(((((((EX(((((((((u6.a==1)||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))) + (u6.a==1)) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))) + ((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1))) + (i2.u5.ma==1)) + ((u6.a==1)&&(i2.u1.da==1))) + (i0.u4.r==1)))) + AG(AX(EX(((u6.a==0)&&((i2.u5.ma==0)||(u6.a_cap==0)))))))
=> equivalent forward existential formula: [(EY(FwdU((Init * !(EX(EG(((((((EX(((((((((u6.a==1)||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))) + (u6.a==1)) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))) + ((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1))) + (i2.u5.ma==1)) + ((u6.a==1)&&(i2.u1.da==1))) + (i0.u4.r==1)))))),TRUE)) * !(EX(((u6.a==0)&&((i2.u5.ma==0)||(u6.a_cap==0))))))] = FALSE
(forward)formula 3,1,0.041873,5220,1,0,379,20,371,453,51,15,895
FORMULA CircadianClock-PT-000001-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((A((AF(EG((((i0.u4.r==1)||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))) * (((((i1.u3.mr==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))) U ((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))) * !(AG((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||(i1.u3.mr==1))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))) * !(AX(((((((u6.a==0)&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&(i2.u5.ma==0))&&(i0.u4.r==0))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))||(((((((((u6.a==0)&&((i2.u1.da_a==0)||(i2.u5.ma_cap==0)))&&((u6.a==0)||(i1.u2.dr==0)))&&((i1.u2.dr_a==0)||(i1.u3.mr_cap==0)))&&(i1.u3.mr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))&&((i2.u1.da==0)||(i2.u5.ma_cap==0)))&&((i2.u1.da_a==0)||(u6.a_cap==0)))))))
=> equivalent forward existential formula: [(EY((Init * (!((E(!(((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))) U (!((!(EG(!(EG((((i0.u4.r==1)||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))))) * (((((i1.u3.mr==1)||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1))))) * !(((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))))) + EG(!(((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1)))||(i0.u4.r==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1))))))) * !(!(E(TRUE U !((((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||(i1.u3.mr==1))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))))))))) * !(((((((u6.a==0)&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&(i2.u5.ma==0))&&(i0.u4.r==0))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))||(((((((((u6.a==0)&&((i2.u1.da_a==0)||(i2.u5.ma_cap==0)))&&((u6.a==0)||(i1.u2.dr==0)))&&((i1.u2.dr_a==0)||(i1.u3.mr_cap==0)))&&(i1.u3.mr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))&&((i2.u1.da==0)||(i2.u5.ma_cap==0)))&&((i2.u1.da_a==0)||(u6.a_cap==0))))))] != FALSE
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 4,0,0.050673,5220,1,0,537,20,478,660,51,15,1299
FORMULA CircadianClock-PT-000001-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EG((!(EX(TRUE)) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(EX(TRUE)) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))))))] = FALSE
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 5,0,0.050843,5220,1,0,538,20,481,668,51,15,1309
FORMULA CircadianClock-PT-000001-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 6,1,0.050878,5220,1,0,538,20,481,669,51,15,1309
FORMULA CircadianClock-PT-000001-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EX(TRUE))
=> equivalent forward existential formula: [(EY(EY(Init)) * TRUE)] != FALSE
(forward)formula 7,1,0.050952,5220,1,0,551,20,481,682,51,15,1340
FORMULA CircadianClock-PT-000001-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(!(A(((AX((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))) + (((((((u6.a==0)&&((i1.u2.dr==0)||(i1.u3.mr_cap==0)))&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&(i2.u5.ma==0))&&(i1.u3.mr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))) + ((((((((((u6.a==0)&&((i1.u2.dr==0)||(i1.u3.mr_cap==0)))&&(i2.u5.ma==0))&&(i1.u3.mr==0))&&((u6.a==0)||(i2.u1.da==0)))&&(i0.u4.r==0))&&((i2.u5.ma==0)||(u6.a_cap==0)))&&((i1.u2.dr_a==0)||(u6.a_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))&&((i2.u1.da==0)||(i2.u5.ma_cap==0)))) U ((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i2.u5.ma==1))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1))))))
=> equivalent forward existential formula: ([(EY((((FwdU(EY(Init),!(((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i2.u5.ma==1))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1))))) * !(((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i2.u5.ma==1))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1))))) * !(((((((((((u6.a==0)&&((i1.u2.dr==0)||(i1.u3.mr_cap==0)))&&(i2.u5.ma==0))&&(i1.u3.mr==0))&&((u6.a==0)||(i2.u1.da==0)))&&(i0.u4.r==0))&&((i2.u5.ma==0)||(u6.a_cap==0)))&&((i1.u2.dr_a==0)||(u6.a_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))&&((i2.u1.da==0)||(i2.u5.ma_cap==0))))) * !((((((((u6.a==0)&&((i1.u2.dr==0)||(i1.u3.mr_cap==0)))&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&(i2.u5.ma==0))&&(i1.u3.mr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i0.u0.c==0)||(i0.u4.r_cap==0)))))) * !((((((u6.a==1)&&(i1.u2.dr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))))] != FALSE + [FwdG(EY(Init),!(((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||(i2.u5.ma==1))||(i1.u3.mr==1))||((u6.a==1)&&(i2.u1.da==1)))))] != FALSE)
(forward)formula 8,0,0.074714,5220,1,0,577,20,537,713,51,15,1406
FORMULA CircadianClock-PT-000001-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((E(E(EG((((((u6.a==1)||(i1.u3.mr==1))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))) U EG(((((((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))) U AF(((((((((u6.a==1)||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||(i2.u5.ma==1))||(i1.u3.mr==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))&&((((u6.a==1)&&(i2.u1.da==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))))) * (!(AF(((i0.u0.c==1)&&(i0.u4.r_cap==1)))) + ((((((((i2.u5.ma==0)&&(i1.u3.mr==0))&&((i2.u1.da_a==0)||(i2.u5.ma_cap==0)))&&((u6.a==0)||(i1.u2.dr==0)))&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&((i1.u2.dr_a==0)||(i1.u3.mr_cap==0)))&&((u6.a==0)||(i2.u1.da==0)))&&((i2.u1.da_a==0)||(u6.a_cap==0))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(E(EG((((((u6.a==1)||(i1.u3.mr==1))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))) U EG(((((((((((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(i2.u5.ma==1))||((u6.a==1)&&(i2.u1.da==1)))||(i1.u3.mr==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1))))) U !(EG(!(((((((((u6.a==1)||((i2.u1.da_a==1)&&(i2.u5.ma_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||(i2.u5.ma==1))||(i1.u3.mr==1))||((i0.u0.c==1)&&(i0.u4.r_cap==1)))||((i2.u1.da_a==1)&&(u6.a_cap==1)))&&((((u6.a==1)&&(i2.u1.da==1))||((i1.u3.mr==1)&&(i0.u4.r_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1))))))))))] = FALSE * [((FwdU(Init,TRUE) * !(((((((((i2.u5.ma==0)&&(i1.u3.mr==0))&&((i2.u1.da_a==0)||(i2.u5.ma_cap==0)))&&((u6.a==0)||(i1.u2.dr==0)))&&(((u6.a==0)||(i0.u4.r==0))||(i0.u0.c_cap==0)))&&((i1.u2.dr_a==0)||(i1.u3.mr_cap==0)))&&((u6.a==0)||(i2.u1.da==0)))&&((i2.u1.da_a==0)||(u6.a_cap==0))))) * !(EG(!(((i0.u0.c==1)&&(i0.u4.r_cap==1))))))] = FALSE)
(forward)formula 9,0,0.076039,5220,1,0,598,20,570,743,51,15,1464
FORMULA CircadianClock-PT-000001-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EF(AX(((((EG((((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||(i2.u5.ma==1))) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))) + (((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))) + ((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1))) + ((i2.u5.ma==1)&&(u6.a_cap==1))))) * !(AG(!(AG((((((u6.a==0)||(i1.u2.dr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i1.u2.dr_a==0)||(u6.a_cap==0)))&&((((((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))))))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U !(EX(!(((((EG((((((((u6.a==1)&&(i1.u2.dr==1))||((u6.a==1)&&(i2.u1.da==1)))||((i2.u5.ma==1)&&(u6.a_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1)))||((i2.u1.da==1)&&(i2.u5.ma_cap==1)))||(i2.u5.ma==1))) + ((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))) + (((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1))) + ((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1))) + ((i2.u5.ma==1)&&(u6.a_cap==1)))))))),TRUE) * !(E(TRUE U !((((((u6.a==0)||(i1.u2.dr==0))&&((i1.u3.mr==0)||(i0.u4.r_cap==0)))&&((i1.u2.dr_a==0)||(u6.a_cap==0)))&&((((((i2.u1.da_a==1)&&(i2.u5.ma_cap==1))||((i1.u2.dr==1)&&(i1.u3.mr_cap==1)))||(((u6.a==1)&&(i0.u4.r==1))&&(i0.u0.c_cap==1)))||((i1.u2.dr_a==1)&&(i1.u3.mr_cap==1)))||((i1.u2.dr_a==1)&&(u6.a_cap==1))))))))] != FALSE
(forward)formula 10,0,0.07823,5220,1,0,615,20,588,767,52,15,1544
FORMULA CircadianClock-PT-000001-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1620799270961

--------------------
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-000001"
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-000001, 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-162038291300002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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