Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r036-smll-158901930500002.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CircadianClock-PT-000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930500002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.0K Apr 13 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 13 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 13 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 11K Apr 13 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 15:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 13 13:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 13 13:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 13 13:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 13 13:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 13 13:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 13 13:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 12K Mar 24 05:37 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-00
FORMULA_NAME CircadianClock-PT-000001-01
FORMULA_NAME CircadianClock-PT-000001-02
FORMULA_NAME CircadianClock-PT-000001-03
FORMULA_NAME CircadianClock-PT-000001-04
FORMULA_NAME CircadianClock-PT-000001-05
FORMULA_NAME CircadianClock-PT-000001-06
FORMULA_NAME CircadianClock-PT-000001-07
FORMULA_NAME CircadianClock-PT-000001-08
FORMULA_NAME CircadianClock-PT-000001-09
FORMULA_NAME CircadianClock-PT-000001-10
FORMULA_NAME CircadianClock-PT-000001-11
FORMULA_NAME CircadianClock-PT-000001-12
FORMULA_NAME CircadianClock-PT-000001-13
FORMULA_NAME CircadianClock-PT-000001-14
FORMULA_NAME CircadianClock-PT-000001-15

=== Now, execution of the tool begins

BK_START 1589641074799

[2020-05-16 14:57:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-16 14:57:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 14:57:58] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-16 14:57:58] [INFO ] Transformed 14 places.
[2020-05-16 14:57:58] [INFO ] Transformed 16 transitions.
[2020-05-16 14:57:58] [INFO ] Found NUPN structural information;
[2020-05-16 14:57:58] [INFO ] Parsed PT model containing 14 places and 16 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 34 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 73 steps, including 0 resets, run visited all 27 properties in 7 ms. (steps per millisecond=10 )
[2020-05-16 14:57:58] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2020-05-16 14:57:58] [INFO ] Flatten gal took : 51 ms
FORMULA CircadianClock-PT-000001-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000001-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 14:57:58] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 14:57:58] [INFO ] Applying decomposition
[2020-05-16 14:57:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph4043823437724850446.txt, -o, /tmp/graph4043823437724850446.bin, -w, /tmp/graph4043823437724850446.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph4043823437724850446.bin, -l, -1, -v, -w, /tmp/graph4043823437724850446.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 14:57:58] [INFO ] Input system was already deterministic with 16 transitions.
[2020-05-16 14:57:58] [INFO ] Decomposing Gal with order
[2020-05-16 14:57:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 14:57:58] [INFO ] Removed a total of 7 redundant transitions.
[2020-05-16 14:57:59] [INFO ] Flatten gal took : 57 ms
[2020-05-16 14:57:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2020-05-16 14:57:59] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-16 14:57:59] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 4 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.

Normalized transition count is 14 out of 16 initially.
// Phase 1: matrix 14 rows 14 cols
[2020-05-16 14:57:59] [INFO ] Computed 7 place invariants in 10 ms
inv : dr + dr_a = 1
inv : mr + mr_cap = 1
inv : c + c_cap = 1
inv : da + da_a = 1
inv : r + r_cap = 1
inv : a + a_cap = 1
inv : ma + ma_cap = 1
Total of 7 invariants.
[2020-05-16 14:57:59] [INFO ] Computed 7 place invariants in 14 ms
its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 14 LTL properties
Checking formula 0 : !((!(F(G((("(i0.u2.mr!=1)")U("((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))"))&&(F(G(F("((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))")))))))))
Formula 0 simplified : FG(("(i0.u2.mr!=1)" U "((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))") & FGF"((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))")
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
built 4 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.038982,16744,1,0,222,18,210,304,44,15,659
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(!(F((!(X("((((i0.u1.dr==1)&&(i0.u2.mr_cap==1))&&((u6.a!=1)||(i2.u0.da!=1)))&&(i1.u3.r==1))")))||("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))")))))))
Formula 1 simplified : !XX!F("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))" | !X"((((i0.u1.dr==1)&&(i0.u2.mr_cap==1))&&((u6.a!=1)||(i2.u0.da!=1)))&&(i1.u3.r==1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.044756,17236,1,0,297,18,253,360,44,15,907
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X((!(X("((i1.u5.c==1)&&(i1.u3.r_cap==1))")))&&(!(F(((X(("((i0.u2.mr==1)&&(i1.u3.r_cap==1))")U(F("((i1.u5.c==1)&&(i1.u3.r_cap==1))"))))||("(u6.a==1)"))||("((i0.u1.dr_a==1)&&(u6.a_cap==1))")))))))
Formula 2 simplified : !X(!X"((i1.u5.c==1)&&(i1.u3.r_cap==1))" & !F("((i0.u1.dr_a==1)&&(u6.a_cap==1))" | "(u6.a==1)" | X("((i0.u2.mr==1)&&(i1.u3.r_cap==1))" U F"((i1.u5.c==1)&&(i1.u3.r_cap==1))")))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.051289,18020,1,0,321,18,303,393,46,15,1116
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((((F("((i0.u1.dr_a==1)&&(u6.a_cap==1))"))&&("((i2.u0.da_a!=1)||(u6.a_cap!=1))"))&&((F(X(X("((i0.u1.dr_a==1)&&(u6.a_cap==1))"))))||("(u6.a==1)")))U(G("((i0.u1.dr_a==1)&&(u6.a_cap==1))"))))
Formula 3 simplified : !(("((i2.u0.da_a!=1)||(u6.a_cap!=1))" & F"((i0.u1.dr_a==1)&&(u6.a_cap==1))" & ("(u6.a==1)" | FXX"((i0.u1.dr_a==1)&&(u6.a_cap==1))")) U G"((i0.u1.dr_a==1)&&(u6.a_cap==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.060033,18472,1,0,420,18,362,500,47,15,1440
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((((G("(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))"))U("(i0.u2.mr==1)"))||("(i0.u2.mr==1)"))U(F("(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))"))))
Formula 4 simplified : !(("(i0.u2.mr==1)" | (G"(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))" U "(i0.u2.mr==1)")) U F"(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.06285,18472,1,0,524,18,386,624,47,15,1684
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G((X("(i0.u2.mr==1)"))U(X(F("((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))")))))&&(X("(i0.u2.mr!=1)")))))
Formula 5 simplified : !F(G(X"(i0.u2.mr==1)" U XF"((i2.u0.da_a==1)&&(i2.u4.ma_cap==1))") & X"(i0.u2.mr!=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.066215,18604,1,0,575,18,398,678,47,15,1812
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(((F((G("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))"))||("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))")))||(G("((i0.u2.mr==1)&&(i1.u3.r_cap==1))")))||("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))"))))
Formula 6 simplified : !X("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))" | F("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))" | G"((i0.u1.dr==1)&&(i0.u2.mr_cap==1))") | G"((i0.u2.mr==1)&&(i1.u3.r_cap==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.071013,18804,1,0,710,18,441,869,47,15,2199
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F(X((X(G(F(G(X(X(X("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))"))))))))||("((i0.u1.dr_a==1)&&(u6.a_cap==1))"))))))
Formula 7 simplified : !GFX("((i0.u1.dr_a==1)&&(u6.a_cap==1))" | XGFGXXX"((i0.u1.dr==1)&&(i0.u2.mr_cap==1))")
5 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.075596,19008,1,0,726,18,461,897,47,15,2274
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((X(G(X((X("((i2.u4.ma==1)&&(u6.a_cap==1))"))||("((u6.a==1)&&(i2.u0.da==1))")))))||(F(X("((i0.u1.dr==1)&&(i0.u2.mr_cap==1))")))))
Formula 8 simplified : !(XGX("((u6.a==1)&&(i2.u0.da==1))" | X"((i2.u4.ma==1)&&(u6.a_cap==1))") | FX"((i0.u1.dr==1)&&(i0.u2.mr_cap==1))")
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.080097,19008,1,0,816,18,524,1015,49,15,2570
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(("((i2.u0.da_a!=1)||(u6.a_cap!=1))")U("((i2.u0.da==1)&&(i2.u4.ma_cap==1))")))))
Formula 9 simplified : !GF("((i2.u0.da_a!=1)||(u6.a_cap!=1))" U "((i2.u0.da==1)&&(i2.u4.ma_cap==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.081335,19008,1,0,819,18,539,1019,49,15,2591
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((!(("((u6.a==1)&&(i0.u1.dr==1))")U((((F("((i0.u1.dr_a==1)&&(u6.a_cap==1))"))||("(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))"))&&("(i0.u1.dr==1)"))&&("(i0.u2.mr_cap==1)")))))
Formula 10 simplified : "((u6.a==1)&&(i0.u1.dr==1))" U ("(i0.u1.dr==1)" & "(i0.u2.mr_cap==1)" & ("(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))" | F"((i0.u1.dr_a==1)&&(u6.a_cap==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.08885,19140,1,0,948,18,616,1180,49,15,2941
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((F(!(X(X(X(X("(i1.u3.r==1)")))))))&&(X(F("(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))")))))
Formula 11 simplified : !(F!XXXX"(i1.u3.r==1)" & XF"(((u6.a==1)&&(i1.u3.r==1))&&(i1.u5.c_cap==1))")
[2020-05-16 14:57:59] [INFO ] Proved 14 variables to be positive in 162 ms
[2020-05-16 14:57:59] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2020-05-16 14:57:59] [INFO ] Computation of disable matrix completed :0/16 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:57:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:57:59] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2020-05-16 14:57:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.090474,19140,1,0,948,18,616,1182,49,15,2949
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((F((("((i0.u1.dr_a==1)&&(u6.a_cap==1))")U("(i2.u4.ma==1)"))U(G("((i0.u1.dr_a==1)&&(u6.a_cap==1))")))))
Formula 12 simplified : !F(("((i0.u1.dr_a==1)&&(u6.a_cap==1))" U "(i2.u4.ma==1)") U G"((i0.u1.dr_a==1)&&(u6.a_cap==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.099127,19140,1,0,1289,18,632,1598,49,15,3488
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F(!(F("((u6.a!=1)||(i2.u0.da!=1))")))))
Formula 13 simplified : !F!F"((u6.a!=1)||(i2.u0.da!=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.104602,19380,1,0,1556,18,649,1879,49,15,3960
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-16 14:57:59] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-16 14:57:59] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-16 14:57:59] [WARNING] Script execution failed on command (assert (and (>= (select s0 7) 1) (= (store (store s0 10 (+ (select s0 10) 1)) 7 (- (select s0 7) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 7) 1) (= (store (store s0 10 (+ (select s0 10) 1)) 7 (- (select s0 7) 1)) s1))")
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 14:57:59] [INFO ] Built C files in 382ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589641082561

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r036-smll-158901930500002"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;