Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r216-oct2-165281606200129.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-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 gold2021
Input is SafeBus-COL-03, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-oct2-165281606200129
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.4K Apr 29 11:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 11:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 42K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1653217702414

Running Version 0
[2022-05-22 11:08:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2022-05-22 11:08:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-22 11:08:24] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-05-22 11:08:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-22 11:08:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 480 ms
[2022-05-22 11:08:24] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2022-05-22 11:08:24] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 16 ms.
[2022-05-22 11:08:24] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 3 ms.
[2022-05-22 11:08:24] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_12554192905662948475.dot
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 16 ms.
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN properties in 0 ms.
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 2 ms.
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_13006555192610691804.dot
[2022-05-22 11:08:24] [INFO ] Reduced 3 identical enabling conditions.
[2022-05-22 11:08:24] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions in 1 ms.
[2022-05-22 11:08:24] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1002_15887794156762932713.dot
Reduce places removed 3 places and 0 transitions.
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 2 ms.
[2022-05-22 11:08:24] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1003_16085926979335008852.dot
[2022-05-22 11:08:24] [INFO ] Reduced 3 identical enabling conditions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.12362KB memory used
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 9 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2022-05-22 11:08:24] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:24] [INFO ] Computed 17 place invariants in 18 ms
[2022-05-22 11:08:25] [INFO ] Implicit Places using invariants in 126 ms returned []
[2022-05-22 11:08:25] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:25] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-22 11:08:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-22 11:08:25] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-05-22 11:08:25] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-22 11:08:25] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:25] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-22 11:08:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned [7, 10, 13, 17, 20, 23, 27, 30, 33]
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions :[33, 30, 27, 23, 20, 17, 13, 10, 7]
Starting structural reductions, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2022-05-22 11:08:25] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-22 11:08:25] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:25] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-22 11:08:25] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1139 ms (no deadlock found). (steps per millisecond=1097 )
Random directed walk for 1250001 steps, including 0 resets, run took 797 ms (no deadlock found). (steps per millisecond=1568 )
[2022-05-22 11:08:27] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:27] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-22 11:08:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-22 11:08:27] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 77 ms returned sat
[2022-05-22 11:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:27] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2022-05-22 11:08:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:08:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 55 ms returned sat
[2022-05-22 11:08:28] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 81 ms returned sat
[2022-05-22 11:08:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:28] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2022-05-22 11:08:28] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-22 11:08:28] [INFO ] [Nat]Added 13 Read/Feed constraints in 30 ms returned sat
[2022-05-22 11:08:28] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 22 ms.
[2022-05-22 11:08:28] [INFO ] Added : 43 causal constraints over 9 iterations in 323 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 28 ms.
Parikh directed walk for 6700 steps, including 689 resets, run took 31 ms. (steps per millisecond=216 )
Random directed walk for 500000 steps, including 0 resets, run took 328 ms (no deadlock found). (steps per millisecond=1524 )
Random walk for 500000 steps, including 0 resets, run took 444 ms (no deadlock found). (steps per millisecond=1126 )
Random directed walk for 500003 steps, including 0 resets, run took 326 ms (no deadlock found). (steps per millisecond=1533 )
Random walk for 500000 steps, including 0 resets, run took 455 ms (no deadlock found). (steps per millisecond=1098 )
Starting structural reductions, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2022-05-22 11:08:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:30] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-22 11:08:30] [INFO ] Implicit Places using invariants in 123 ms returned []
[2022-05-22 11:08:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:30] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-22 11:08:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-22 11:08:30] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-22 11:08:30] [INFO ] Redundant transitions in 1 ms returned []
[2022-05-22 11:08:30] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:30] [INFO ] Computed 17 place invariants in 29 ms
[2022-05-22 11:08:30] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 82/82 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1067 ms (no deadlock found). (steps per millisecond=1171 )
Random directed walk for 1250000 steps, including 0 resets, run took 894 ms (no deadlock found). (steps per millisecond=1398 )
[2022-05-22 11:08:32] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
// Phase 1: matrix 68 rows 54 cols
[2022-05-22 11:08:32] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-22 11:08:32] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-22 11:08:32] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 16 ms returned sat
[2022-05-22 11:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-22 11:08:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-22 11:08:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-22 11:08:33] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 2 ms returned sat
[2022-05-22 11:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-22 11:08:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-22 11:08:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-22 11:08:33] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2022-05-22 11:08:33] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 7 ms.
[2022-05-22 11:08:33] [INFO ] Added : 43 causal constraints over 9 iterations in 88 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
Parikh directed walk for 6700 steps, including 711 resets, run took 12 ms. (steps per millisecond=558 )
Random directed walk for 500002 steps, including 0 resets, run took 341 ms (no deadlock found). (steps per millisecond=1466 )
Random walk for 500000 steps, including 0 resets, run took 411 ms (no deadlock found). (steps per millisecond=1216 )
Random directed walk for 500000 steps, including 0 resets, run took 285 ms (no deadlock found). (steps per millisecond=1754 )
Random walk for 500000 steps, including 0 resets, run took 401 ms (no deadlock found). (steps per millisecond=1246 )
[2022-05-22 11:08:34] [INFO ] Flatten gal took : 41 ms
[2022-05-22 11:08:34] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions in 2 ms.
[2022-05-22 11:08:34] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1004_17167392389379741366.dot
[2022-05-22 11:08:34] [INFO ] Reduced 3 identical enabling conditions.
[2022-05-22 11:08:34] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Finished random walk after 1069 steps, including 0 resets, run visited all 13 properties in 4 ms. (steps per millisecond=267 )
Able to resolve query QuasiLiveness after proving 14 properties.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
[2022-05-22 11:08:34] [INFO ] Flatten gal took : 12 ms
[2022-05-22 11:08:34] [INFO ] Flatten gal took : 11 ms
[2022-05-22 11:08:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7652494492889544157.gal : 5 ms
[2022-05-22 11:08:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7976423320726740534.ctl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7652494492889544157.gal, -t, CGAL, -ctl, /tmp/CTLFireability7976423320726740534.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7652494492889544157.gal -t CGAL -ctl /tmp/CTLFireability7976423320726740534.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,0.097526,8916,2,1482,5,16416,6,0,310,14881,0


Converting to forward existential form...Done !
original formula: AG(EF(((ACK_0>=1)&&(R_tout_0>=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((ACK_0>=1)&&(R_tout_0>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr1i0, I_reemitr1i2, I_reemitr2i0, I_reemitr2i1, C_freei0, C_freei1, C_freei2, I_rec1r0, I_rec1r1, I_rec1r2, loss_mr0, loss_mr1, 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) :9/55/27/91
(forward)formula 0,1,1.04942,46348,1,0,211,181081,194,93,2657,148414,211
Formula is TRUE !

***************************************

original formula: AG(EF((((((((wait_ack_1>=1)&&(T_out_0>=1))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((((wait_ack_1>=1)&&(T_out_0>=1))||((wait_ack_7>=1)&&(T_out_0>=1)))||((wait_ack_6>=1)&&(T_out_0>=1)))||((wait_ack_5>=1)&&(T_out_0>=1)))||((wait_ack_3>=1)&&(T_out_0>=1)))||((wait_ack_2>=1)&&(T_out_0>=1))))))] = FALSE
(forward)formula 1,1,1.40562,59020,1,0,225,234416,195,101,2662,205136,232
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((((((((((((((((((((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((((((((((((((((((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_1>=1))&&(AMC_3>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_2>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_used_1>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_2>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_used_2>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_used_1>=1))&&(AMC_2>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 2,1,1.72756,71068,1,0,236,274324,196,107,2696,244258,249
Formula is TRUE !

***************************************

original formula: AG(EF(((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_1>=1)&&(FMC_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((cable_used_0>=1)&&(FMC_0>=1))||((cable_used_2>=1)&&(FMC_2>=1)))||((cable_used_1>=1)&&(FMC_1>=1))))))] = FALSE
(forward)formula 3,1,1.96282,81092,1,0,246,312557,197,113,2698,281877,265
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_3>=1))&&(FMCb_0>=1))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_4>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_5>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_7>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_8>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_6>=1))&&(FMCb_0>=1)))||((((Cpt2_2>=1)&&(cable_free_0>=1))&&(AMC_2>=1))&&(FMCb_0>=1)))||((((Cpt2_0>=1)&&(cable_free_0>=1))&&(AMC_0>=1))&&(FMCb_0>=1)))||((((Cpt2_1>=1)&&(cable_free_0>=1))&&(AMC_1>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 4,1,2.12957,87676,1,0,256,333646,198,119,2716,303921,281
Formula is TRUE !

***************************************

original formula: AG(EF(((((listen_2>=1)&&(MSG_2>=1))||((listen_0>=1)&&(MSG_0>=1)))||((listen_1>=1)&&(MSG_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((listen_2>=1)&&(MSG_2>=1))||((listen_0>=1)&&(MSG_0>=1)))||((listen_1>=1)&&(MSG_1>=1))))))] = FALSE
(forward)formula 5,1,2.69163,100876,1,0,272,400675,199,129,2718,371052,307
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((wait_ack_5>=1)&&(ACK_0>=1))&&(FMCb_0>=1))||(((wait_ack_2>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_6>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_1>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_3>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_7>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((wait_ack_5>=1)&&(ACK_0>=1))&&(FMCb_0>=1))||(((wait_ack_2>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_6>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_1>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_3>=1)&&(ACK_0>=1))&&(FMCb_0>=1)))||(((wait_ack_7>=1)&&(ACK_0>=1))&&(FMCb_0>=1))))))] = FALSE
(forward)formula 6,1,2.80721,104836,1,0,281,415770,200,135,2725,386422,323
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-22 11:08:37] [INFO ] Flatten gal took : 8 ms
[2022-05-22 11:08:37] [INFO ] Applying decomposition
[2022-05-22 11:08:37] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph3698299855024043219.txt, -o, /tmp/graph3698299855024043219.bin, -w, /tmp/graph3698299855024043219.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph3698299855024043219.bin, -l, -1, -v, -w, /tmp/graph3698299855024043219.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-22 11:08:37] [INFO ] Decomposing Gal with order
[2022-05-22 11:08:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-22 11:08:37] [INFO ] Removed a total of 70 redundant transitions.
[2022-05-22 11:08:38] [INFO ] Flatten gal took : 39 ms
[2022-05-22 11:08:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2022-05-22 11:08:38] [INFO ] Time to serialize gal into /tmp/CTLFireability2996913941935430947.gal : 2 ms
[2022-05-22 11:08:38] [INFO ] Time to serialize properties into /tmp/CTLFireability12782886926598855567.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2996913941935430947.gal, -t, CGAL, -ctl, /tmp/CTLFireability12782886926598855567.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2996913941935430947.gal -t CGAL -ctl /tmp/CTLFireability12782886926598855567.ctl
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,1.76943,56420,837,1367,15353,9416,262,226101,156,598902,0


Converting to forward existential form...Done !
original formula: AG(EF(((((i0.u0.wait_cable_1>=1)&&(i1.u3.PMC_1>=1))||((i0.u1.wait_cable_2>=1)&&(i1.u4.PMC_2>=1)))||((i0.u6.wait_cable_0>=1)&&(i1.u3.PMC_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((i0.u0.wait_cable_1>=1)&&(i1.u3.PMC_1>=1))||((i0.u1.wait_cable_2>=1)&&(i1.u4.PMC_2>=1)))||((i0.u6.wait_cable_0>=1)&&(i1.u3.PMC_0>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions C_freei0, C_freei1, C_freei2, I_rec1r1, I_rec2r0, I_rec2r2, I_ask2i0x0, I_ask2i0x1, I_ask2i0x2, I_ask2i2x0, I_ask2i2x1, I_ask2i2x2, i0.u0.I_ask2i1x0, i0.u0.I_ask2i1x1, i0.u0.I_ask2i1x2, i1.loss_mr2, i1.loss_mr1, i1.I_rec1r2, i1.I_rec1r0, i1.I_reemitr2i1, i1.u4.I_reemitr0i1, i1.u4.I_reemitr0i2, i1.u4.I_reemitr1i0, i1.u4.I_reemitr1i2, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :6/44/24/74
(forward)formula 0,1,2.85542,69676,1,0,21850,29297,1182,268627,1131,764107,72949
Formula is TRUE !
Detected timeout of ITS tools.
[2022-05-22 11:08:41] [INFO ] Flatten gal took : 6 ms
[2022-05-22 11:08:41] [INFO ] Flatten gal took : 6 ms
[2022-05-22 11:08:41] [INFO ] Time to serialize gal into /tmp/CTLFireability2341663032584318844.gal : 2 ms
[2022-05-22 11:08:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1044388979771429968.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2341663032584318844.gal, -t, CGAL, -ctl, /tmp/CTLFireability1044388979771429968.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2341663032584318844.gal -t CGAL -ctl /tmp/CTLFireability1044388979771429968.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4650,0.104574,8964,2,1482,5,16416,6,0,310,14881,0


Converting to forward existential form...Done !
original formula: AG(EF(((((wait_cable_0>=1)&&(RMC_0>=1))||((wait_cable_1>=1)&&(RMC_1>=1)))||((wait_cable_2>=1)&&(RMC_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((wait_cable_0>=1)&&(RMC_0>=1))||((wait_cable_1>=1)&&(RMC_1>=1)))||((wait_cable_2>=1)&&(RMC_2>=1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions I_reemitr0i1, I_reemitr0i2, I_reemitr1i0, I_reemitr1i2, I_reemitr2i0, I_reemitr2i1, C_freei0, C_freei1, C_freei2, I_rec1r0, I_rec1r1, I_rec1r2, loss_mr0, loss_mr1, 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) :9/55/27/91
(forward)formula 0,1,0.769411,28524,1,0,204,106963,194,87,2665,83882,196
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((Cpt1_2>=1)&&(listen_2>=1))||((Cpt1_1>=1)&&(listen_1>=1)))||((Cpt1_1>=1)&&(listen_2>=1)))||((Cpt1_2>=1)&&(listen_0>=1)))||((Cpt1_1>=1)&&(listen_0>=1)))||((Cpt1_2>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_0>=1)))||((Cpt1_0>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((Cpt1_2>=1)&&(listen_2>=1))||((Cpt1_1>=1)&&(listen_1>=1)))||((Cpt1_1>=1)&&(listen_2>=1)))||((Cpt1_2>=1)&&(listen_0>=1)))||((Cpt1_1>=1)&&(listen_0>=1)))||((Cpt1_2>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_0>=1)))||((Cpt1_0>=1)&&(listen_1>=1)))||((Cpt1_0>=1)&&(listen_2>=1))))))] = FALSE
(forward)formula 1,1,1.14113,41284,1,0,213,155878,195,93,2668,129310,212
Formula is TRUE !

***************************************

original formula: AG(EF(((((MSG_1>=1)&&(R_tout_0>=1))||((MSG_2>=1)&&(R_tout_0>=1)))||((MSG_0>=1)&&(R_tout_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((MSG_1>=1)&&(R_tout_0>=1))||((MSG_2>=1)&&(R_tout_0>=1)))||((MSG_0>=1)&&(R_tout_0>=1))))))] = FALSE
(forward)formula 2,1,1.77161,53692,1,0,226,214576,196,101,2670,185410,233
Formula is TRUE !

***************************************

original formula: AG(EF(((((FMC_1>=1)&&(S_tout_0>=1))||((FMC_2>=1)&&(S_tout_0>=1)))||((FMC_0>=1)&&(S_tout_0>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((FMC_1>=1)&&(S_tout_0>=1))||((FMC_2>=1)&&(S_tout_0>=1)))||((FMC_0>=1)&&(S_tout_0>=1))))))] = FALSE
(forward)formula 3,1,2.4066,81172,1,0,242,313897,197,111,2672,272364,259
Formula is TRUE !

***************************************

original formula: AG(EF(((((MSG_2>=1)&&(wait_msg_2>=1))||((MSG_0>=1)&&(wait_msg_0>=1)))||((MSG_1>=1)&&(wait_msg_1>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((MSG_2>=1)&&(wait_msg_2>=1))||((MSG_0>=1)&&(wait_msg_0>=1)))||((MSG_1>=1)&&(wait_msg_1>=1))))))] = FALSE
(forward)formula 4,1,2.57963,87772,1,0,249,336487,198,115,2674,292006,270
Formula is TRUE !

***************************************

original formula: AG(EF(((((((((((Cpt1_1>=1)&&(loop_em_1>=1))||((Cpt1_1>=1)&&(loop_em_2>=1)))||((Cpt1_2>=1)&&(loop_em_0>=1)))||((Cpt1_1>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_2>=1)))||((Cpt1_0>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_2>=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((((((((((Cpt1_1>=1)&&(loop_em_1>=1))||((Cpt1_1>=1)&&(loop_em_2>=1)))||((Cpt1_2>=1)&&(loop_em_0>=1)))||((Cpt1_1>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_0>=1)))||((Cpt1_2>=1)&&(loop_em_2>=1)))||((Cpt1_0>=1)&&(loop_em_1>=1)))||((Cpt1_0>=1)&&(loop_em_2>=1))))))] = FALSE
(forward)formula 5,1,2.90737,91468,1,0,256,360920,199,119,2678,317530,282
Formula is TRUE !

***************************************

Able to resolve query Liveness after proving 14 properties.
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

BK_STOP 1653217724283

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Liveness"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 gold2021"
echo " Input is SafeBus-COL-03, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-oct2-165281606200129"
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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;