Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814100305.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814100305
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 65K Apr 27 14:36 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 Dekker-PT-010-00
FORMULA_NAME Dekker-PT-010-01
FORMULA_NAME Dekker-PT-010-02
FORMULA_NAME Dekker-PT-010-03
FORMULA_NAME Dekker-PT-010-04
FORMULA_NAME Dekker-PT-010-05
FORMULA_NAME Dekker-PT-010-06
FORMULA_NAME Dekker-PT-010-07
FORMULA_NAME Dekker-PT-010-08
FORMULA_NAME Dekker-PT-010-09
FORMULA_NAME Dekker-PT-010-10
FORMULA_NAME Dekker-PT-010-11
FORMULA_NAME Dekker-PT-010-12
FORMULA_NAME Dekker-PT-010-13
FORMULA_NAME Dekker-PT-010-14
FORMULA_NAME Dekker-PT-010-15

=== Now, execution of the tool begins

BK_START 1590110754472

[2020-05-22 01:25:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-22 01:25:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:25:56] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2020-05-22 01:25:56] [INFO ] Transformed 50 places.
[2020-05-22 01:25:56] [INFO ] Transformed 120 transitions.
[2020-05-22 01:25:56] [INFO ] Found NUPN structural information;
[2020-05-22 01:25:56] [INFO ] Parsed PT model containing 50 places and 120 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 236 ms. (steps per millisecond=423 ) properties seen :[0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 01:25:56] [INFO ] Flow matrix only has 40 transitions (discarded 80 similar events)
// Phase 1: matrix 40 rows 50 cols
[2020-05-22 01:25:56] [INFO ] Computed 30 place invariants in 4 ms
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 4 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-22 01:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:25:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 7 ms returned unsat
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:56] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2020-05-22 01:25:56] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:25:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-22 01:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2020-05-22 01:25:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2020-05-22 01:25:56] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2020-05-22 01:25:56] [INFO ] Deduced a trap composed of 5 places in 35 ms
[2020-05-22 01:25:57] [INFO ] Deduced a trap composed of 5 places in 12 ms
[2020-05-22 01:25:57] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:25:57] [INFO ] Deduced a trap composed of 4 places in 9 ms
[2020-05-22 01:25:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 94 ms
[2020-05-22 01:25:57] [INFO ] Computed and/alt/rep : 110/300/30 causal constraints in 10 ms.
[2020-05-22 01:25:57] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-05-22 01:25:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:25:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned unsat
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using 20 positive place invariants in 5 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-05-22 01:25:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:25:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 2 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:25:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-05-22 01:25:57] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2020-05-22 01:25:57] [INFO ] Computed and/alt/rep : 110/300/30 causal constraints in 8 ms.
[2020-05-22 01:25:57] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-22 01:25:57] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-22 01:25:57] [INFO ] Flatten gal took : 46 ms
FORMULA Dekker-PT-010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 01:25:57] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:25:57] [INFO ] Applying decomposition
[2020-05-22 01:25:57] [INFO ] Flatten gal took : 21 ms
[2020-05-22 01:25:57] [INFO ] Input system was already deterministic with 120 transitions.
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/graph3287334136364733956.txt, -o, /tmp/graph3287334136364733956.bin, -w, /tmp/graph3287334136364733956.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/graph3287334136364733956.bin, -l, -1, -v, -w, /tmp/graph3287334136364733956.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40 out of 120 initially.
[2020-05-22 01:25:57] [INFO ] Decomposing Gal with order
// Phase 1: matrix 40 rows 50 cols
[2020-05-22 01:25:57] [INFO ] Computed 30 place invariants in 3 ms
inv : flag_1_3 - p1_3 - p3_3 = 0
inv : flag_0_1 + p1_1 + p3_1 = 1
inv : flag_1_6 - p1_6 - p3_6 = 0
inv : p0_4 + p1_4 + p34 = 1
inv : p0_1 + p1_1 + p3_1 = 1
inv : flag_0_4 + p1_4 + p34 = 1
inv : flag_1_0 - p1_0 - p3_0 = 0
inv : flag_0_9 + p1_9 + p3_9 = 1
inv : flag_0_6 + p1_6 + p3_6 = 1
inv : flag_0_7 + p1_7 + p3_7 = 1
inv : p0_5 + p1_5 + p3_5 = 1
inv : flag_1_8 - p1_8 - p3_8 = 0
inv : flag_1_4 - p1_4 - p34 = 0
inv : flag_0_5 + p1_5 + p3_5 = 1
inv : p0_0 + p1_0 + p3_0 = 1
inv : p0_3 + p1_3 + p3_3 = 1
inv : flag_1_7 - p1_7 - p3_7 = 0
inv : p0_9 + p1_9 + p3_9 = 1
inv : flag_1_2 - p1_2 - p3_2 = 0
inv : flag_0_0 + p1_0 + p3_0 = 1
inv : flag_0_2 + p1_2 + p3_2 = 1
inv : p0_6 + p1_6 + p3_6 = 1
inv : flag_0_8 + p1_8 + p3_8 = 1
inv : flag_0_3 + p1_3 + p3_3 = 1
inv : flag_1_1 - p1_1 - p3_1 = 0
inv : p0_2 + p1_2 + p3_2 = 1
inv : p0_8 + p1_8 + p3_8 = 1
inv : flag_1_9 - p1_9 - p3_9 = 0
inv : flag_1_5 - p1_5 - p3_5 = 0
inv : p0_7 + p1_7 + p3_7 = 1
Total of 30 invariants.
[2020-05-22 01:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:25:57] [INFO ] Computed 30 place invariants in 6 ms
[2020-05-22 01:25:57] [INFO ] Removed a total of 276 redundant transitions.
[2020-05-22 01:25:57] [INFO ] Proved 50 variables to be positive in 98 ms
[2020-05-22 01:25:57] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2020-05-22 01:25:57] [INFO ] Computation of disable matrix completed :0/120 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:25:57] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 01:25:57] [INFO ] Flatten gal took : 82 ms
[2020-05-22 01:25:57] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2020-05-22 01:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2020-05-22 01:25:57] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-22 01:25:57] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 1 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]
[2020-05-22 01:25:57] [INFO ] Computation of Complete enable matrix. took 7 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 10 LTL properties
Checking formula 0 : !((X("((u4.p1_4!=0)&&(i5.u13.p1_9!=1))")))
Formula 0 simplified : !X"((u4.p1_4!=0)&&(i5.u13.p1_9!=1))"
built 46 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u1.exit_1, u3.exit_3, u4.exit_4, u5.exit_5, u7.exit_8, u12.exit_7, i5.exit_9, i6.exit_0, i7.exit_2, i8.exit_6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/10/120
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
2 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.051926,17028,1,0,2086,101,1267,1529,241,142,4013
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F((("(u5.p1_5==1)")&&(G(F("((u12.p3_7==0)||(u5.p0_5==1))"))))&&("((i8.u11.p3_6==0)||(i7.u10.p0_2==1))")))))
Formula 1 simplified : !XF("((i8.u11.p3_6==0)||(i7.u10.p0_2==1))" & "(u5.p1_5==1)" & GF"((u12.p3_7==0)||(u5.p0_5==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.062305,18612,1,0,2786,101,1361,2442,247,142,5980
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(X(G(X(G(!(G("((((i7.u2.flag_0_2==0)||(i5.u13.p3_9==1))||(u5.p3_5==0))||(u4.flag_0_4==1))")))))))))
Formula 2 simplified : !GXGXG!G"((((i7.u2.flag_0_2==0)||(i5.u13.p3_9==1))||(u5.p3_5==0))||(u4.flag_0_4==1))"
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.066325,18800,1,0,2997,101,1462,2719,248,142,6448
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((G(F(((G((F("(u4.flag_0_4==1)"))U(("((u12.p3_7==0)||(u3.flag_0_3==1))")U(("(u4.flag_0_4==1)")U("((u7.flag_1_8==0)||(u5.p0_5==1))")))))||("(u12.p3_7==0)"))||("(u3.flag_0_3==1)")))))
Formula 3 simplified : !GF("(u3.flag_0_3==1)" | "(u12.p3_7==0)" | G(F"(u4.flag_0_4==1)" U ("((u12.p3_7==0)||(u3.flag_0_3==1))" U ("(u4.flag_0_4==1)" U "((u7.flag_1_8==0)||(u5.p0_5==1))"))))
2 unique states visited
2 strongly connected components in search stack
3 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.078868,19936,1,0,3346,101,1686,3199,251,142,7568
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(X((("((u4.p34==0)||(u12.flag_0_7==1))")U(X(!(G("((u4.p34==0)||(u12.flag_0_7==1))")))))U(G("((u3.p0_3==0)||(i8.u11.p0_6==1))"))))))
Formula 4 simplified : !FX(("((u4.p34==0)||(u12.flag_0_7==1))" U X!G"((u4.p34==0)||(u12.flag_0_7==1))") U G"((u3.p0_3==0)||(i8.u11.p0_6==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.095928,20692,1,0,5347,101,1800,6131,251,142,12527
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(X(F(X("(u7.p1_8==1)")))))))
Formula 5 simplified : GXFX"(u7.p1_8==1)"
2 unique states visited
1 strongly connected components in search stack
3 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.09804,20956,1,0,5408,101,1836,6232,251,142,12722
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(!(("((u5.p1_5==0)||(u1.p3_1==1))")U(F("((i8.u6.flag_1_6==0)||(i5.u13.p0_9==1))"))))))
Formula 6 simplified : !X!("((u5.p1_5==0)||(u1.p3_1==1))" U F"((i8.u6.flag_1_6==0)||(i5.u13.p0_9==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.09976,21208,1,0,5431,101,1867,6257,251,142,12855
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(F(X(X("((i6.u9.p0_0==0)||(u4.p1_4==1))"))))))
Formula 7 simplified : !XFXX"((i6.u9.p0_0==0)||(u4.p1_4==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.107399,21208,1,0,5888,101,1980,6911,251,142,13916
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((F(("((u7.p3_8!=0)&&(i8.u11.p3_6!=1))")&&((F("((i6.u0.flag_0_0==0)||(u7.p3_8==1))"))||(X(X("((i7.u2.flag_1_2==0)||(u4.flag_0_4==1))")))))))
Formula 8 simplified : !F("((u7.p3_8!=0)&&(i8.u11.p3_6!=1))" & (F"((i6.u0.flag_0_0==0)||(u7.p3_8==1))" | XX"((i7.u2.flag_1_2==0)||(u4.flag_0_4==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.110551,21728,1,0,6041,101,2026,7121,253,142,14502
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((X("((u7.p1_8==0)||(i6.u9.p0_0==1))"))||(F("((u7.flag_1_8==0)||(u12.p1_7==1))")))))
Formula 9 simplified : !G(X"((u7.p1_8==0)||(i6.u9.p0_0==1))" | F"((u7.flag_1_8==0)||(u12.p1_7==1))")
4 unique states visited
4 strongly connected components in search stack
5 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.112713,21728,1,0,6127,101,2050,7297,254,142,14830
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 01:25:58] [INFO ] Computing symmetric co enabling matrix : 120 transitions.
[2020-05-22 01:26:00] [INFO ] Computation of co-enabling matrix(46/120) took 1907 ms. Total solver calls (SAT/UNSAT): 1752(1044/708)
[2020-05-22 01:26:03] [INFO ] Computation of Finished co-enabling matrix. took 4320 ms. Total solver calls (SAT/UNSAT): 2910(1755/1155)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:460)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:574)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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-22 01:26:03] [INFO ] Built C files in 5731ms 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 1590110763502

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Dekker-PT-010"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-010, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814100305"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;