Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972913900337.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 SafeBus-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913900337
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.2K Apr 12 12:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 12:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 11 13:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 11 13:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 17:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 17:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 9 23:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Apr 9 23:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 42K Mar 24 05:38 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 SafeBus-COL-03-00
FORMULA_NAME SafeBus-COL-03-01
FORMULA_NAME SafeBus-COL-03-02
FORMULA_NAME SafeBus-COL-03-03
FORMULA_NAME SafeBus-COL-03-04
FORMULA_NAME SafeBus-COL-03-05
FORMULA_NAME SafeBus-COL-03-06
FORMULA_NAME SafeBus-COL-03-07
FORMULA_NAME SafeBus-COL-03-08
FORMULA_NAME SafeBus-COL-03-09
FORMULA_NAME SafeBus-COL-03-10
FORMULA_NAME SafeBus-COL-03-11
FORMULA_NAME SafeBus-COL-03-12
FORMULA_NAME SafeBus-COL-03-13
FORMULA_NAME SafeBus-COL-03-14
FORMULA_NAME SafeBus-COL-03-15

=== Now, execution of the tool begins

BK_START 1589890942399

[2020-05-19 12:22:24] [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-19 12:22:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 12:22:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-05-19 12:22:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 558 ms
[2020-05-19 12:22:24] [INFO ] sort/places :
Dom->AMC,wait_ack,
Dot->cable_free,ACK,T_out,R_tout,S_tout,FMCb,
It->Cpt2,Cpt1,msgl,cable_used,FMC,wait_cable,listen,RMC,PMC,MSG,wait_msg,loop_em,

[2020-05-19 12:22:24] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2020-05-19 12:22:24] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 21 ms.
[2020-05-19 12:22:24] [INFO ] Computed order based on color domains.
[2020-05-19 12:22:24] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 9 ms.
[2020-05-19 12:22:24] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 228 ms. (steps per millisecond=438 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1]
[2020-05-19 12:22:24] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2020-05-19 12:22:24] [INFO ] Computed 17 place invariants in 5 ms
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2020-05-19 12:22:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-19 12:22:25] [INFO ] [Real]Added 13 Read/Feed constraints in 7 ms returned sat
[2020-05-19 12:22:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 9 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 7 ms returned sat
[2020-05-19 12:22:25] [INFO ] Deduced a trap composed of 16 places in 40 ms
[2020-05-19 12:22:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 62 ms
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 37 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 27 ms returned unsat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 12:22:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Real]Added 13 Read/Feed constraints in 20 ms returned sat
[2020-05-19 12:22:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 52 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 12:22:25] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2020-05-19 12:22:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2020-05-19 12:22:25] [INFO ] Deduced a trap composed of 7 places in 105 ms
[2020-05-19 12:22:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-19 12:22:25] [INFO ] Computed and/alt/rep : 88/600/65 causal constraints in 5 ms.
[2020-05-19 12:22:26] [INFO ] Added : 65 causal constraints over 13 iterations in 238 ms. Result :sat
[2020-05-19 12:22:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2020-05-19 12:22:26] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 1 ms returned unsat
[2020-05-19 12:22:26] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2020-05-19 12:22:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
[2020-05-19 12:22:26] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-19 12:22:26] [INFO ] Flatten gal took : 37 ms
FORMULA SafeBus-COL-03-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 12:22:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2020-05-19 12:22:26] [INFO ] Flatten gal took : 11 ms
[2020-05-19 12:22:26] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SafeBus-COL-03-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Using solver Z3 to compute partial order matrices.
[2020-05-19 12:22:26] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-19 12:22:26] [INFO ] Flatten gal took : 10 ms
[2020-05-19 12:22:26] [INFO ] Input system was already deterministic with 91 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/graph16369705871933079670.txt, -o, /tmp/graph16369705871933079670.bin, -w, /tmp/graph16369705871933079670.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/graph16369705871933079670.bin, -l, -1, -v, -w, /tmp/graph16369705871933079670.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 12:22:26] [INFO ] Decomposing Gal with order
[2020-05-19 12:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 68 out of 91 initially.
// Phase 1: matrix 68 rows 54 cols
[2020-05-19 12:22:26] [INFO ] Computed 17 place invariants in 2 ms
inv : AMC_3 + AMC_4 + AMC_5 + wait_ack_3 + wait_ack_5 + listen_1 + RMC_1 + PMC_1 + wait_msg_1 + loop_em_1 = 1
inv : cable_used_1 - FMC_1 - wait_ack_3 - wait_ack_5 - PMC_1 = 0
inv : R_tout_0 + S_tout_0 = 1
inv : AMC_6 + AMC_7 + AMC_8 + wait_ack_6 + wait_ack_7 + listen_2 + RMC_2 + PMC_2 + wait_msg_2 + loop_em_2 = 1
inv : cable_used_0 + FMC_1 + FMC_2 + wait_ack_3 + wait_ack_5 + wait_ack_6 + wait_ack_7 - ACK_0 - PMC_0 - MSG_0 - MSG_1 - MSG_2 - T_out_0 + FMCb_0 = 1
inv : AMC_0 + AMC_1 + AMC_2 - wait_ack_3 - wait_ack_5 - wait_ack_6 - wait_ack_7 + listen_0 + RMC_0 + ACK_0 + PMC_0 + MSG_0 + MSG_1 + MSG_2 + T_out_0 + wait_msg_0 + loop_em_0 = 1
inv : cable_free_0 + ACK_0 + PMC_0 + PMC_1 + PMC_2 + MSG_0 + MSG_1 + MSG_2 + T_out_0 - FMCb_0 = 0
inv : wait_ack_6 + wait_ack_7 + wait_cable_2 + listen_2 + wait_msg_2 + loop_em_2 = 1
inv : Cpt2_0 + Cpt1_1 + Cpt1_2 - AMC_0 + AMC_2 - AMC_3 + AMC_5 - AMC_6 + AMC_8 = 1
inv : Cpt2_1 - Cpt1_1 + AMC_0 - AMC_1 + 2*AMC_3 + AMC_5 + AMC_6 - AMC_7 + wait_ack_3 + wait_ack_5 + listen_1 + RMC_1 + PMC_1 + wait_msg_1 + loop_em_1 = 1
inv : wait_ack_3 + wait_ack_5 + wait_cable_1 + listen_1 + wait_msg_1 + loop_em_1 = 1
inv : Cpt1_0 + Cpt1_1 + Cpt1_2 = 1
inv : Cpt2_2 - Cpt1_2 + AMC_1 - AMC_2 - AMC_3 - 2*AMC_5 + AMC_7 - AMC_8 - wait_ack_3 - wait_ack_5 - listen_1 - RMC_1 - PMC_1 - wait_msg_1 - loop_em_1 = -1
inv : wait_ack_1 + wait_ack_2 + wait_ack_3 + wait_ack_5 + wait_ack_6 + wait_ack_7 - ACK_0 - MSG_0 - MSG_1 - MSG_2 - T_out_0 = 0
inv : -wait_ack_3 - wait_ack_5 - wait_ack_6 - wait_ack_7 + wait_cable_0 + listen_0 + ACK_0 + MSG_0 + MSG_1 + MSG_2 + T_out_0 + wait_msg_0 + loop_em_0 = 1
inv : FMC_0 + FMC_1 + FMC_2 + FMCb_0 = 1
inv : cable_used_2 - FMC_2 - wait_ack_6 - wait_ack_7 - PMC_2 = 0
Total of 17 invariants.
[2020-05-19 12:22:26] [INFO ] Computed 17 place invariants in 3 ms
[2020-05-19 12:22:26] [INFO ] Removed a total of 137 redundant transitions.
[2020-05-19 12:22:26] [INFO ] Flatten gal took : 59 ms
[2020-05-19 12:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 6 ms.
[2020-05-19 12:22:26] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 2 ms
[2020-05-19 12:22:26] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 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, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

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 --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !(((!(X(X("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))"))))&&(!(G("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")))))
Formula 0 simplified : !(!XX"(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))" & !G"(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")
[2020-05-19 12:22:26] [INFO ] Proved 54 variables to be positive in 199 ms
[2020-05-19 12:22:26] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2020-05-19 12:22:26] [INFO ] Computation of disable matrix completed :0/91 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 12:22:26] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 12:22:26] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2020-05-19 12:22:26] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions gu2.I_reemitr0i1, gu2.I_reemitr0i2, gu2.I_reemitr1i0, gu2.I_reemitr1i2, gu2.I_reemitr2i0, gu2.I_reemitr2i1, C_freei0, C_freei1, C_freei2, I_rec1r0, I_rec1r1, I_rec1r2, loss_mr2, I_rec2r0, I_rec2r1, I_rec2r2, I_ask2i0x0, I_ask2i0x1, I_ask2i0x2, I_ask2i1x0, I_ask2i1x1, I_ask2i1x2, I_ask2i2x0, I_ask2i2x1, I_ask2i2x2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/23/25/48
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
44 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.470672,31972,1,0,130,80899,116,51,2025,57545,110
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SafeBus-COL-03-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((F("(gi3.gu3.S_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))"))U(G(!(F(X((!(G("(((gu2.wait_cable_0+gu2.wait_cable_1)+gu2.wait_cable_2)<=((gu2.MSG_0+gu2.MSG_1)+gu2.MSG_2))")))||("(((gi3.gu4.PMC_0+gi3.gu4.PMC_1)+gi3.gu4.PMC_2)>=1)"))))))))
Formula 1 simplified : !(F"(gi3.gu3.S_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))" U G!FX("(((gi3.gu4.PMC_0+gi3.gu4.PMC_1)+gi3.gu4.PMC_2)>=1)" | !G"(((gu2.wait_cable_0+gu2.wait_cable_1)+gu2.wait_cable_2)<=((gu2.MSG_0+gu2.MSG_1)+gu2.MSG_2))"))
5 unique states visited
2 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
33 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.806355,43920,1,0,166,131174,142,63,2108,106010,202
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA SafeBus-COL-03-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!((!(F(X("(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)"))))U(G("(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)")))))
Formula 2 simplified : !FX"(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)" U G"(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.806979,43920,1,0,166,131174,151,63,2112,106010,206
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA SafeBus-COL-03-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((F((F(G("(gi3.gu3.S_tout_0<=gi3.gu3.cable_free_0)")))U("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi3.gu4.PMC_0+gi3.gu4.PMC_1)+gi3.gu4.PMC_2))"))))
Formula 3 simplified : !F(FG"(gi3.gu3.S_tout_0<=gi3.gu3.cable_free_0)" U "(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=((gi3.gu4.PMC_0+gi3.gu4.PMC_1)+gi3.gu4.PMC_2))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
28 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,1.09873,54468,1,0,218,193565,160,85,2135,169193,320
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SafeBus-COL-03-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(((gu2.MSG_0+gu2.MSG_1)+gu2.MSG_2)>gu2.T_out_0)")U(G(X(F(X(F("(((gi1.gu7.loop_em_0+gi1.gu7.loop_em_1)+gi1.gu7.loop_em_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))"))))))))
Formula 4 simplified : !("(((gu2.MSG_0+gu2.MSG_1)+gu2.MSG_2)>gu2.T_out_0)" U GXFXF"(((gi1.gu7.loop_em_0+gi1.gu7.loop_em_1)+gi1.gu7.loop_em_2)<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")
3 unique states visited
0 strongly connected components in search stack
3 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,1.15116,56280,1,0,236,203225,169,86,2147,178186,371
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SafeBus-COL-03-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=gi1.gu1.R_tout_0)"))&&(!(G("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)>gi1.gu1.R_tout_0)")))))
Formula 5 simplified : !(X"(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=gi1.gu1.R_tout_0)" & !G"(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)>gi1.gu1.R_tout_0)")
[2020-05-19 12:22:28] [INFO ] Computing symmetric co enabling matrix : 91 transitions.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
30 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,1.4563,62852,1,0,298,241748,175,109,2161,214455,495
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SafeBus-COL-03-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(("(gi1.gu1.R_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")||((!(F((F("(gi1.gu1.R_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))"))&&("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=gi3.gu3.S_tout_0)"))))&&("(gi1.gu1.R_tout_0>((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")))))
Formula 6 simplified : !X("(gi1.gu1.R_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))" | ("(gi1.gu1.R_tout_0>((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))" & !F("(((gi3.gu3.listen_0+gi3.gu3.listen_1)+gi3.gu3.listen_2)<=gi3.gu3.S_tout_0)" & F"(gi1.gu1.R_tout_0<=((gi1.gu1.cable_used_0+gi1.gu1.cable_used_1)+gi1.gu1.cable_used_2))")))
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
33 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,1.7821,74328,1,0,360,294180,207,131,2209,264432,643
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SafeBus-COL-03-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X(!(F(("(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)")U("(gu2.T_out_0>=1)"))))))
Formula 7 simplified : !X!F("(((gu5.wait_msg_0+gu5.wait_msg_1)+gu5.wait_msg_2)>=3)" U "(gu2.T_out_0>=1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
29 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,2.07154,83292,1,0,426,352733,213,158,2210,328967,796
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA SafeBus-COL-03-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
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.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-19 12:22:29] [INFO ] Built C files in 2681ms 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 1589890949410

--------------------
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="SafeBus-COL-03"
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 SafeBus-COL-03, 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 r156-oct2-158972913900337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-03.tgz
mv SafeBus-COL-03 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 ;