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-158901930500010.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-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r036-smll-158901930500010
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.4K Mar 30 00:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 00:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 28 15:16 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.6K Apr 8 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 08:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 26 07:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 26 07:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 28 14:49 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 11K 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-000010-00
FORMULA_NAME CircadianClock-PT-000010-01
FORMULA_NAME CircadianClock-PT-000010-02
FORMULA_NAME CircadianClock-PT-000010-03
FORMULA_NAME CircadianClock-PT-000010-04
FORMULA_NAME CircadianClock-PT-000010-05
FORMULA_NAME CircadianClock-PT-000010-06
FORMULA_NAME CircadianClock-PT-000010-07
FORMULA_NAME CircadianClock-PT-000010-08
FORMULA_NAME CircadianClock-PT-000010-09
FORMULA_NAME CircadianClock-PT-000010-10
FORMULA_NAME CircadianClock-PT-000010-11
FORMULA_NAME CircadianClock-PT-000010-12
FORMULA_NAME CircadianClock-PT-000010-13
FORMULA_NAME CircadianClock-PT-000010-14
FORMULA_NAME CircadianClock-PT-000010-15

=== Now, execution of the tool begins

BK_START 1589641178594

[2020-05-16 14:59:41] [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:59:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 14:59:41] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-05-16 14:59:41] [INFO ] Transformed 14 places.
[2020-05-16 14:59:41] [INFO ] Transformed 16 transitions.
[2020-05-16 14:59:41] [INFO ] Parsed PT model containing 14 places and 16 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 132 steps, including 0 resets, run visited all 34 properties in 4 ms. (steps per millisecond=33 )
[2020-05-16 14:59:41] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-16 14:59:41] [INFO ] Flatten gal took : 36 ms
FORMULA CircadianClock-PT-000010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-000010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 14:59:41] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 14:59:42] [INFO ] Applying decomposition
[2020-05-16 14:59:42] [INFO ] Flatten gal took : 6 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/graph6859453220144256907.txt, -o, /tmp/graph6859453220144256907.bin, -w, /tmp/graph6859453220144256907.weights], workingDir=null]
[2020-05-16 14:59:42] [INFO ] Input system was already deterministic with 16 transitions.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph6859453220144256907.bin, -l, -1, -v, -w, /tmp/graph6859453220144256907.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 14:59:42] [INFO ] Decomposing Gal with order
[2020-05-16 14:59:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 14:59:42] [INFO ] Removed a total of 7 redundant transitions.
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:59:42] [INFO ] Computed 7 place invariants in 5 ms
inv : dr + dr_a = 1
inv : mr + mr_cap = 10
inv : c + c_cap = 10
inv : da + da_a = 1
inv : r + r_cap = 10
inv : a + a_cap = 10
inv : ma + ma_cap = 10
Total of 7 invariants.
[2020-05-16 14:59:42] [INFO ] Computed 7 place invariants in 10 ms
[2020-05-16 14:59:42] [INFO ] Flatten gal took : 89 ms
[2020-05-16 14:59:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 18 ms.
[2020-05-16 14:59:42] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 3 ms
[2020-05-16 14:59:42] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 14 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]
[2020-05-16 14:59:42] [INFO ] Proved 14 variables to be positive in 144 ms

[2020-05-16 14:59:42] [INFO ] Computing symmetric may disable matrix : 16 transitions.
[2020-05-16 14:59:42] [INFO ] Computation of disable matrix completed :0/16 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:59:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-16 14:59:42] [INFO ] Computing symmetric may enable matrix : 16 transitions.
[2020-05-16 14:59:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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 12 LTL properties
Checking formula 0 : !((G(F(((!(G(F(X("((u0.a>=1)&&(i3.u5.mr>=1))")))))||("(i1.u2.da_a<1)"))||("(i1.u6.ma_cap<1)")))))
Formula 0 simplified : !GF("(i1.u2.da_a<1)" | "(i1.u6.ma_cap<1)" | !GFX"((u0.a>=1)&&(i3.u5.mr>=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
5 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.081206,17520,1,0,1414,378,206,2093,74,1367,2003
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(((!(F("(i3.u5.mr>=1)")))&&("((i3.u3.dr<1)||(i3.u5.mr_cap<1))"))||(!(X(X("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))")))))))
Formula 1 simplified : !X(("((i3.u3.dr<1)||(i3.u5.mr_cap<1))" & !F"(i3.u5.mr>=1)") | !XX"((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))")
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.097401,18108,1,0,2234,398,240,3141,75,1564,3349
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((((F("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))&&("(i1.u2.da>=1)"))&&("(i1.u6.ma_cap>=1)"))U(G((G("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))&&(X(F(X(G("(u0.a>=1)")))))))))
Formula 2 simplified : !(("(i1.u2.da>=1)" & "(i1.u6.ma_cap>=1)" & F"((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))") U G(G"((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))" & XFXG"(u0.a>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
3 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.130139,20140,1,0,3663,460,284,5407,75,2124,4862
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((!(G("((i3.u3.dr_a>=1)&&(u0.a_cap>=1))")))||("((i3.u3.dr_a>=1)&&(i3.u5.mr_cap>=1))"))))
Formula 3 simplified : !X("((i3.u3.dr_a>=1)&&(i3.u5.mr_cap>=1))" | !G"((i3.u3.dr_a>=1)&&(u0.a_cap>=1))")
2 unique states visited
0 strongly connected components in search stack
1 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.131098,20140,1,0,3663,460,301,5407,75,2124,4873
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA CircadianClock-PT-000010-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F((F(!(F(("((i1.u2.da<1)||(i1.u6.ma_cap<1))")U(G("(u0.a>=1)"))))))U(X("((i1.u2.da>=1)&&(i1.u6.ma_cap>=1))")))))
Formula 4 simplified : !F(F!F("((i1.u2.da<1)||(i1.u6.ma_cap<1))" U G"(u0.a>=1)") U X"((i1.u2.da>=1)&&(i1.u6.ma_cap>=1))")
2 unique states visited
0 strongly connected components in search stack
1 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.131901,20140,1,0,3663,460,319,5407,75,2124,4883
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA CircadianClock-PT-000010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((G(!(X((!(F((X(X("((i1.u2.da_a>=1)&&(i1.u6.ma_cap>=1))")))&&("((u0.a<1)||(i3.u3.dr<1))"))))&&(!(G(F("((i1.u2.da>=1)&&(i1.u6.ma_cap>=1))")))))))))
Formula 5 simplified : !G!X(!F("((u0.a<1)||(i3.u3.dr<1))" & XX"((i1.u2.da_a>=1)&&(i1.u6.ma_cap>=1))") & !GF"((i1.u2.da>=1)&&(i1.u6.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.137373,20140,1,0,3727,460,337,5496,75,2135,5025
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !(((!(X(G((G("((i3.u3.dr_a>=1)&&(u0.a_cap>=1))"))U(G("((u0.a>=1)&&(i3.u3.dr>=1))"))))))&&(!(G(F(("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))")U("((i3.u3.dr<1)||(i3.u5.mr_cap<1))")))))))
Formula 6 simplified : !(!XG(G"((i3.u3.dr_a>=1)&&(u0.a_cap>=1))" U G"((u0.a>=1)&&(i3.u3.dr>=1))") & !GF("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))" U "((i3.u3.dr<1)||(i3.u5.mr_cap<1))"))
4 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.14287,20140,1,0,3796,461,360,5611,75,2145,5370
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !(((X(!(X(F((F("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))&&(X("((u0.a>=1)&&(i1.u2.da>=1))")))))))&&((!(G("((i0.u1.c>=1)&&(i0.u4.r_cap>=1))")))U("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))))
Formula 7 simplified : !(X!XF(F"((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))" & X"((u0.a>=1)&&(i1.u2.da>=1))") & (!G"((i0.u1.c>=1)&&(i0.u4.r_cap>=1))" U "((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))
6 unique states visited
6 strongly connected components in search stack
7 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.147894,20140,1,0,3843,461,374,5665,75,2149,5494
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !(((F(X("((i1.u2.da>=1)&&(i1.u6.ma_cap>=1))")))&&(G(F(((X(X("((i3.u5.mr>=1)&&(i0.u4.r_cap>=1))")))||("(u0.a<1)"))||("(i1.u2.da<1)"))))))
Formula 8 simplified : !(FX"((i1.u2.da>=1)&&(i1.u6.ma_cap>=1))" & GF("(i1.u2.da<1)" | "(u0.a<1)" | XX"((i3.u5.mr>=1)&&(i0.u4.r_cap>=1))"))
5 unique states visited
5 strongly connected components in search stack
6 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.152139,20140,1,0,3909,461,394,5748,75,2149,5605
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((X((G("((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))"))||("((i3.u3.dr_a>=1)&&(u0.a_cap>=1))"))))
Formula 9 simplified : !X("((i3.u3.dr_a>=1)&&(u0.a_cap>=1))" | G"((i3.u3.dr>=1)&&(i3.u5.mr_cap>=1))")
5 unique states visited
5 strongly connected components in search stack
5 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.160514,20368,1,0,4407,464,401,6297,75,2170,6027
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F((G("(((i1.u2.da_a>=1)&&(u0.a_cap>=1))||((((u0.a>=1)&&(i0.u4.r>=1))&&(i0.u1.c_cap>=1))&&((i1.u2.da_a<1)||(u0.a_cap<1))))"))U(X("(u0.a>=1)")))))
Formula 10 simplified : !F(G"(((i1.u2.da_a>=1)&&(u0.a_cap>=1))||((((u0.a>=1)&&(i0.u4.r>=1))&&(i0.u1.c_cap>=1))&&((i1.u2.da_a<1)||(u0.a_cap<1))))" U X"(u0.a>=1)")
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.162487,20368,1,0,4460,464,419,6391,75,2170,6251
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(F(G(F(G(((!(F(X(((X("(((u0.a>=1)&&(i0.u4.r>=1))&&(i0.u1.c_cap>=1))"))&&("(u0.a>=1)"))&&("(i1.u2.da>=1)")))))||("(i0.u1.c<1)"))||("(i0.u4.r_cap<1)"))))))))
Formula 11 simplified : !XFGFG("(i0.u1.c<1)" | "(i0.u4.r_cap<1)" | !FX("(i1.u2.da>=1)" & "(u0.a>=1)" & X"(((u0.a>=1)&&(i0.u4.r>=1))&&(i0.u1.c_cap>=1))"))
5 unique states visited
5 strongly connected components in search stack
6 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.173475,20632,1,0,4630,464,476,6665,81,2203,6555
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircadianClock-PT-000010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
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:59:42] [INFO ] Built C files in 528ms 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 1589641183818

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

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