Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r303-tall-162124171000002.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
Input is CANConstruction-PT-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r303-tall-162124171000002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 20K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 118K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 12 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 12 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.0K May 11 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 11 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 167K May 12 08:13 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 CANConstruction-PT-005-00
FORMULA_NAME CANConstruction-PT-005-01
FORMULA_NAME CANConstruction-PT-005-02
FORMULA_NAME CANConstruction-PT-005-03
FORMULA_NAME CANConstruction-PT-005-04
FORMULA_NAME CANConstruction-PT-005-05
FORMULA_NAME CANConstruction-PT-005-06
FORMULA_NAME CANConstruction-PT-005-07
FORMULA_NAME CANConstruction-PT-005-08
FORMULA_NAME CANConstruction-PT-005-09
FORMULA_NAME CANConstruction-PT-005-10
FORMULA_NAME CANConstruction-PT-005-11
FORMULA_NAME CANConstruction-PT-005-12
FORMULA_NAME CANConstruction-PT-005-13
FORMULA_NAME CANConstruction-PT-005-14
FORMULA_NAME CANConstruction-PT-005-15

=== Now, execution of the tool begins

BK_START 1621320675032

[2021-05-18 06:51:16] [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]
[2021-05-18 06:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 06:51:16] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-18 06:51:16] [INFO ] Transformed 112 places.
[2021-05-18 06:51:16] [INFO ] Transformed 140 transitions.
[2021-05-18 06:51:16] [INFO ] Parsed PT model containing 112 places and 140 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 722 steps, including 8 resets, run visited all 39 properties in 13 ms. (steps per millisecond=55 )
[2021-05-18 06:51:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-18 06:51:16] [INFO ] Flatten gal took : 44 ms
FORMULA CANConstruction-PT-005-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-18 06:51:16] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2021-05-18 06:51:17] [INFO ] Applying decomposition
[2021-05-18 06:51:17] [INFO ] Flatten gal took : 21 ms
[2021-05-18 06:51:17] [INFO ] Input system was already deterministic with 140 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/graph14643034489538281286.txt, -o, /tmp/graph14643034489538281286.bin, -w, /tmp/graph14643034489538281286.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/graph14643034489538281286.bin, -l, -1, -v, -w, /tmp/graph14643034489538281286.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 06:51:17] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 140 rows 112 cols
[2021-05-18 06:51:17] [INFO ] Computed 11 place invariants in 8 ms
inv : Node4ReadyToInsert + Node4DHTinfo + Node4ID + Node4ResZone + Node4IsInserted + Node4DHTinfo2 + Node4ID2 + Node4Bootstrap + Node4JoinMsg + Node4Request + Node4OKshare + Node4NOshare + Node4IsNonInsertedNode + Node0GiveAnswer4 + Node1GiveAnswer4 + Node2GiveAnswer4 + Node3GiveAnswer4 + Node4requestsent0 + Node4requestsent1 + Node4requestsent2 + Node4requestsent3 = 1
inv : -Node1Request + Node1WaitAnswer - Node1OKshare - Node1NOshare - Node0GiveAnswer1 - Node1requestsent0 - Node1requestsent2 - Node1requestsent3 - Node1requestsent4 - Node2GiveAnswer1 - Node3GiveAnswer1 - Node4GiveAnswer1 = 0
inv : Node2ReadyToInsert + Node2DHTinfo + Node2ID + Node2ResZone + Node2IsInserted + Node2DHTinfo2 + Node2ID2 + Node2Bootstrap + Node2JoinMsg + Node2Request + Node2OKshare + Node2NOshare + Node2IsNonInsertedNode + Node0GiveAnswer2 + Node1GiveAnswer2 + Node2requestsent0 + Node2requestsent1 + Node2requestsent3 + Node2requestsent4 + Node3GiveAnswer2 + Node4GiveAnswer2 = 1
inv : Node1ReadyToInsert + Node1DHTinfo + Node1ID + Node1ResZone + Node1IsInserted + Node1DHTinfo2 + Node1ID2 + Node1Bootstrap + Node1JoinMsg + Node1Request + Node1OKshare + Node1NOshare + Node1IsNonInsertedNode + Node0GiveAnswer1 + Node1requestsent0 + Node1requestsent2 + Node1requestsent3 + Node1requestsent4 + Node2GiveAnswer1 + Node3GiveAnswer1 + Node4GiveAnswer1 = 1
inv : -Node2Request + Node2WaitAnswer - Node2OKshare - Node2NOshare - Node0GiveAnswer2 - Node1GiveAnswer2 - Node2requestsent0 - Node2requestsent1 - Node2requestsent3 - Node2requestsent4 - Node3GiveAnswer2 - Node4GiveAnswer2 = 0
inv : -Node4Request + Node4WaitAnswer - Node4OKshare - Node4NOshare - Node0GiveAnswer4 - Node1GiveAnswer4 - Node2GiveAnswer4 - Node3GiveAnswer4 - Node4requestsent0 - Node4requestsent1 - Node4requestsent2 - Node4requestsent3 = 0
inv : InsertedCount + Node0ReadyToInsert + Node0DHTinfo + Node0ID + Node0ResZone + Node0DHTinfo2 + Node0ID2 + Node0Bootstrap + Node0JoinMsg + Node0Request + Node0OKshare + Node0NOshare + Node0IsNonInsertedNode + Node1ReadyToInsert + Node1DHTinfo + Node1ID + Node1ResZone + Node1DHTinfo2 + Node1ID2 + Node1Bootstrap + Node1JoinMsg + Node1Request + Node1OKshare + Node1NOshare + Node1IsNonInsertedNode + Node2ReadyToInsert + Node2DHTinfo + Node2ID + Node2ResZone + Node2DHTinfo2 + Node2ID2 + Node2Bootstrap + Node2JoinMsg + Node2Request + Node2OKshare + Node2NOshare + Node2IsNonInsertedNode + Node3ReadyToInsert + Node3DHTinfo + Node3ID + Node3ResZone + Node3DHTinfo2 + Node3ID2 + Node3Bootstrap + Node3JoinMsg + Node3Request + Node3OKshare + Node3NOshare + Node3IsNonInsertedNode + Node4ReadyToInsert + Node4DHTinfo + Node4ID + Node4ResZone + Node4DHTinfo2 + Node4ID2 + Node4Bootstrap + Node4JoinMsg + Node4Request + Node4OKshare + Node4NOshare + Node4IsNonInsertedNode + Node0requestsent1 + Node0GiveAnswer1 + Node0requestsent2 + Node0GiveAnswer2 + Node0requestsent3 + Node0GiveAnswer3 + Node0requestsent4 + Node0GiveAnswer4 + Node1requestsent0 + Node1GiveAnswer0 + Node1requestsent2 + Node1GiveAnswer2 + Node1requestsent3 + Node1GiveAnswer3 + Node1requestsent4 + Node1GiveAnswer4 + Node2requestsent0 + Node2GiveAnswer0 + Node2requestsent1 + Node2GiveAnswer1 + Node2requestsent3 + Node2GiveAnswer3 + Node2requestsent4 + Node2GiveAnswer4 + Node3requestsent0 + Node3GiveAnswer0 + Node3requestsent1 + Node3GiveAnswer1 + Node3requestsent2 + Node3GiveAnswer2 + Node3requestsent4 + Node3GiveAnswer4 + Node4requestsent0 + Node4GiveAnswer0 + Node4requestsent1 + Node4GiveAnswer1 + Node4requestsent2 + Node4GiveAnswer2 + Node4requestsent3 + Node4GiveAnswer3 = 5
inv : -Node3Request + Node3WaitAnswer - Node3OKshare - Node3NOshare - Node0GiveAnswer3 - Node1GiveAnswer3 - Node2GiveAnswer3 - Node3requestsent0 - Node3requestsent1 - Node3requestsent2 - Node3requestsent4 - Node4GiveAnswer3 = 0
inv : Node0ReadyToInsert + Node0DHTinfo + Node0ID + Node0ResZone + Node0IsInserted + Node0DHTinfo2 + Node0ID2 + Node0Bootstrap + Node0JoinMsg + Node0Request + Node0OKshare + Node0NOshare + Node0IsNonInsertedNode + Node0requestsent1 + Node0requestsent2 + Node0requestsent3 + Node0requestsent4 + Node1GiveAnswer0 + Node2GiveAnswer0 + Node3GiveAnswer0 + Node4GiveAnswer0 = 1
inv : Node3ReadyToInsert + Node3DHTinfo + Node3ID + Node3ResZone + Node3IsInserted + Node3DHTinfo2 + Node3ID2 + Node3Bootstrap + Node3JoinMsg + Node3Request + Node3OKshare + Node3NOshare + Node3IsNonInsertedNode + Node0GiveAnswer3 + Node1GiveAnswer3 + Node2GiveAnswer3 + Node3requestsent0 + Node3requestsent1 + Node3requestsent2 + Node3requestsent4 + Node4GiveAnswer3 = 1
inv : -Node0Request + Node0WaitAnswer - Node0OKshare - Node0NOshare - Node0requestsent1 - Node0requestsent2 - Node0requestsent3 - Node0requestsent4 - Node1GiveAnswer0 - Node2GiveAnswer0 - Node3GiveAnswer0 - Node4GiveAnswer0 = 0
Total of 11 invariants.
[2021-05-18 06:51:17] [INFO ] Computed 11 place invariants in 11 ms
[2021-05-18 06:51:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 06:51:17] [INFO ] Removed a total of 62 redundant transitions.
[2021-05-18 06:51:17] [INFO ] Flatten gal took : 90 ms
[2021-05-18 06:51:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2021-05-18 06:51:17] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 10 ms
[2021-05-18 06:51:17] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.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/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

[2021-05-18 06:51:17] [INFO ] Proved 112 variables to be positive in 225 ms
[2021-05-18 06:51:17] [INFO ] Computing symmetric may disable matrix : 140 transitions.
[2021-05-18 06:51:17] [INFO ] Computation of disable matrix completed :0/140 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 06:51:17] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-18 06:51:17] [INFO ] Computing symmetric may enable matrix : 140 transitions.
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 15 LTL properties
[2021-05-18 06:51:17] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !(((("(i6.u18.Node3JoinMsg>=1)")U("(i6.u18.Node3JoinMsg<1)"))&&(G(!(X("((i8.u29.Node0IsInserted>=1)&&(i10.u24.Node4requestsent0>=1))"))))))
Formula 0 simplified : !(("(i6.u18.Node3JoinMsg>=1)" U "(i6.u18.Node3JoinMsg<1)") & G!X"((i8.u29.Node0IsInserted>=1)&&(i10.u24.Node4requestsent0>=1))")
built 30 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 10 ordering constraints for composite.
built 14 ordering constraints for composite.
built 20 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 20 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions Node0AssociatesDHTInfo, Node0InsertNode, Node1AssociatesDHTInfo, Node1InsertNode, Node2AssociatesDHTInfo, Node2InsertNode, Node3AssociatesDHTInfo, Node3InsertNode, Node4AssociatesDHTInfo, Node4InsertNode, i3.u10.Node0SendAccept1, i3.u10.Node0SendRefuse1, i3.u10.Node2SendAccept1, i3.u10.Node2SendRefuse1, i3.u10.Node3SendAccept1, i3.u10.Node3SendRefuse1, i3.u10.Node4SendAccept1, i3.u10.Node4SendRefuse1, i5.Node4SendRefuse2, i5.Node4SendAccept2, i5.Node3SendAccept2, i5.Node1SendRefuse2, i5.Node1SendAccept2, i5.Node0SendRefuse2, i5.u15.Node3SendRefuse2, i5.u26.Node0SendAccept2, i8.Node1SendAccept3, i8.Node0SendRefuse3, i8.u20.Node1SendRefuse3, i8.u20.Node4SendRefuse3, i8.u27.Node0SendAccept3, i8.u27.Node2SendAccept3, i9.Node4SendAccept0, i9.Node2SendRefuse0, i9.u4.Node2SendAccept0, i9.u4.Node3SendAccept0, i9.u30.Node1SendRefuse0, i9.u30.Node4SendRefuse0, i10.Node3SendRefuse4, i10.Node3SendAccept4, i10.Node2SendRefuse4, i10.Node2SendAccept4, i10.Node1SendAccept4, i10.Node0SendRefuse4, i10.u28.Node0SendAccept4, i10.u32.Node1SendRefuse4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/46/136
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 items max in DFS search stack
67 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.69154,39880,1,0,46829,796,2000,73399,290,2985,137503
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F((G("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))"))U(!((F(!(G("(i5.u15.Node3GiveAnswer2>=1)"))))U("((i5.u15.Node3GiveAnswer2>=1)&&(i7.u23.Node4JoinMsg>=1))")))))))
Formula 1 simplified : !GF(G"((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))" U !(F!G"(i5.u15.Node3GiveAnswer2>=1)" U "((i5.u15.Node3GiveAnswer2>=1)&&(i7.u23.Node4JoinMsg>=1))"))
Computing Next relation with stutter on 1 deadlock states
16 unique states visited
16 strongly connected components in search stack
19 transitions explored
16 items max in DFS search stack
21 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.912074,47064,1,0,60865,814,2083,91808,293,3040,178531
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !(((!(X(X(G("((i7.u23.Node4WaitAnswer>=1)&&(i10.u28.Node4OKshare>=1))")))))&&(!(((G("(i10.u32.Node1GiveAnswer4>=1)"))U("(i2.u8.Node1Bootstrap>=1)"))U("((i5.u14.Node2Request>=1)&&(i10.u34.Node3IsInserted>=1))")))))
Formula 2 simplified : !(!XXG"((i7.u23.Node4WaitAnswer>=1)&&(i10.u28.Node4OKshare>=1))" & !((G"(i10.u32.Node1GiveAnswer4>=1)" U "(i2.u8.Node1Bootstrap>=1)") U "((i5.u14.Node2Request>=1)&&(i10.u34.Node3IsInserted>=1))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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.916797,48032,1,0,60898,814,2135,91817,294,3040,178837
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CANConstruction-PT-005-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((!(F(G(!((!(X(F("(i4.u13.Node2Bootstrap>=1)"))))U(X("((i0.u1.InsertedCount>=1)&&(i4.u11.Node2ReadyToInsert>=1))"))))))))
Formula 3 simplified : FG!(!XF"(i4.u13.Node2Bootstrap>=1)" U X"((i0.u1.InsertedCount>=1)&&(i4.u11.Node2ReadyToInsert>=1))")
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 items max in DFS search stack
4 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.952856,48824,1,0,63351,814,2173,94921,294,3044,186553
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((G((X(G("((i10.u33.Node2IsInserted<1)||(i3.u9.Node1requestsent2<1))")))||(G("((i8.u19.Node3Request>=1)&&(i5.u22.Node4IsInserted>=1))"))))U(X("((i10.u33.Node2IsInserted>=1)&&(i3.u9.Node1requestsent2>=1))"))))
Formula 4 simplified : !(G(XG"((i10.u33.Node2IsInserted<1)||(i3.u9.Node1requestsent2<1))" | G"((i8.u19.Node3Request>=1)&&(i5.u22.Node4IsInserted>=1))") U X"((i10.u33.Node2IsInserted>=1)&&(i3.u9.Node1requestsent2>=1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
25 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.19894,56428,1,0,80106,839,2230,114167,294,3112,226301
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((!(G(F(G(("(i0.u2.Node0Bootstrap>=1)")U(G((("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))")U(("(i6.u18.Node3Bootstrap>=1)")U("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))")))&&("(i10.u33.Node2GiveAnswer4>=1)")))))))))
Formula 5 simplified : GFG("(i0.u2.Node0Bootstrap>=1)" U G("(i10.u33.Node2GiveAnswer4>=1)" & ("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))" U ("(i6.u18.Node3Bootstrap>=1)" U "((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3Request>=1))"))))
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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,1.20375,56684,1,0,80237,840,2280,114249,294,3116,226944
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F(((G("(i10.u32.Node1GiveAnswer4>=1)"))&&("(i10.u33.Node2GiveAnswer4>=1)"))||((("(i5.u31.Node1GiveAnswer2<1)")U("(i3.u10.Node2GiveAnswer1>=1)"))&&(("(i3.u10.Node2GiveAnswer1<1)")U("(i3.u10.Node2GiveAnswer1>=1)"))))))
Formula 6 simplified : !F(("(i10.u33.Node2GiveAnswer4>=1)" & G"(i10.u32.Node1GiveAnswer4>=1)") | (("(i5.u31.Node1GiveAnswer2<1)" U "(i3.u10.Node2GiveAnswer1>=1)") & ("(i3.u10.Node2GiveAnswer1<1)" U "(i3.u10.Node2GiveAnswer1>=1)")))
Computing Next relation with stutter on 1 deadlock states
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 items max in DFS search stack
11 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.31311,60108,1,0,86481,848,2313,121952,294,3187,246085
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X((!(F("(i4.u12.Node2ID2>=1)")))&&(!(G("(i4.u12.Node2ID2>=1)"))))))
Formula 7 simplified : !X(!F"(i4.u12.Node2ID2>=1)" & !G"(i4.u12.Node2ID2>=1)")
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
12 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.44493,64860,1,0,97600,848,2352,132399,294,3192,282338
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X((F("(i6.u17.Node3IsNonInsertedNode>=1)"))||(((!(("((i7.u23.Node4WaitAnswer>=1)&&(i10.u32.Node4NOshare>=1))")U("(i6.u17.Node3IsNonInsertedNode>=1)")))&&(!(X(!(F("(i9.u4.Node3GiveAnswer0>=1)"))))))&&("((i0.u1.InsertedCount<1)||(i4.u11.Node2ReadyToInsert<1))")))))
Formula 8 simplified : !X(F"(i6.u17.Node3IsNonInsertedNode>=1)" | ("((i0.u1.InsertedCount<1)||(i4.u11.Node2ReadyToInsert<1))" & !("((i7.u23.Node4WaitAnswer>=1)&&(i10.u32.Node4NOshare>=1))" U "(i6.u17.Node3IsNonInsertedNode>=1)") & !X!F"(i9.u4.Node3GiveAnswer0>=1)"))
Computing Next relation with stutter on 1 deadlock states
[2021-05-18 06:51:19] [INFO ] Computing symmetric co enabling matrix : 140 transitions.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
7 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.50937,66972,1,0,101986,849,2396,137079,295,3193,292573
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G(F("((i5.u22.Node4IsInserted>=1)&&(i9.u3.Node0requestsent4>=1))")))U(X(F(X(F(((G("(i9.u30.Node4GiveAnswer0>=1)"))&&("(i5.u22.Node4IsInserted>=1)"))&&("(i9.u3.Node0requestsent4>=1)"))))))))
Formula 9 simplified : !(GF"((i5.u22.Node4IsInserted>=1)&&(i9.u3.Node0requestsent4>=1))" U XFXF("(i5.u22.Node4IsInserted>=1)" & "(i9.u3.Node0requestsent4>=1)" & G"(i9.u30.Node4GiveAnswer0>=1)"))
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
17 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.67859,72248,1,0,113458,850,2440,149342,296,3202,318352
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F("(i10.u32.Node1GiveAnswer4>=1)")))
Formula 10 simplified : !F"(i10.u32.Node1GiveAnswer4>=1)"
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
7 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.75578,74888,1,0,118470,850,2458,155744,296,3203,329349
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((!(X((!(X(!(G((G("((i8.u29.Node0IsInserted>=1)&&(i3.u9.Node1Request>=1))"))||("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3requestsent1>=1))"))))))&&(!(F("(i6.u17.Node3IsNonInsertedNode>=1)")))))))
Formula 11 simplified : X(!X!G("((i5.u31.Node1IsInserted>=1)&&(i8.u19.Node3requestsent1>=1))" | G"((i8.u29.Node0IsInserted>=1)&&(i3.u9.Node1Request>=1))") & !F"(i6.u17.Node3IsNonInsertedNode>=1)")
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 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,1.75724,75416,1,0,118470,850,2484,155744,296,3203,329365
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA CANConstruction-PT-005-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!(F(X(F(X(F((X("((i5.u14.Node2Request>=1)&&(i5.u22.Node4IsInserted>=1))"))||("(i0.u0.Node0ResZone>=1)")))))))))
Formula 12 simplified : FXFXF("(i0.u0.Node0ResZone>=1)" | X"((i5.u14.Node2Request>=1)&&(i5.u22.Node4IsInserted>=1))")
Computing Next relation with stutter on 1 deadlock states
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
18 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.92598,80960,1,0,131975,854,2533,169048,296,3215,368961
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((F((F(G("(((i1.u5.EmptyCAN>=1)&&(i7.u25.Node4ReadyToInsert>=1))&&(i4.u13.Node2JoinMsg<1))")))&&((G("((i8.u29.Node0IsInserted>=1)&&(i8.u29.Node3requestsent0>=1))"))||(F("((i8.u29.Node0IsInserted>=1)&&(i8.u29.Node3requestsent0>=1))"))))))
Formula 13 simplified : !F(FG"(((i1.u5.EmptyCAN>=1)&&(i7.u25.Node4ReadyToInsert>=1))&&(i4.u13.Node2JoinMsg<1))" & (G"((i8.u29.Node0IsInserted>=1)&&(i8.u29.Node3requestsent0>=1))" | F"((i8.u29.Node0IsInserted>=1)&&(i8.u29.Node3requestsent0>=1))"))
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
60 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.53335,104192,1,0,193014,877,2583,208675,298,3273,497674
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((X(G(F(("(i0.u0.Node0DHTinfo>=1)")U(F("((((i6.u17.Node3WaitAnswer>=1)&&(i8.u27.Node3OKshare>=1))&&(i10.u33.Node2IsInserted>=1))&&(i3.u9.Node1requestsent2>=1))")))))))
Formula 14 simplified : !XGF("(i0.u0.Node0DHTinfo>=1)" U F"((((i6.u17.Node3WaitAnswer>=1)&&(i8.u27.Node3OKshare>=1))&&(i10.u33.Node2IsInserted>=1))&&(i3.u9.Node1requestsent2>=1))")
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
8 strongly connected components in search stack
9 transitions explored
8 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,2.54668,104720,1,0,193638,877,2613,209628,298,3273,499868
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CANConstruction-PT-005-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception on push().
java.lang.RuntimeException: SMT solver raised an exception on push().
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:466)
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)
[2021-05-18 06:51:20] [INFO ] Built C files in 3576ms 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 1621320681907

--------------------
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="CANConstruction-PT-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is CANConstruction-PT-005, 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 r303-tall-162124171000002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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